• learning figures with the hausdorff metric by fractals—towards computable binary classification

    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 1079
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     we present learning of figures, nonempty compact sets in euclidean space, based on gold’s learning model aiming at a computable foundation for binary classification of multivariate data. encoding real vectors with no numerical error requires infinite sequences, resulting in a gap between each real vector and its discretized representation used for the actual machine learning process. our motivation is to provide an analysis of machine learning problems that explicitly tackles this aspect which has been glossed over in the literature on binary classification as well as in other machine learning tasks such as regression and clustering. in this paper, we amalgamate two processes: discretization and binary classification. each learning target, the set of real vectors classified as positive, is treated as a figure. a learning machine receives discretized vectors as input data and outputs a sequence of discrete representations of the target figure in the form of self-similar sets, known as fractals. the generalization error of each output is measured by the hausdorff metric. using this learning framework, we reveal a hierarchy of learnable classes under various learning criteria in the track of traditional analysis based on gold’s learning model, and show a mathematical connection between machine learning and fractal geometry by measuring the complexity of learning using the hausdorff dimension and the vc dimension. moreover, we analyze computability aspects of learning of figures using the framework of type-2 theory of effectivity (tte).

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها