arrow
返回

Adaptive Neighbors Graph Learning for Large-Scale Data Clustering using Vector Quantization and Self-Regularization

delete2024-12-01
delete0
PRE
AI
Y
Yongda Cai
J
Joshua Zhexue Huang *
A
Alladoumbaye Ngueilbaye
X
Xudong Sun
DOI:10.1016/j.asoc.2024.112256delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In traditional adaptive neighbors graph learning (ANGL)-based clustering, the time complexity is more than O(n(2)), where n is the number of data points, which is not scalable for large-scale data problems in real applications. Subsequently, ANGL adds a balance regularization to its objective function to avoid the sparse over-fitting problem in the learned similarity graph matrix. Still, the regularization may leads to many weak connections between data points in different clusters. To address these problems, we propose a new fast clustering method, namely, Adaptive Neighbors Graph Learning for Large-Scale Data Clustering using Vector Quantization and Self-Regularization (ANGL-LDC), to perform vector quantization (VQ) on original data and feed the obtained VQ data as the input in the nxn similarity graph matrix learning. Hence, the nxn similarity graph matrix learning problem is simplified to weighted mxm (m << n) graph learning problem, where m is the number of distinct points and weight is the duplicate times of distinct points in VQ data. Consequently, the time complexity of ANGL-LDC is much lower than that of ANGL. At the same time, we propose a new ANGL objective function with a graph connection self-regularization mechanism, where the ANGL-LDC objective function will get an infinity value if the value of one graph connection is equal to 1. Therefore, ANGL-LDC naturally avoids obtaining the sparse over-fitting problem since we need to minimize the value of ANGL-LDC's objective function. Experimental results on synthetic and real-world datasets demonstrate the scalability and effectiveness of ANGL-LDC.
Keyword:
Fast clustering
Vector quantization
Fast adaptive neighbors graph learning
Graph connection self-regularization

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

S
shenzhen university
学者数:
4.6W
论文数: 3.4W
被引数: 72
引用论文

引用论文

Three-way clustering: Foundations, survey and challenges三向聚类: 基础、调查和挑战
err2024-01-01
err11
PREAI
errWang, Pingxin; Yang, Xibei; Ding, Weiping; Zhan, Jianming; Yao, Yiyu
err分享
err收藏
err分享
err收藏
err分享
err收藏
Label propagation with structured graph learning for semi-supervised dimension reduction
err2021-08-01
err22
PREAI
errWang, Fei; Zhu, Lei; Xie, Liang; Zhang, Zheng; Zhong, Mingyang
err分享
err收藏
Deep Clustering With Sample-Assignment Invariance Prior具有样本分配不变性先验的深度聚类
err2020-11-01
err125
PREAI
errPeng, Xi; Zhu, Hongyuan; Feng, Jiashi; Shen, Chunhua; Zhang, Haixian; Zhou, Joey Tianyi
err分享
err收藏
Coffee, Climate and Biodiversity: Understanding the Carbon Stocks of the Shade Coffee Production System of India
err2018-08-29
err0
PREAI
errNadesa Panicker Anil Kumar; Amsad Ibrahim Khan Saleem Khan; Vaniyan Balakrishnan
err分享
err收藏
Joint unsupervised contrastive learning and robust GMM for text clustering
err2024-01-01
err5
PREAI
errHu, Chenxi; Wu, Tao; Liu, Shuaiqi; Liu, Chunsheng; Ma, Tao; Yang, Fang
err分享
err收藏
Structure-aware preserving projections with applications to medical image clustering
err2024-06-01
err2
PREAI
errYu, Keyang; Zhu, Yike; Yin, Xuesong; Shu, Ting; Wang, Yigang; Hu, Enliang
err分享
err收藏
Comparison of optimal actuation patterns for flagellar magnetic micro-swimmers
err2020-01-01
err0
errOAAI
errYacine E. Faris; Jean-Baptiste Pomet; Stéphane Régnier; Laetitia Giraldi
err分享
err收藏
学者 查看更多内容