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.