Fast Clustering via Anchor Label Alignment and Transition Probabilities

Jingwei Chen;Jingqing Cheng;Shiyu Xie;Jia Zhao;Feiping Nie
{"title":"Fast Clustering via Anchor Label Alignment and Transition Probabilities","authors":"Jingwei Chen;Jingqing Cheng;Shiyu Xie;Jia Zhao;Feiping Nie","doi":"10.1109/TAI.2026.3699280","DOIUrl":null,"url":null,"abstract":"Anchor-based clustering techniques have gained considerable attention for their efficiency and ability to capture representative information. However, traditional methods often suffer from separate stages of spectral feature extraction and discretization, leading to critical information loss and reduced clustering performance. Additionally, most existing models require tuning of hyperparameters introduced by various regularization terms, limiting their practicality. To address these issues, we propose a novel method that aligns anchor-to-anchor transition probabilities via the correlation of anchor labels, and implicitly incorporates objectives of maximizing intra-cluster similarity and balanced clustering, called fast clustering via anchor label alignment and transition probabilities (FC-ALATP). The regularization parameter does not require manual tuning, which be updated in closed form. Moreover, the optimization stage scales linearly with the number of anchors; specifically, two solvers, projected gradient descent (PGD) and fast coordinate descent (fast CD), are developed. Extensive experiments demonstrate that fast CD outperforms PGD, and FC-ALATP achieves superior performance over other anchor-based models with less time cost.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"7 10","pages":"5736-5752"},"PeriodicalIF":0.0000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/11547206/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/6/2 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Anchor-based clustering techniques have gained considerable attention for their efficiency and ability to capture representative information. However, traditional methods often suffer from separate stages of spectral feature extraction and discretization, leading to critical information loss and reduced clustering performance. Additionally, most existing models require tuning of hyperparameters introduced by various regularization terms, limiting their practicality. To address these issues, we propose a novel method that aligns anchor-to-anchor transition probabilities via the correlation of anchor labels, and implicitly incorporates objectives of maximizing intra-cluster similarity and balanced clustering, called fast clustering via anchor label alignment and transition probabilities (FC-ALATP). The regularization parameter does not require manual tuning, which be updated in closed form. Moreover, the optimization stage scales linearly with the number of anchors; specifically, two solvers, projected gradient descent (PGD) and fast coordinate descent (fast CD), are developed. Extensive experiments demonstrate that fast CD outperforms PGD, and FC-ALATP achieves superior performance over other anchor-based models with less time cost.
基于锚标对齐和转移概率的快速聚类
基于锚点的聚类技术因其高效和捕获代表性信息的能力而受到广泛关注。然而,传统方法往往存在光谱特征提取和离散分离的问题,导致关键信息丢失,降低聚类性能。此外,大多数现有模型需要调整由各种正则化项引入的超参数,限制了它们的实用性。为了解决这些问题,我们提出了一种新的方法,通过锚点标签的相关性来对齐锚点到锚点的转移概率,并隐含地结合了最大化聚类内相似性和平衡聚类的目标,称为通过锚点标签对齐和转移概率的快速聚类(FC-ALATP)。正则化参数不需要手动调优,以封闭形式更新。优化阶段与锚点数量呈线性关系;具体来说,提出了投影梯度下降法(PGD)和快速坐标下降法(fast CD)两种求解方法。大量实验表明,快速CD优于PGD, FC-ALATP比其他基于锚点的模型具有更低的时间成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.70
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书