Clustering in applications with multiple data sources-A mutual subspace clustering approach

Neurocomputing

Volumn 92, Issue , 2012, Pages 133-144

  Hua, Ming ^a   Pei, Jian ^b  

^a FACEBOOK   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Clustering; Multiple sources

Indexed keywords

BOTTOM UP METHODS; CLUSTERING; CUSTOMER RELATIONSHIP MANAGEMENT; DATA MINING TASKS; DATA SETS; DATA SOURCE; DENSE REGION; DENSITY-BASED; DENSITY-BASED MODEL; FORM CLUSTERS; HIGH-DIMENSIONAL; K-MEANS CLUSTERING; LOW-DIMENSIONAL SUBSPACE; MULTIPLE DATA; MULTIPLE SOURCE; NUMBER OF CLUSTERS; REAL DATA SETS; SUBSPACE CLUSTERING; SUBSPACE CLUSTERS; SYNTHETIC DATASETS; TOP-DOWN METHODS;

BIOINFORMATICS;

CLUSTERING ALGORITHMS;

ALGORITHM; ARTICLE; CLUSTER ANALYSIS; DATA MINING; DENSITY BASED MODEL; MATHEMATICAL MODEL; MUTUAL SUBSPACE CLUSTERING; PARTITIONING MODEL; PRIORITY JOURNAL;

EID: 84861481435     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2011.08.032     Document Type: Article

References (29)

1. C.C. Aggarwal, J.L. Wolf, P.S. Yu, C. Procopiuc, J.S. Park, Fast algorithms for projected clustering, in: Proceedings of 1999 ACM-SIGMOD International Conference on Management of Data (SIGMOD'99), Philadelphia, PA, June 1999, pp. 61-72.
2. C.C. Aggarwal, P.S. Yu, Finding generalized projected clusters in high dimensional spaces, in: Proceedings of 2000 ACM-SIGMOD International Conference on Management of Data (SIGMOD'00), Dallas, TX, May 2000, pp. 70-81.
3. R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan, Automatic subspace clustering of high dimensional data for data mining applications, in: Proceedings of 1998 ACM-SIGMOD International Conference on Management of Data (SIGMOD'98), Seattle, WA, June 1998, pp. 94-105.
4. Chang J.-W., Jin D.-S. A new cell-based clustering method for large, high-dimensional data in data mining applications. SAC'02: Proceedings of the 2002 ACM symposium on Applied computing 2002, 503-507. ACM Press, New York, NY, USA.
5. Chaudhuri K., Kakade S.M., Livescu K., Sridharan K. Multi-view clustering via canonical correlation analysis. Proceedings of the 26th Annual International Conference on Machine Learning, ICML'09 2009, 129-136. ACM, New York, NY, USA.
6. C.H. Cheng, A.W.-C. Fu, Y. Zhang, Entropy-based subspace clustering for mining numerical data, in: Proceedings of 1999 International Conference on Knowledge Discovery and Data Mining (KDD'99), San Diego, CA, August 1999, pp. 84-93.
7. Děroski S. Multi-relational data mining: an introduction. SIGKDD Explor. Newsl. 2003, 5(1):1-16.
8. M. Ester, R. Ge, B.J. Gao, Z. Hu, B. Ben-Moshe, Joint cluster analysis of attribute data and relationship data: the connected k-center problem, in: SDM, 2006.
9. M. Ester, H.-P. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases, in: Proceedings of 1996 International Conference on Knowledge Discovery and Data Mining (KDD'96), Portland, Oregon, August 1996, pp. 226-231.
10. M. Ester, H.-P. Kriegel, J. Sander, X. Xu, Density-connected sets and their application for trend detection in spatial databases, in: Proceedings of 1997 International Conference on Knowledge Discovery and Data Mining (KDD'97), Newport Beach, CA, August 1997, pp. 10-15.
11. Friedman J.H., Meulman J.J. Clustering objects on subsets of attributes. J. R. Stat. Soc. Ser. B 2004, 66(4):815.
12. Lin C.-R., Liu K.-H., Chen M.-S. Dual clustering: integrating data clustering over optimization and constraint domains. IEEE Trans. Knowledge Data Eng. 2005, 17(5):628-637.
13. Liu B., Xia Y., Yu P.S. Clustering through decision tree construction. CIKM'00: Proceedings of the Ninth International Conference on Information and Knowledge Management 2000, 20-29. ACM Press, New York, NY, USA.
14. B. Long, P.S. Yu, Z. Zhang, A general model for multiple view unsupervised learning, in: SDM, 2008, pp. 822-833.
15. Muslea I., Minton S., Knoblock C.A. Active learning with multiple views. J. Artif. Int. Res. 2006, 27(October):203-233.
16. H. Nagesh, S. Goil, A. Choudhary, Mafia: efficient and scalable subspace clustering for very large data sets, Technical Report 9906-010, Northwestern University, June 1999.
17. Ng A.Y., Jordan M.I., Weiss Y. On spectral clustering: analysis and an algorithm. Advances in Neural Information Processing Systems 2001, 849-856. MIT Press.
18. Parsons L., Haque E., Liu H. Subspace clustering for high dimensional data: a review. SIGKDD Explor. Newsl. 2004, 6(1):90-105.
19. J. Pei, D. Jiang, A. Zhang, On mining cross-graph quasi-cliques, in: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'05), Chicago, IL, USA, August 2005.
20. J. Pei, X. Zhang, M. Cho, H. Wang, P.S. Yu, Maple: a fast algorithm for maximal pattern-based clustering, in: Proceedings of the Third IEEE International Conference on Data Mining (ICDM'03), IEEE, Melbourne, FL, November 2003.
21. Procopiuc C.M., Jones M., Agarwal P.K., Murali T.M. A Monte Carlo algorithm for fast projective clustering. SIGMOD'02: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data 2002, 418-427. ACM Press, New York, NY, USA.
22. R. Rymon, Search through systematic set enumeration, in: Proceedings of 1992 International Conference on Principle of Knowledge Representation and Reasoning (KR'92), Cambridge, MA, 1992, pp. 539-550.
23. Segal E., Wang H., Koller D. Discovering molecular pathways from protein interaction and gene expression data. Bioinformatics 2003, 19(Suppl 1).
24. H. Wang, W. Wang, J. Yang, P.S. Yu, Clustering by pattern similarity in large data sets, in: Proceedings of 2002 ACM-SIGMOD International Conference on Management of Data (SIGMOD'02), Madison, WI, June 2002.
25. Woo K.-G., Lee J.-H., Kim M.-H., Lee Y.-J. Findit: a fast and intelligent subspace clustering algorithm using dimension voting. Inf. Software Technol. 2004, 46(4):255-271.
26. Xia T., Tao D., Mei T., Zhang Y. Multiview spectral embedding. Trans. Syst. Man Cyber. Part B 2010, 40(December):1438-1446.
27. B. Xie, Y. Mu, D. Tao, m-sne: Multiview stochastic neighbor embedding, in: ICONIP (1)'10, 2010, pp. 338-346.
28. J. Yang, W. Wang, H. Wang, P.S. Yu, δ-cluster: capturing subspace correlation in a large data set, in: Proceedings of 2002 International Conference on Data Engineering (ICDE'02), San Fransisco, CA, April 2002.
29. T. Zhou, D. Tao, Fast gradient clustering, in: NIPS 2009 Workshop on Discrete Optimization in Machine Learning: Submodularity, Sparsity & Polyhedra (NIPS: DISCML), 2009, pp. 1-6.