Recently, data mining applications require a large amount of high-dimensional data. Most algorithms for data mining applications, however, do not work efficiently for high-dimensional large data because of the so-called ‘curse of dimensionality’[1...
Recently, data mining applications require a large amount of high-dimensional data. Most algorithms for data mining applications, however, do not work efficiently for high-dimensional large data because of the so-called ‘curse of dimensionality’[1] and the limitation of available memory. To overcome these problems, this paper proposes a new cell-based clustering method which is more efficient than the existing algorithms for high-dimensional large data. Our clustering method provides a cell construction algorithm for dealing with high-dimensional large data and a index structure based on filtering. We do performance comparison of our cell-based clustering method with the CLIQUE method in terms of clustering time, precision and retrieval time. Finally, the results from our experiment show that our cell-based clustering method outperform the CLIQUE method.