arXiv:2605. 08759v3 Announce Type: replace Abstract: Existing granular-ball generation methods are still mainly driven by handcrafted quality measures and heuristic splitting or stopping criteria, which may weaken the transparency of local generation decisions in clustering.
By Zeqiang Xian, Caihui Liu, Yong Zhang, Wenjing Qiu, Duoqian Miao, Witold Pedrycz
arXiv:2608. 12903v1 Announce Type: new Abstract: The $k$-Nearest Neighbor~(KNN) algorithm is widely used across various tasks.
By Xiaoyu Lian, Shuyin Xia, Hongxuan He, Lifeng Shen, Guoyin Wang, Xinbo Gao
arXiv:2607. 29115v1 Announce Type: cross Abstract: Link prediction aims to identify potential or future connections within a given graph structure.
By Sen Zhao, Cheng Liu, Shuyin Xia, Zhiyuan Liu, Yi Liu, Yi Wang, Wei Wang
arXiv:2606. 12077v1 Announce Type: new Abstract: Time-series clustering remains challenging due to the inherent trade-off between clustering effectiveness and computational efficiency.
By Yifan Wang, Lifeng Shen, Shuyin Xia, Yi Wang
arXiv:2404. 03082v3 Announce Type: replace Abstract: Partially ordered sets (posets) are discrete mathematical structures that formalize the notion of comparison without forcing every pair of objects to be comparable.
By Arnauld Mesinga Mwafise
arXiv:2607. 21381v1 Announce Type: new Abstract: Instance-level explanations aim to reveal the rationale behind a model's decisions for a specific graph.
By Jiancu Chen, Shuyin Xia, Guan Wang, Degang Chen, Fan Chen