Fast parameter-free multi-view subspace clustering with consensus anchor guidance
Multi-view subspace clustering has attracted intensive attention to effectively fuse multi-view
information by exploring appropriate graph structures. Although existing works have made …
information by exploring appropriate graph structures. Although existing works have made …
Highly-efficient incomplete large-scale multi-view clustering with consensus bipartite graph
Multi-view clustering has received increasing attention due to its effectiveness in fusing
complementary information without manual annotations. Most previous methods hold the …
complementary information without manual annotations. Most previous methods hold the …
Late fusion multiple kernel clustering with proxy graph refinement
Multiple kernel clustering (MKC) optimally utilizes a group of pre-specified base kernels to
improve clustering performance. Among existing MKC algorithms, the recently proposed late …
improve clustering performance. Among existing MKC algorithms, the recently proposed late …
Local sample-weighted multiple kernel clustering with consensus discriminative graph
Multiple kernel clustering (MKC) is committed to achieving optimal information fusion from a
set of base kernels. Constructing precise and local kernel matrices is proven to be of vital …
set of base kernels. Constructing precise and local kernel matrices is proven to be of vital …
Multiview subspace clustering via low-rank symmetric affinity graph
Multiview subspace clustering (MVSC) has been used to explore the internal structure of
multiview datasets by revealing unique information from different views. Most existing …
multiview datasets by revealing unique information from different views. Most existing …
Multi-view bipartite graph clustering with coupled noisy feature filter
Unsupervised bipartite graph learning has been a hot topic in multi-view clustering, to tackle
the restricted scalability issue of traditional full graph clustering in large-scale applications …
the restricted scalability issue of traditional full graph clustering in large-scale applications …
A survey on high-dimensional subspace clustering
W Qu, X **u, H Chen, L Kong - Mathematics, 2023 - mdpi.com
With the rapid development of science and technology, high-dimensional data have been
widely used in various fields. Due to the complex characteristics of high-dimensional data, it …
widely used in various fields. Due to the complex characteristics of high-dimensional data, it …
Consistent multiple graph embedding for multi-view clustering
Graph-based multi-view clustering aiming to obtain a partition of data across multiple views,
has received considerable attention in recent years. Although great efforts have been made …
has received considerable attention in recent years. Although great efforts have been made …
Late fusion multiple kernel clustering with local kernel alignment maximization
Multi-view clustering, which appropriately integrates information from multiple sources to
reveal data's inherent structure, is gaining traction in clustering. Though existing procedures …
reveal data's inherent structure, is gaining traction in clustering. Though existing procedures …
Adaptive weighted ensemble clustering via kernel learning and local information preservation
T Li, X Shu, J Wu, Q Zheng, X Lv, J Xu - Knowledge-Based Systems, 2024 - Elsevier
Ensemble clustering refers to learning a robust and accurate consensus result from a
collection of base clustering results. Despite extensive research on this topic, it remains …
collection of base clustering results. Despite extensive research on this topic, it remains …