Robust deep-means: An effective and simple method for data clustering
Authors:
- Shudong HuangSHShudong Huang
- Zhao KangZKZhao Kang
- Zenglin XuZXZenglin Xu
- Quanhui LiuQLQuanhui Liu
- 1 September 2021
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 117
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
- Fundamental Research Funds for the Central Universities
- Science and Technology Bureau of Chengdu
This publication has 17 references indexed in Scilit:
- An efficient approximation to the K-means clustering for massive dataKnowledge-Based Systems, 2017
- An improved overlapping k-means clustering method for medical applicationsExpert Systems with Applications, 2017
- A Deep Matrix Factorization Method for Learning Attribute RepresentationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2016
- Robust level set image segmentation via a local correntropy-based K-means clusteringPattern Recognition, 2014
- Algorithms for Nonnegative Matrix Factorization with the β-DivergenceNeural Computation, 2011
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2010
- Learning Deep Architectures for AIFoundations and Trends in Machine Learning, 2009
- Convex and Semi-Nonnegative Matrix FactorizationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2008
- Top 10 algorithms in data miningKnowledge and Information Systems, 2007
- Information theoretic clusteringIEEE Transactions on Pattern Analysis and Machine Intelligence, 2002