Constructing a prior-dependent graph for data clustering and dimension reduction in the edge of AIoT
Abstract The Artificial Intelligence Internet of Things (AIoT) is an emerging concept aiming to
perceive, understand and connect the 'intelligent things' to make the intercommunication of …
perceive, understand and connect the 'intelligent things' to make the intercommunication of …
Multiview spectral clustering via structured low-rank matrix factorization
Multiview data clustering attracts more attention than their single-view counterparts due to
the fact that leveraging multiple independent and complementary information from multiview …
the fact that leveraging multiple independent and complementary information from multiview …
Beyond linear subspace clustering: A comparative study of nonlinear manifold clustering algorithms
Subspace clustering is an important unsupervised clustering approach. It is based on the
assumption that the high-dimensional data points are approximately distributed around …
assumption that the high-dimensional data points are approximately distributed around …
Multiview subspace clustering via tensorial t-product representation
The ubiquitous information from multiple-view data, as well as the complementary
information among different views, is usually beneficial for various tasks, for example …
information among different views, is usually beneficial for various tasks, for example …
Low-rank preserving projection via graph regularized reconstruction
Preserving global and local structures during projection learning is very important for feature
extraction. Although various methods have been proposed for this goal, they commonly …
extraction. Although various methods have been proposed for this goal, they commonly …
Density peak clustering based on relative density relationship
J Hou, A Zhang, N Qi - Pattern Recognition, 2020 - Elsevier
The density peak clustering algorithm treats local density peaks as cluster centers, and
groups non-center data points by assuming that one data point and its nearest higher …
groups non-center data points by assuming that one data point and its nearest higher …
Low-rank local tangent space embedding for subspace clustering
Subspace techniques have gained much attention for their remarkable efficiency in
representing high-dimensional data, in which sparse subspace clustering (SSC) and low …
representing high-dimensional data, in which sparse subspace clustering (SSC) and low …
Feature concatenation multi-view subspace clustering
Multi-view clustering is a learning paradigm based on multi-view data. Since statistic
properties of different views are diverse, even incompatible, few approaches implement …
properties of different views are diverse, even incompatible, few approaches implement …
Consensus affinity graph learning for multiple kernel clustering
Significant attention to multiple kernel graph-based clustering (MKGC) has emerged in
recent years, primarily due to the superiority of multiple kernel learning (MKL) and the …
recent years, primarily due to the superiority of multiple kernel learning (MKL) and the …
Convergence analysis of single latent factor-dependent, nonnegative, and multiplicative update-based nonnegative latent factor models
A single latent factor (LF)-dependent, nonnegative, and multiplicative update (SLF-NMU)
learning algorithm is highly efficient in building a nonnegative LF (NLF) model defined on a …
learning algorithm is highly efficient in building a nonnegative LF (NLF) model defined on a …