One-step Multi-view Clustering with Consensus Graph and Data Representation Convolution
Abstract
References
Recommendations
Direct multi-view spectral clustering with consistent kernelized graph and convolved nonnegative representation
AbstractMulti-view clustering attempts to partition unlabeled objects into clusters by making full use of complementary and consistent information in the features of multiple views. Most existing methods perform this task in three sequential phases: ...
Consensus graph and spectral representation for one-step multi-view kernel based clustering
AbstractRecently, multi-view clustering has received much attention in the fields of machine learning and pattern recognition. Spectral clustering for single and multiple views has been the common solution. Despite its good clustering ...
One step multi-view spectral clustering via joint adaptive graph learning and matrix factorization
AbstractMulti-view clustering based on graph learning has attracted extensive attention due to its simplicity and efficiency in recent years. However, there are still some issues in most of the existing graph-based multi-view clustering ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 231Total Downloads
- Downloads (Last 12 months)170
- Downloads (Last 6 weeks)12
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in