Enhanced soft subspace clustering integrating within-cluster and between-cluster information

Pattern Recognition

Volumn 43, Issue 3, 2010, Pages 767-781

  Deng, Zhaohong ^a,b   Choi, Kup Sze ^b   Chung, Fu Lai ^b   Wang, Shitong ^a,c  

^a JIANGNAN UNIVERSITY   (China)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^c ZHEJIANG UNIVERSITY   (China)

Author keywords

insensitive distance; Gene expression clustering analysis; Soft subspace; Subspace clustering; Texture image segmentation; Weighted clustering

Indexed keywords

CANCER GENE EXPRESSION; CLASS INFORMATION; CLUSTER SEPARATION; DATA SETS; EXPERIMENTAL STUDIES; GENE EXPRESSION CLUSTERING; HIGH DIMENSIONAL DATASETS; HIGH-DIMENSIONAL; NOVEL CLUSTERING; OBJECTIVE FUNCTIONS; OPTIMIZATION OBJECTIVE FUNCTION; SUBSPACE CLUSTERING; SYNTHETIC DATASETS; TEXTURE IMAGE; TEXTURE IMAGE SEGMENTATION;

BIOACTIVITY; DIGITAL IMAGE STORAGE; GENE EXPRESSION; IMAGE SEGMENTATION; TEXTURES;

CLUSTERING ALGORITHMS;

EID: 70449699648     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2009.09.010     Document Type: Article

References (49)

1. Jain A., Murty M., and Flynn P. Data clustering: a review. ACM Comput. Surv. 31 (1999) 264-323
2. Cao Y., and Wu J. Projective ART for clustering data sets in high dimensional spaces. Neural Networks 15 (2002) 105-120
3. A. Hotho, A. Maedche, S. Staab, Ontology-based text document clustering, in: Proceedings of the IJCAI 2001 Workshop on Text Learning: Beyond Supervision, 2001.
4. Parsons L., Haque E., and Liu H. Subspace clustering for high dimensional data: a review. SIGKDD Explorations 6 1 (2004) 90-105
5. R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1998, pp. 94-105.
6. C.H. Cheng, A.W. Fu, Y. Zhang, Entropy-Based Subspace Clustering for Mining Numerical Data, in: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge and Data Mining, 1999, pp. 84-93.
7. S. Goil, H. Nagesh, A. Choudhary, Mafia: efficient and scalable subspace clustering for very large data sets, Technical Report CPDC-TR-9906-010, Northwest University, 1999.
8. C. Aggarwal, C. Procopiuc, J.L. Wolf, P.S. Yu, J.S. Park, Fast algorithms for projected clustering, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 1999, pp. 61-72.
9. C.C. Aggarwal, P.S. Yu, Finding generalized projected clusters in high dimensional spaces, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, 2000, pp. 70-81.
10. K.G. Woo, J.H. Lee, Findit: A fast and intelligent subspace clustering algorithm using dimension voting, Ph.D. Dissertation, Korea Advanced Institute of Science and Technology, 2002.
11. C.M. Procopiuc, M. Jones, P.K. Agarwal, T.M. Murali, A Monte Carlo algorithm for fast projective clustering, in: Proceedings of the ACM SIGMOD Conference on Management of Data, 2002, pp. 418-427.
12. J. Yang, W. Wang, H. Wang, P. Yu, δ-clusters: Capturing subspace correlation in a large data set, in: Proceedings of the 18th International Conference on Data Engineering, 2002, pp. 517-528.
13. Yip K.Y., Cheung D.W., and Ng M.K. A practical projected clustering algorithm. IEEE Trans. Knowl. Data Eng. 16 11 (2004) 1387-1397
14. K. Chakrabarti, S. Mehrotra, Local dimensionality reduction: A new approach to indexing high dimensional spaces, in: Proceedings of the 26th International Conference on Very Large Data Bases, 2000, pp. 89-100.
15. De Soete G. Optimal variable weighting for ultrametric and additive tree clustering. Qual. Quantity 20 (1986) 169-180
16. De Soete G. OVWTRE: a program for optimal variable weighting for ultrametric and additive tree fitting. J. Classification 5 (1988) 101-104
17. Makarenkov V., and Legendre P. Optimal variable weighting for ultrametric and additive trees and k-means partitioning: methods and software. J. Classification 18 (2001) 245-271
18. Huang J.Z., Ng M.K., Rong H., and Li Z. Automated variable weighting in k-means type clustering. IEEE Trans. Pattern Anal. Mach. Intell. 27 5 (2005) 657-668
19. Chan Y., Ching W., Ng M.K., and Huang J.Z. An optimization algorithm for clustering using weighted dissimilarity measures. Pattern Recognition 37 5 (2004) 943-952
20. Frigui H., and Nasraoui O. Unsupervised learning of prototypes and attribute weights. Pattern Recognition 37 3 (2004) 567-581
21. Frigui H., and Nasraoui O. Simultaneous Clustering and Dynamic Keyword Weighting for Text Documents. In: Berry M. (Ed). Survey of Text Mining (2004), Springer, Berlin 45-70
22. C. Domeniconi, D. Papadopoulos, D. Gunopulos, S. Ma, Subspace clustering of high dimensional data, in: Proceedings of the SIAM International Conference on Data Mining, 2004.
23. Friedman J.H., and Meulman J.J. Clustering objects on subsets of attributes. J. R. Stat. Soc. B 66 4 (2004) 815-849
24. L. Jing, M.K. Ng, J. Xu, J.Z. Huang, Subspace clustering of text documents with feature weighting k-means algorithm, in: Proceedings of the Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2005, pp. 802-812.
25. G.J. Gan, J.H. Wu, Z.J. Yang, A fuzzy subspace algorithm for clustering high dimensional data, in: X. Li, O. Zaiane, Z. Li (Eds.), Lecture Notes in Artificial Intelligence, vol. 4093, Springer, Berlin, 2006, pp. 271-278.
26. Gan G.J., and Wu J.H. A convergence theorem for the fuzzy subspace clustering (FSC) algorithm. Pattern Recognition 41 (2008) 1939-1947
27. Jing L.P., Ng M.K., and Huang Z.X. An entropy weighting k-means algorithm for subspace clustering of high-dimensional sparse data. IEEE Trans. Knowl. Data Eng. 19 8 (2007) 1026-1041
28. Domeniconi C., Gunopulos D., Ma S., Yan B., Al-Razgan M., and Papadopoulos D. Locally adaptive metrics for clustering high dimensional data. Data Min. Knowl. Discovery J. 14 (2007) 63-97
29. Wu K.L., Yu J., and Yang M.S. A novel fuzzy clustering algorithm based on a fuzzy scatter matrix with optimality tests. Pattern Recognition Lett. 26 5 (2005) 639-652
30. Leski J.M. Towards a robust clustering. Fuzzy Sets Syst. 137 2 (2003) 191-196
31. Wang S.T., Chung F.L., Deng Z.H., Hu D.W., and Wu X. Robust maximum entropy clustering algorithm with its labeling for outliers. Soft Comput. 10 7 (2006) 555-563
32. Vapnik V. Statistical Learning Theory (1998), Wiley, NewYork
33. Yu J., and Yang M.S. Optimality test for generalized FCM and its application to parameter selection. IEEE Trans. Fuzzy Syst. 13 1 (2005) 164-176
34. Yu J., Cheng Q.S., and Huang H.K. Analysis of the weighting exponent in the FCM. IEEE Trans. Syst., Man, Cybern.-Part B: Cybern. 34 1 (2004) 164-176
35. C. Domeniconi, M. Al-Razgan, Weighted cluster ensembles: methods and analysis, Technical Report ISE-TR-07-06, December 2007.
36. Liu J., Mohammed J., Carter J., et al. Distance-based clustering of CGH data. Bioinformatics 22 16 (2006) 1971-1978
37. D.J. Newman, S. Hettich, C.L. Blake, et al., UCI repository of machine learning databases, Department of Information and Computer Science, University of California, Irvine, 〈http://archive.ics.uci.edu/ml/〉.
38. Pomeroy S.L., et al. Prediction of central nervous system embryonal tumour outcome based on gene expression. Nature 415 (2002) 436-442
39. Welsh J.B. Analysis of gene expression identifies candidate markers and pharmacological targets in prostate cancer. Cancer Res. 61 (2001) 5974-5978
40. Perou C.M., et al. Molecular portraits of human breast tumours. Nature 406 (2000) 747-752
41. Alizadeh A.A., et al. Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. Nature 403 (2000) 503-511
42. Bhattacharjee A., et al. Classification of human lung carcinomas by mRNA expression profiling reveals distinct adenocarcinoma subclasses. Proc. Nat. Acad. Sci. USA 98 (2001) 13790-13795
43. T. Randen, Brodatz Texture, 〈http://www.ux.uis.no/∼tranden/brodatz.html〉.
44. Kyrki V., Kamarainen J.K., and Kälviäinen H. Simple Gabor feature space for invariant object recognition. Pattern Recognition Lett. 25 3 (2004) 311-318
45. Karypis G., and Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20 1 (1998) 359-392
46. A.Y. Ng, M. Jordan, Y. Weiss, On spectral clustering: analysis and an algorithm, in: Proceedings of NIPS, 2001, pp. 849-856.
47. Das S., Abraham A., and Konar A. Automatic clustering using an improved differential evolution algorithm. IEEE Trans. Syst., Man Cybern., Part A 38 1 (2008) 218-237
48. Bezdek J.C., Hathaway R.J., Sabin M.J., and Tucker W. Convergence theory for fuzzy c-means: counter-examples and repairs. IEEE Trans. Syst., Man, Cybern. 17 5 (1987) 873-877
49. E.P. Xing, A.Y. Ng, M.I. Jordan, S.J. Russell, Distance metric learning with application to clustering with side-information, in: Proceedings of NIPS, 2003, pp. 505-512.