Abstract: The task of biclustering or subspace clustering is a data mining technique that allows simultaneous clustering of rows and columns of a matrix. Though the definition of similarity varies from one biclustering model to another, in most of these models the concept of similarity is often based on such metrics as Manhattan distance, Euclidean distance or other Lp distances. In other words, similar objects must have close values in at least a set of dimensions. Pattern-based clustering is important in many applications, such as DNA micro-array data analysis, automatic recommendation systems and target marketing systems. However, pattern-based clustering in large databases is challenging. On the one hand, there can be a huge number of clusters and many of them can be redundant and thus makes the pattern-based clustering ineffective. On the other hand, the previous proposed methods may not be efficient or scalable in mining large databases. The objective of this paper is to perform a comparative study of all subspace clustering algorithms in terms of efficiency, accuracy and time complexity.

Debahuti Mishra, Shruti Mishra, Sandeep Satapathy, Amiya Kumar Rath and Milu Acharya, “PATTERN BASED SUBSPACE CLUSTERING: A REVIEW ” International Journal of Advanced Computer Science and Applications(IJACSA), 1(2), 2010. http://dx.doi.org/10.14569/IJACSA.2010.010206

@article{Mishra2010,
title = {PATTERN BASED SUBSPACE CLUSTERING: A REVIEW },
journal = {International Journal of Advanced Computer Science and Applications}
doi = {10.14569/IJACSA.2010.010206},
url = {http://dx.doi.org/10.14569/IJACSA.2010.010206},
year = {2010},
publisher = {The Science and Information Organization},
volume = {1},
number = {2},
author = {Debahuti Mishra and Shruti Mishra and Sandeep Satapathy and Amiya Kumar Rath and Milu Acharya},
}