IEEE Transactions on Artificial Intelligence · 2021 · 59 citations · 68 references
ComputingComputer ScienceData ScienceData MiningMachine LearningStatistical ModelingClustered Data AnalysisMatrix FactorizationMulti-view ClusteringNon-negative Matrix FactorizationReal-world ApplicationRegularized Matrix Factorization
Multiview clustering has wide real-world applications because it can process data from multiple sources. However, these data often contain missing instances and noises, which are ignored by most multiview clustering methods. Missing instances may make these methods difficult to use directly, and noises will lead to unreliable clustering results. In this article, we propose a novel autoweighted noisy and incomplete multiview clustering (ANIMC) approach via a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">soft</i> autoweighted strategy and a doubly <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">soft</i> regular regression model. First, by designing adaptive semiregularized nonnegative matrix factorization, the soft autoweighted strategy assigns a <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">proper</i> weight to each view and adds a soft boundary to balance the influence of noises and incompleteness. Second, by proposing <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\theta$</tex-math></inline-formula> -norm, the doubly soft regularized regression model adjusts the sparsity of our model by choosing different <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\theta$</tex-math></inline-formula> . Compared with previous methods, ANIMC has three unique advantages: 1) it is a soft algorithm to adjust our approach in different scenarios, thereby improving its generalization ability; 2) it automatically learns a proper weight for each view, thereby reducing the influence of noises; 3) it performs doubly soft regularized regression that aligns the same instances in different views, thereby decreasing the impact of missing instances. Extensive experimental results show its superior advantages over other state-of-the-art works.
68
On Spectral Clustering: Analysis and an algorithm
Andrew Y. Ng, Michael I. Jordan, Yair Weiss · 2001 · 7.8K citations
Combining labeled and unlabeled data with co-training
Avrim Blum, Tom M. Mitchell · 1998 · 5.6K citations · Full text
Accuracy and stability of numerical algorithms
Choice Reviews Online · 1996 · 2.1K citations