Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering

ABSTRACT

As a prolific research area in data mining, subspace clustering and related problems induced a vast quantity of proposed solutions. However, many publications compare a new proposition—if at all—with one or two competitors, or even with a so-called “naïve” ad hoc solution, but fail to clarify the exact problem definition. As a consequence, even if two solutions are thoroughly compared experimentally, it will often remain unclear whether both solutions tackle the same problem or, if they do, whether they agree in certain tacit assumptions and how such assumptions may influence the outcome of an algorithm. In this survey, we try to clarify: (i) the different problem definitions related to subspace clustering in general; (ii) the specific difficulties encountered in this field of research; (iii) the varying assumptions, heuristics, and intuitions forming the basis of different approaches; and (iv) how several prominent solutions tackle different problems.

REFERENCES

• 1: Achtert, E., Böhm, C., David, J., Kröger, P., and Zimek, A. 2008. Robust clustering in arbitrarily oriented subspaces. In Proceedings of the 8th SIAM International Conference on Data Mining (SDM).
• 2: Achtert, E., Böhm, C., Kriegel, H.-P., Kröger, P., Müller-Gorman, I., and Zimek, A. 2007. Detection and visualization of subspace cluster hierarchies. In Proceedings of the 12th International Conference on Database Systems for Advanced Applications (DASFAA).
• 3: Elke Achtert , Christian Böhm , Hans-Peter Kriegel , Peer Kröger , Arthur Zimek, Deriving quantitative models for correlation clusters, Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, August 20-23, 2006, Philadelphia, PA, USA [doi>10.1145/1150402.1150408]
• 4: Elke Achtert , Christian Bohm , Hans-Peter Kriegel , Peer Kroger , Arthur Zimek, On Exploring Complex Relationships of Correlation Clusters, Proceedings of the 19th International Conference on Scientific and Statistical Database Management, p.7, July 09-11, 2007 [doi>10.1109/SSDBM.2007.21]
• 5: Achtert, E., Böhm, C., Kriegel, H.-P., Kröger, P., and Zimek, A. 2007b. Robust, complete, and efficient correlation clustering. In Proceedings of the 7th SIAM International Conference on Data Mining (SDM).
• 6: Elke Achtert , Christian Bohm , Peer Kroger , Arthur Zimek, Mining Hierarchies of Correlation Clusters, Proceedings of the 18th International Conference on Scientific and Statistical Database Management, p.119-128, July 03-05, 2006 [doi>10.1109/SSDBM.2006.35]
• 7: Elke Achtert , Hans-Peter Kriegel , Arthur Zimek, ELKI: A Software System for Evaluation of Subspace Clustering Algorithms, Proceedings of the 20th international conference on Scientific and Statistical Database Management, July 09-11, 2008, Hong Kong, China [doi>10.1007/978-3-540-69497-7_41]
• 8: Charu C. Aggarwal , Alexander Hinneburg , Daniel A. Keim, On the Surprising Behavior of Distance Metrics in High Dimensional Spaces, Proceedings of the 8th International Conference on Database Theory, p.420-434, January 04-06, 2001
• 9: Charu C. Aggarwal , Joel L. Wolf , Philip S. Yu , Cecilia Procopiuc , Jong Soo Park, Fast algorithms for projected clustering, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.61-72, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
• 10: Charu C. Aggarwal , Philip S. Yu, Finding generalized projected clusters in high dimensional spaces, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.70-81, May 15-18, 2000, Dallas, Texas, United States
• 11: Rakesh Agrawal , Johannes Gehrke , Dimitrios Gunopulos , Prabhakar Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.94-105, June 01-04, 1998, Seattle, Washington, United States
• 12: Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proceedings of the ACM International Conference on Management of Data (SIGMOD).
• 13: Mihael Ankerst , Markus M. Breunig , Hans-Peter Kriegel , Jörg Sander, OPTICS: ordering points to identify the clustering structure, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.49-60, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
• 14: Ira Assent , Ralph Krieger , Emmanuel Müller , Thomas Seidl, DUSC: Dimensionality Unbiased Subspace Clustering, Proceedings of the 2007 Seventh IEEE International Conference on Data Mining, p.409-414, October 28-31, 2007 [doi>10.1109/ICDM.2007.49]
• 15: Ira Assent , Ralph Krieger , Emmanuel Müller , Thomas Seidl, VISA: visual subspace clustering analysis, ACM SIGKDD Explorations Newsletter, v.9 n.2, December 2007 [doi>10.1145/1345448.1345451]
• 16: Nikhil Bansal , Avrim Blum , Shuchi Chawla, Correlation Clustering, Machine Learning, v.56 n.1-3, p.89-113 [doi>10.1023/B:MACH.0000033116.57574.95]
• 17: Daniel Barbará , Ping Chen, Using the fractal dimension to cluster datasets, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.260-264, August 20-23, 2000, Boston, Massachusetts, United States [doi>10.1145/347090.347145]
• 18: Bellman, R. 1961. Adaptive Control Processes. A Guided Tour. Princeton University Press.
• 19: Alberto Belussi , Christos Faloutsos, Estimating the Selectivity of Spatial Queries Using the `Correlation' Fractal Dimension, Proceedings of the 21th International Conference on Very Large Data Bases, p.299-310, September 11-15, 1995
• 20: Amir Ben-Dor , Benny Chor , Richard Karp , Zohar Yakhini, Discovering local structure in gene expression data: the order-preserving submatrix problem, Proceedings of the sixth annual international conference on Computational biology, p.49-57, April 18-21, 2002, Washington, DC, USA [doi>10.1145/565196.565203]
• 21: Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces, Proceedings of the 16th International Conference on Data Engineering, p.577, February 28-March 03, 2000
• 22: Stefan Berchtold , Christian Böhm , Hans-Peter Kriegal, The pyramid-technique: towards breaking the curse of dimensionality, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.142-153, June 01-04, 1998, Seattle, Washington, United States
• 23: Stefan Berchtold , Bernhard Ertl , Daniel A. Keim , Hans-Peter Kriegel , Thomas Seidl, Fast Nearest Neighbor Search in High-Dimensional Space, Proceedings of the Fourteenth International Conference on Data Engineering, p.209-218, February 23-27, 1998
• 24: Stefan Berchtold , Daniel A. Keim , Hans-Peter Kriegel, The X-tree: An Index Structure for High-Dimensional Data, Proceedings of the 22th International Conference on Very Large Data Bases, p.28-39, September 03-06, 1996
• 25: Kevin S. Beyer , Jonathan Goldstein , Raghu Ramakrishnan , Uri Shaft, When Is ''Nearest Neighbor'' Meaningful?, Proceedings of the 7th International Conference on Database Theory, p.217-235, January 10-12, 1999
• 26: Christopher M. Bishop, Pattern Recognition and Machine Learning (Information Science and Statistics), Springer-Verlag New York, Inc., Secaucus, NJ, 2006
• 27: Bouveyron, C., Girard, S., and Schmid, C. 2007. High-dimensional data clustering. Comput. Statist. Data Anal. 52, 502--519.
• 28: Christian Bohm , Karin Kailing , Hans-Peter Kriegel , Peer Kroger, Density Connected Clustering with Local Subspace Preferences, Proceedings of the Fourth IEEE International Conference on Data Mining, p.27-34, November 01-04, 2004
• 29: Christian Böhm , Karin Kailing , Peer Kröger , Arthur Zimek, Computing Clusters of Correlation Connected objects, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France [doi>10.1145/1007568.1007620]
• 30: Christian Böhm , Hans-Peter Kriegel, Dynamically Optimizing High-Dimensional Index Structures, Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology, p.36-50, March 27-31, 2000
• 31: Böhm, C. and Kriegel, H.-P. 2000b. Efficient construction of large high-dimensional indexes. In Proceedings of the 16th International Conference on Data Engineering (ICDE).
• 32: Andrea Califano , Gustavo Stolovitzky , Yuhai Tu, Analysis of Gene Expression Microarrays for Phenotype Classification, Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, p.75-85, August 19-23, 2000
• 33: Kaushik Chakrabarti , Sharad Mehrotra, Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces, Proceedings of the 26th International Conference on Very Large Data Bases, p.89-100, September 10-14, 2000
• 34: Chun-Hung Cheng , Ada Waichee Fu , Yi Zhang, Entropy-based subspace clustering for mining numerical data, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.84-93, August 15-18, 1999, San Diego, California, United States [doi>10.1145/312129.312199]
• 35: Cheng, H., Hua, K. A., and Vu, K. 2008. Constrained locally weighted clustering. In Proceedings of the 34nd International Conference on Very Large Data Bases (VLDB).
• 36: Yizong Cheng , George M. Church, Biclustering of Expression Data, Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, p.93-103, August 19-23, 2000
• 37: Cho, H., Dhillon, I. S., Guan, Y., and Sra, S. 2004. Minimum sum-squared residue co-clustering of gene expression data. In Proceedings of the 4th SIAM International Conference on Data Mining (SDM).
• 38: Inderjit S. Dhillon, Co-clustering documents and words using bipartite spectral graph partitioning, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.269-274, August 26-29, 2001, San Francisco, California [doi>10.1145/502512.502550]
• 39: Domeniconi, C., Papadopoulos, D., Gunopulos, D., and Ma, S. 2004. Subspace clustering of high dimensional data. In Proceedings of the 4th SIAM International Conference on Data Mining (SDM).
• 40: Richard O. Duda , Peter E. Hart, Use of the Hough transformation to detect lines and curves in pictures, Communications of the ACM, v.15 n.1, p.11-15, Jan. 1972 [doi>10.1145/361237.361242]
• 41: Richard O. Duda , Peter E. Hart , David G. Stork, Pattern Classification (2nd Edition), Wiley-Interscience, 2000
• 42: Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd ACM International Conference on Knowledge Discovery and Data Mining (KDD).
• 43: Christos Faloutsos , Ibrahim Kamel, Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.4-13, May 24-27, 1994, Minneapolis, Minnesota, United States [doi>10.1145/182591.182593]
• 44: Christos Faloutsos , Vasileios Megalooikonomou, On data mining, compression, and Kolmogorov complexity, Data Mining and Knowledge Discovery, v.15 n.1, p.3-20, August 2007 [doi>10.1007/s10618-006-0057-3]
• 45: Martin A. Fischler , Robert C. Bolles, Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography, Communications of the ACM, v.24 n.6, p.381-395, June 1981 [doi>10.1145/358669.358692]
• 46: Friedman, J. H. and Meulman, J. J. 2004. Clustering objects on subsets of attributes. J. Royal Statist. Soc. Series B (Statistical Methodology) 66, 4, 825--849.
• 47: Bernhard Ganter , C. Franzke , Rudolf Wille, Formal Concept Analysis: Mathematical Foundations, Springer-Verlag New York, Inc., Secaucus, NJ, 1997
• 48: Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
• 49: Elisabeth Georgii , Lothar Richter , Ulrich Rückert , Stefan Kramer, Analyzing microarray data using quantitative association rules, Bioinformatics, v.21 n.2, p.123-129, January 2005 [doi>10.1093/bioinformatics/bti1121]
• 50: Getz, G., Levine, E., and Domany, E. 2000. Coupled two-way clustering analysis of gene microarray data. Proc. National Academy Sci. United States Amer. 97, 22, 12079--12084.
• 51: Aristides Gionis , Alexander Hinneburg , Spiros Papadimitriou , Panayiotis Tsaparas, Dimension induced clustering, Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA [doi>10.1145/1081870.1081880]
• 52: Jiawei Han, Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2005
• 53: Jiawei Han, Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2005
• 54: David J. Hand , Padhraic Smyth , Heikki Mannila, Principles of data mining, MIT Press, Cambridge, MA, 2001
• 55: Haralick, R. and Harpaz, R. 2005. Linear manifold clustering. In Proceedings of the 4th International Conference on Machine Learning and Data Mining in Pattern Recognition (MLDM).
• 56: Rave Harpaz , Robert Haralick, Model-based linear manifold clustering, City University of New York, New York, NY, 2008
• 57: Harpaz, R. and Haralick, R. 2007a. Linear manifold correlation clustering. Int. J. Inf. Technol. Intell. Comput. 2, 2.
• 58: Harpaz, R. and Haralick, R. 2007b. Mining subspace correlations. In Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining (CIDM).
• 59: Hartigan, J. A. 1972. Direct clustering of a data matrix. J. Amer. Statist. Assoc. 67, 337, 123--129.
• 60: Hastie, T., Tibshirani, R., and Friedman, J. 2001. The Elements of Statistical Learning. Data Mining, Inference, and Prediction. Springer.
• 61: Alexander Hinneburg , Charu C. Aggarwal , Daniel A. Keim, What Is the Nearest Neighbor in High Dimensional Spaces?, Proceedings of the 26th International Conference on Very Large Data Bases, p.506-515, September 10-14, 2000
• 62: Hough, P. V. C. 1962. Methods and means for recognizing complex patterns. U.S. patent 3069654.
• 63: Joshua Zhexue Huang , Michael K. Ng , Hongqiang Rong , Zichen Li, Automated Variable Weighting in k-Means Type Clustering, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.27 n.5, p.657-668, May 2005 [doi>10.1109/TPAMI.2005.95]
• 64: Jan Ihmels , Sven Bergmann , Naama Barkai, Defining transcription modules using large-scale gene expression data, Bioinformatics, v.20 n.13, p.1993-2003, September 2004 [doi>10.1093/bioinformatics/bth166]
• 65: A. K. Jain , M. N. Murty , P. J. Flynn, Data clustering: a review, ACM Computing Surveys (CSUR), v.31 n.3, p.264-323, Sept. 1999 [doi>10.1145/331499.331504]
• 66: Daxin Jiang , Chun Tang , Aidong Zhang, Cluster Analysis for Gene Expression Data: A Survey, IEEE Transactions on Knowledge and Data Engineering, v.16 n.11, p.1370-1386, November 2004 [doi>10.1109/TKDE.2004.68]
• 67: Liping Jing , Michael K. Ng , Joshua Zhexue Huang, An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data, IEEE Transactions on Knowledge and Data Engineering, v.19 n.8, p.1026-1041, August 2007 [doi>10.1109/TKDE.2007.1048]
• 68: Jolliffe, I. T. 2002. Principal Component Analysis, 2nd ed. Springer.
• 69: Kailing, K., Kriegel, H.-P., and Kröger, P. 2004. Density-Connected subspace clustering for high-dimensional data. In Proceedings of the 4th SIAM International Conference on Data Mining (SDM).
• 70: Norio Katayama , Shin'ichi Satoh, The SR-tree: an index structure for high-dimensional nearest neighbor queries, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.369-380, May 11-15, 1997, Tucson, Arizona, United States
• 71: Jon R. Kettenring, A Perspective on Cluster Analysis, Statistical Analysis and Data Mining, v.1 n.1, p.52-53, February 2008 [doi>10.1002/sam.v1:1]
• 72: Flip Korn , Bernd-Uwe Pagel , Christos Faloutsos, On the 'Dimensionality Curse' and the 'Self-Similarity Blessing', IEEE Transactions on Knowledge and Data Engineering, v.13 n.1, p.96-111, January 2001 [doi>10.1109/69.908983]
• 73: Hans-Peter Kriegel , Peer Kroger , Matthias Renz , Sebastian Wurst, A Generic Framework for Efficient Subspace Clustering of High-Dimensional Data, Proceedings of the Fifth IEEE International Conference on Data Mining, p.250-257, November 27-30, 2005 [doi>10.1109/ICDM.2005.5]
• 74: Hans-Peter Kriegel , Peer Kröger , Erich Schubert , Arthur Zimek, A General Framework for Increasing the Robustness of PCA-Based Correlation Clustering Algorithms, Proceedings of the 20th international conference on Scientific and Statistical Database Management, July 09-11, 2008, Hong Kong, China [doi>10.1007/978-3-540-69497-7_27]
• 75: Kriegel, H.-P., Kröger, P., and Zimek, A. 2007. Detecting clusters in moderate-to-high-dimensional data: Subspace clustering, pattern-based clustering, and correlation clustering. Tutorial at the 7th International Conference on Data Mining (ICDM).
• 76: Li, J., Huang, X., Selke, C., and Yong, J. 2007. A fast algorithm for finding correlation clusters in noise data. In Proceedings of the 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD).
• 77: King Ip Lin , H. V. Jagadish , Christos Faloutsos, The TV-tree: an index structure for high-dimensional data, The VLDB Journal — The International Journal on Very Large Data Bases, v.3 n.4, October 1994
• 78: Bing Liu , Yiyuan Xia , Philip S. Yu, Clustering through decision tree construction, Proceedings of the ninth international conference on Information and knowledge management, p.20-29, November 06-11, 2000, McLean, Virginia, United States [doi>10.1145/354756.354775]
• 79: Liu, G., Li, J., Sim, K., and Wong, L. 2007. Distance based subspace clustering with flexible dimension partitioning. In Proceedings of the 23th International Conference on Data Engineering (ICDE).
• 80: Jinze Liu , Wei Wang, OP-Cluster: Clustering by Tendency in High Dimensional Space, Proceedings of the Third IEEE International Conference on Data Mining, p.187, November 19-22, 2003
• 81: Sara C. Madeira , Arlindo L. Oliveira, Biclustering Algorithms for Biological Data Analysis: A Survey, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), v.1 n.1, p.24-45, January 2004 [doi>10.1109/TCBB.2004.2]
• 82: Mirkin, B. 1996. Mathematical Classification and Clustering. Kluwer.
• 83: Mitchell, T. M. 1997. Mach. Learn.. McGraw-Hill.
• 84: Gabriela Moise , Jörg Sander, Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering, Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2008, Las Vegas, Nevada, USA [doi>10.1145/1401890.1401956]
• 85: Gabriela Moise , Jorg Sander , Martin Ester, P3C: A Robust Projected Clustering Algorithm, Proceedings of the Sixth International Conference on Data Mining, p.414-425, December 18-22, 2006 [doi>10.1109/ICDM.2006.123]
• 86: Gabriela Moise , Jörg Sander , Martin Ester, Robust projected clustering, Knowledge and Information Systems, v.14 n.3, p.273-298, March 2008 [doi>10.1007/s10115-007-0090-6]
• 87: Murali, T. M. and Kasif, S. 2003. Extracting conserved gene expression motifs from gene expression data. In Proceedings of the 8th Pacific Symposium on Biocomputing (PSB).
• 88: Nagesh, H., Goil, S., and Choudhary, A. 2001. Adaptive grids for clustering massive data sets. In Proceedings of the 1st SIAM International Conference on Data Mining (SDM).
• 89: Deflating the Dimensionality Curse Using Multiple Fractal Dimensions, Proceedings of the 16th International Conference on Data Engineering, p.589, February 28-March 03, 2000
• 90: Parros Machado de Sousa, E., Traina, C., Traina, A., and Faloutsos, C. 2002. How to use fractal dimension to find correlations between attributes. In Proceedings of the KDD-Workshop on Fractals and Self-Similarity in Data Mining: Issues and Approaches.
• 91: Lance Parsons , Ehtesham Haque , Huan Liu, Subspace clustering for high dimensional data: a review, ACM SIGKDD Explorations Newsletter, v.6 n.1, p.90-105, June 2004 [doi>10.1145/1007730.1007731]
• 92: Jian Pei , Xiaoling Zhang , Moonjung Cho , Haixun Wang , Philip S. Yu, MaPle: A Fast Algorithm for Maximal Pattern-based Clustering, Proceedings of the Third IEEE International Conference on Data Mining, p.259, November 19-22, 2003
• 93: John L. Pfaltz, What Constitutes a Scientific Database?, Proceedings of the 19th International Conference on Scientific and Statistical Database Management, p.2, July 09-11, 2007 [doi>10.1109/SSDBM.2007.25]
• 94: Amela Prelić , Stefan Bleuler , Philip Zimmermann , Anja Wille , Peter Bühlmann , Wilhelm Gruissem , Lars Hennig , Lothar Thiele , Eckart Zitzler, A systematic comparison and evaluation of biclustering methods for gene expression data, Bioinformatics, v.22 n.9, p.1122-1129, May 2006 [doi>10.1093/bioinformatics/btl060]
• 95: Cecilia M. Procopiuc , Michael Jones , Pankaj K. Agarwal , T. M. Murali, A Monte Carlo algorithm for fast projective clustering, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin [doi>10.1145/564691.564739]
• 96: Ulrich Ruckert , Lothar Richter , Stefan Kramer, Quantitative Association Rules Based on Half-Spaces: An Optimization Approach, Proceedings of the Fourth IEEE International Conference on Data Mining, p.507-510, November 01-04, 2004
• 97: Segal, E., Taskar, B., Gasch, A., Friedman, N., and Koller, D. 2001. Rich probabilistic models for gene expression. Bioinf. 17, 1, S243--S252.
• 98: Karlton Sequeira , Mohammed Zaki, SCHISM: a new approach to interesting subspace mining, International Journal of Business Intelligence and Data Mining, v.1 n.2, p.137-160, December 2005 [doi>10.1504/IJBIDM.2005.008360]
• 99: Sheng, Q., Moreau, Y., and De Moor, B. 2003. Biclustering microarray data by Gibbs sampling. Bioinf. 19, 2, ii196--ii205.
• 100: Kelvin Sim , Jinyan Li , Vivekanand Gopalkrishnan , Guimei Liu, Mining Maximal Quasi-Bicliques to Co-Cluster Stocks and Financial Ratios for Value Investment, Proceedings of the Sixth International Conference on Data Mining, p.1059-1063, December 18-22, 2006 [doi>10.1109/ICDM.2006.111]
• 101: Slagle, J. L., Chang, C. L., and Heller, S. L. 1975. A clustering and data-reorganization algorithm. IEEE Trans. Syst. Man. Cybernetics 5, 121--128.
• 102: Pang-Ning Tan , Michael Steinbach , Vipin Kumar, Introduction to Data Mining, (First Edition), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 2005
• 103: Tanay, A., Sharan, R., and Shamir, R. 2002. Discovering statistically significant biclusters in gene expression data. Bioinf. 18, 1, S136--S144.
• 104: Tanay, A., Sharan, R., and Shamir, R. 2006. Biclustering algorithms: A survey. In Handbook of Computational Molecular Biology, S. Aluru, Ed. Chapman & Hall.
• 105: Anthony K. H. Tung , Xin Xu , Beng Chin Ooi, CURLER: finding and visualizing nonlinear correlation clusters, Proceedings of the 2005 ACM SIGMOD international conference on Management of data, June 14-16, 2005, Baltimore, Maryland [doi>10.1145/1066157.1066211]
• 106: Van Mechelen, I., Bock, H.-H., and De Boeck, P. 2004. Two-Mode clustering methods: A structured overview. Statist. Methods Med. Res. 13, 363--394.
• 107: Haixun Wang , Wei Wang , Jiong Yang , Philip S. Yu, Clustering by pattern similarity in large data sets, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin [doi>10.1145/564691.564737]
• 108: Geoffrey I. Webb, Discovering associations with numeric variables, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.383-388, August 26-29, 2001, San Francisco, California [doi>10.1145/502512.502569]
• 109: Roger Weber , Hans-Jörg Schek , Stephen Blott, A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces, Proceedings of the 24rd International Conference on Very Large Data Bases, p.194-205, August 24-27, 1998
• 110: Ian H. Witten , Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems), Morgan Kaufmann Publishers Inc., San Francisco, CA, 2005
• 111: Woo, K.-G., Lee, J.-H., Kim, M.-H., and Lee, Y.-J. 2004. FINDIT: A fast and intelligent subspace clustering algorithm using dimension voting. Inf. Softw. Technol. 46, 4, 255--271.
• 112: d-Clusters: Capturing Subspace Correlation in a Large Data Set, Proceedings of the 18th International Conference on Data Engineering, p.517, February 26-March 01, 2002
• 113: Kevin Y. Yip , David W. Cheung , Michael K. Ng, HARP: A Practical Projected Clustering Algorithm, IEEE Transactions on Knowledge and Data Engineering, v.16 n.11, p.1387-1397, November 2004 [doi>10.1109/TKDE.2004.74]
• 114: Kevin Y. Yip , David W. Cheung , Michael K. Ng, On Discovery of Extremely Low-Dimensional Clusters Using Semi-Supervised Projected Clustering, Proceedings of the 21st International Conference on Data Engineering, p.329-340, April 05-08, 2005 [doi>10.1109/ICDE.2005.96]
• 115: Man Lung Yiu , Nikos Mamoulis, Frequent-Pattern based Iterative Projected Clustering, Proceedings of the Third IEEE International Conference on Data Mining, p.689, November 19-22, 2003
• 116: Man Lung Yiu , Nikos Mamoulis, Iterative Projected Clustering by Subspace Mining, IEEE Transactions on Knowledge and Data Engineering, v.17 n.2, p.176-189, February 2005 [doi>10.1109/TKDE.2005.29]

INDEX TERMS

Primary Classification:
  A. General Literature
  A.1 INTRODUCTORY AND SURVEY

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.8 Database applications
          Subjects: Data mining

  I. Computing Methodologies
  I.5 PATTERN RECOGNITION
      I.5.3 Clustering

General Terms:
Algorithms, Theory

Keywords:
Survey, clustering, high-dimensional data