Assessing classification complexity of datasets using fractals. (22nd October 2019)

• Record Type: Journal Article
• Authors: Marasca, André Luiz; Casanova, Dalcimar; Teixeira, Marcelo
• Is Part Of: International journal of computational science and engineering. Volume 20:Number 1(2019)
• Page Start: 102
• Page End: 119
• Publication Date: 2019-10-22
• Subjects: supervised classification -- fractal analysis -- chaotic datasets -- transition border -- fractal dimension -- complexity; Computer science -- Mathematics -- Periodicals; Computer simulation -- Mathematical aspects -- Periodicals; Computational intelligence -- Periodicals; 004.015105
• Languages: English
• ISSNs: 1742-7185

Abstract

Supervised classification is a mechanism used in machine learning to associate classes with objects from datasets. Depending on the dimension and on the internal data structuring, classification may become complex. In this paper, we claim that the complexity level of a given dataset can be estimated by using fractal analysis. A novel fractal measure, called transition border, is proposed in order to estimate the chaos behind labelled points distribution. Their correlation with the success rate is tested by comparing it against results obtained from other supervised classification methods. Results suggest that this approach can be used to measure the complexity behind a classification task problem in real-valued datasets with three dimensions. The proposed method can also be useful for other science domains for which fractal analysis is applicable.