In this project, we introduce the concept of intrinsic "fractal" dimension of a data set and show how this can be used to aid in several data mining tasks. We are interested in answering questions about the performance of a method and also in comparing between the methods quickly. In particular, we discuss two specific problems -- dimensionality reduction and vector quantization. In each of these problems, we show how the performance of a method is related to the fractal dimension of the data set. Using real and synthetic data sets, we validate these relationships and show how we can use this for faster evaluation and comparison of the methods
Dimensionality curse and dimensionality reduction are two issues that have retained high interest fo...
Data mining refers to the automation of data analysis to extract patterns from large amounts of data...
This book provides a generalised approach to fractal dimension theory from the standpoint of asymmet...
In this paper, the problem of estimating the intrinsic dimension of a data set is investigated. A fr...
We show that the performance of a vector quantizer for a self-similar data set is related to the int...
This paper presents a method for extracting the real dimension of a large data set in a high-dimensi...
Many 0/1 datasets have a very large number of variables; however, they are sparse and the dependency...
This article discusses the interplay in fractal geometry occurring between computer programs for dev...
In this paper, data dimensionality estimation methods are reviewed. The estimation of the dimensiona...
Data mining refers to the automation of data analysis to extract patterns from large amounts of data...
Data mining refers to the automation of data analysis to extract patterns from large amounts of data...
This thesis studies the theoretical and experimental determination of the fractal dimension of diffe...
Data mining refers to the automation of data analysis to extract patterns from large amounts of data...
Fractal analysis is an important tool when we need to study geometrical objects less regular than or...
Nearest neighbor queries are important in many settings, including spatial databases (Find the k clo...
Dimensionality curse and dimensionality reduction are two issues that have retained high interest fo...
Data mining refers to the automation of data analysis to extract patterns from large amounts of data...
This book provides a generalised approach to fractal dimension theory from the standpoint of asymmet...
In this paper, the problem of estimating the intrinsic dimension of a data set is investigated. A fr...
We show that the performance of a vector quantizer for a self-similar data set is related to the int...
This paper presents a method for extracting the real dimension of a large data set in a high-dimensi...
Many 0/1 datasets have a very large number of variables; however, they are sparse and the dependency...
This article discusses the interplay in fractal geometry occurring between computer programs for dev...
In this paper, data dimensionality estimation methods are reviewed. The estimation of the dimensiona...
Data mining refers to the automation of data analysis to extract patterns from large amounts of data...
Data mining refers to the automation of data analysis to extract patterns from large amounts of data...
This thesis studies the theoretical and experimental determination of the fractal dimension of diffe...
Data mining refers to the automation of data analysis to extract patterns from large amounts of data...
Fractal analysis is an important tool when we need to study geometrical objects less regular than or...
Nearest neighbor queries are important in many settings, including spatial databases (Find the k clo...
Dimensionality curse and dimensionality reduction are two issues that have retained high interest fo...
Data mining refers to the automation of data analysis to extract patterns from large amounts of data...
This book provides a generalised approach to fractal dimension theory from the standpoint of asymmet...