A sparsity-inducing formulation for evolutionary co-clustering

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 334-342

  Ji, Shuiwang ^a   Zhang, Wenlu ^a   Liu, Jun ^b  

^a OLD DOMINION UNIVERSITY   (United States)

^b SIEMENS CORPORATE RESEARCH   (United States)

Author keywords

bioinformatics; evolutionary co clustering; neuroscience; optimization; sparsity learning

Indexed keywords

BLOCK STRUCTURES; CO-CLUSTERING; DATA MATRICES; DUAL FORM; GRADIENT DESCENT ALGORITHMS; ITERATIVE PROCEDURES; MOUSE BRAIN; NEUROSCIENCE; NON-SMOOTH; ONE DIMENSION; OPTIMAL SOLUTIONS; OPTIMIZATION PROBLEMS; SMOOTHNESS CONSTRAINTS; SPARSITY LEARNING; TEMPORAL DIMENSIONS; TIME-VARYING DATA;

BIOINFORMATICS; DATA MINING; OPTIMIZATION; PROBLEM SOLVING;

MATRIX ALGEBRA;

EID: 84866039255     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339586     Document Type: Conference Paper

References (36)

1. A. Ahmed and E. P. Xing. Recovering time-varying networks of dependencies in social and biological studies. Proceedings of the National Academy of Sciences, 106(29):11878-11883, 2009.
2. J. W. Bohland, H. Bokil, C. B. Allen, and P. P. Mitra. The brain atlas concordance problem: Quantitative comparison of anatomical parcellations. PLoS ONE, 4(9):e7200, 09 2009.
3. J. W. Bohland et al. Clustering of spatial gene expression patterns in the mouse brain and comparison with classical neuroanatomy. Methods, 50(2):105-112, 2010.
4. S. Busygin, O. Prokopyev, and P. M. Pardalos. Biclustering in data mining. Computers and Operations Research, 35:2964-2987, September 2008.
5. D. Chakrabarti, R. Kumar, and A. Tomkins. Evolutionary clustering. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 554-560, 2006.
6. Y. Cheng and G. M. Church. Biclustering of expression data. In Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, pages 93-103, 2000.
7. Y. Chi, X. Song, D. Zhou, K. Hino, and B. L. Tseng. On evolutionary spectral clustering. ACM Transactions on Knowledge Discovery from Data, 3:17:1-17:30, December 2009.
8. H. Cho, I. S. Dhillon, Y. Guan, and S. Sra. Minimum sum-squared residue co-clustering of gene expression data. In Proceedings of the Fourth SIAM International Conference on Data Mining, 2004.
9. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In Proceedings of the seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 269-274, 2001.
10. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 89-98, 2003.
11. C. Ding, T. Li, W. Peng, and H. Park. Orthogonal nonnegative matrix t-factorizations for clustering. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 126-135, 2006.
12. C. Eckart and G. Young. The approximation of one matrix by another of lower rank. Psychometrika, 1(3):211-218, 1936.
13. J. Friedman, T. Hastie, H. Höfling, and R. Tibshirani. Pathwise coordinate optimization. Annals of Applied Statistics, 1(2):302-332, 2007.
14. E. Giannakidou, V. Koutsonikola, A. Vakali, and Y. Kompatsiaris. Co-clustering tags and social data sources. In Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management, pages 317-324, 2008.
15. N. Guan, D. Tao, Z. Luo, and B. Yuan. Non-negative patch alignment framework. IEEE Transactions on Neural Networks, 22(8):1218-1230, 2011.
16. N. Guan, D. Tao, Z. Luo, and B. Yuan. NeNMF: An optimal gradient method for nonnegative matrix factorization. IEEE Transactions on Signal Processing, 60(6):2882-2898, 2012.
17. J. A. Hartigan. Direct clustering of a data matrix. Journal of the American Statistical Association, 67(337):123-129, 1972.
18. H. Höfling. A path algorithm for the fused Lasso signal approximator. Journal of Computational and Graphical Statistics, 19(4):984-1006, 2010.
19. S. Ji. Computational network analysis of the anatomical and genetic organizations in the mouse brain. Bioinformatics, 27(23):3293-3299, 2011.
20. Y. Kluger, R. Basri, J. T. Chang, and M. Gerstein. Spectral biclustering of microarray data: Coclustering genes and conditions. Genome Research, 13(4):703-716, 2003.
21. M. Lee, H. Shen, J. Z. Huang, and J. S. Marron. Biclustering via sparse singular value decomposition. Biometrics, 66:1087-1095, 2010.
22. E. S. Lein et al. Genome-wide atlas of gene expression in the adult mouse brain. Nature, 445(7124):168-176, 2007.
23. Y.-R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B. L. Tseng. Analyzing communities and their evolutions in dynamic social networks. ACM Transactions on Knowledge Discovery from Data, 3:8:1-8:31, April 2009.
24. J. Liu, L. Yuan, and J. Ye. An efficient algorithm for a class of fused Lasso problems. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 323-332, 2010.
25. S. C. Madeira and A. L. Oliveira. Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1:24-45, January 2004.
26. A. Nemirovski. Efficient methods in convex programming, 1994. Lecture Notes.
27. Y. Nesterov. Introductory Lectures on Convex Optimization: A Basic Course. Kluwer Academic Publishers, 2003.
28. C. Soneson and M. Fontes. A method for visual identification of small sample subgroups and potential biomarkers. Annals of Applied Statistics, 5(3):2131-2149, 2011.
29. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B, 58(1):267-288, 1996.
30. R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight. Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(1):91-108, 2005.
31. R. Tibshirani and P. Wang. Spatial smoothing and hot spot detection for CGH data using the fused lasso. Biostatistics, 9(1):18-29, 2008.
32. H. Tong, S. Papadimitriou, P. S. Yu, and C. Faloutsos. Proximity tracking on time-evolving bipartite graphs. In Proceedings of the SIAM International Conference on Data Mining, pages 704-715, 2008.
33. P. Tseng. Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of Optimization Theory and Applications, 109:475-494, June 2001.
34. F. Wang, H. Tong, and C.-Y. Lin. Towards evolutionary nonnegative matrix factorization. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011.
35. J. Yoo and S. Choi. Orthogonal nonnegative matrix tri-factorization for co-clustering: Multiplicative updates on Stiefel manifolds. Information Processing and Management, 46(5):559-570, 2010.
36. H. Zha, X. He, C. Ding, H. Simon, and M. Gu. Bipartite graph partitioning and data clustering. In Proceedings of the tenth International Conference on Information and Knowledge Management, pages 25-32, 2001.