Sparsity Learning Formulations for Mining Time-Varying Data
- 20 November 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 27 (5) , 1411-1423
Abstract
Traditional clustering and feature selection methods consider the data matrix as static. However, the data matrices evolve smoothly over time in many applications. A simple approach to learn from these time-evolving data matrices is to analyze them separately. Such strategy ignores the time-dependent nature of the underlying data. In this paper, we propose two formulations for evolutionary co-clustering and feature selection based on the fused Lasso regularization. The evolutionary co-clustering formulation is able to identify smoothly varying hidden block structures embedded into the matrices along the temporal dimension. Our formulation is very flexible and allows for imposing smoothness constraints over only one dimension of the data matrices. The evolutionary feature selection formulation can uncover shared features in clustering from time-evolving data matrices. We show that the optimization problems involved are non-convex, non-smooth and non-separable. To compute the solutions efficiently, we develop a two-step procedure that optimizes the objective function iteratively. We evaluate the proposed formulations using the Allen Developing Mouse Brain Atlas data. Results show that our formulations consistently outperform prior methods.Keywords
Funding Information
- NSF (DBI-1147134, DBI-1356621)
- NSF (DBI-1350258)
- National Basic Research Program of China (2012CB316400)
- Program for Changjiang Scholars and Innovative Research Team in University (IRT201206)
- Program for New Century Excellent Talents in University (13-0661)
This publication has 38 references indexed in Scilit:
- Evolutionary Network AnalysisACM Computing Surveys, 2014
- Feature selection for k-means clustering stability: theoretical analysis and an algorithmData Mining and Knowledge Discovery, 2013
- Allen Brain Atlas: an integrated spatio-temporal portal for exploring the central nervous systemNucleic Acids Research, 2012
- A method for visual identification of small sample subgroups and potential biomarkersThe Annals of Applied Statistics, 2011
- Stability SelectionJournal of the Royal Statistical Society Series B: Statistical Methodology, 2010
- An efficient algorithm for a class of fused lasso problems2010
- Introduction to Information Retrieval2008
- Sparsity and Smoothness Via the Fused LassoJournal of the Royal Statistical Society Series B: Statistical Methodology, 2004
- Biclustering algorithms for biological data analysis: a surveyIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- Forebrain gene expression domains and the evolving prosomeric modelTrends in Neurosciences, 2003