Commentary · 2023
Research articlePublished Aug 2015
A Survey on Evolutionary Co-Clustering Formulations for Mining Time-Varying Data Using Sparsity Learning
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
The data matrix is considered as static in Traditional clustering and feature selection methods. 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. Two formulations are proposed for evolutionary co-clustering and feature selection based on the fused Lasso regularization. The evolutionary co-clustering formulation is able to identify smoothly varying data embedded into the matrices along with the temporal dimension. Formulation allows for imposing smoothness constraints over temporal dimension of the data matrices. The evolutionary feature selection formulation can uncover shared features in clustering from time-evolving data matrices.
Ask about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
More from this journal
The newest in International Journal of Innovative Research in Computer and Communication Engineering.
Commentary · 2023
Computer Network and Network Optimization
Perspective · 2023
Cloud Computing and Big Data Analysis
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Innovative Research in Computer and Communication Engineering
- SubjectComputer Science & IT
- SubjectEngineering
- SubjectSocial Sciences & Humanities
- BylineArticles whose byline prints “R.Amsaveni”
- BylineArticles whose byline prints “R. Suresh Kumar MCA”
