TY - JOUR
T1 - Fast Clustering via Anchor Label Alignment and Transition Probabilities
AU - Chen, Jingwei
AU - Cheng, Jingqing
AU - Xie, Shiyu
AU - Zhao, Jia
AU - Nie, Feiping
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2026
Y1 - 2026
N2 - 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 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 out-performs PGD, and FC-ALATP achieves superior performance over other anchor-based models with less time cost.
AB - 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 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 out-performs PGD, and FC-ALATP achieves superior performance over other anchor-based models with less time cost.
KW - Anchor-based clustering
KW - anchor transition probabilities
KW - balanced clustering
KW - bipartite graph
KW - label propagation mechanism
KW - optimization
UR - https://www.scopus.com/pages/publications/105041075402
U2 - 10.1109/TAI.2026.3699280
DO - 10.1109/TAI.2026.3699280
M3 - 文章
AN - SCOPUS:105041075402
SN - 2691-4581
JO - IEEE Transactions on Artificial Intelligence
JF - IEEE Transactions on Artificial Intelligence
ER -