Aug 2026· Journal of Military Science and Technology· Vol 113, pp. 158-167· 0 citations· 4 references
TL;DR
A semi-supervised fuzzy graph cut clustering algorithm (SS-FGCC), which integrates anchor-point labels into fuzzy clustering and exploits graph structures to improve clustering quality while reducing computational complexity to linear time, is proposed.
Abstract
Traditional feature-based clustering algorithms often fail to capture the geometric structure of data effectively. To address this limitation, this paper proposes a semi-supervised fuzzy graph cut clustering algorithm (SS-FGCC), which integrates anchor-point labels into fuzzy clustering and exploits graph structures to improve clustering quality while reducing computational complexity to linear time. Experiments on six synthetic datasets and five UCI datasets demonstrate that SS-FGCC consistently outperforms RCut, NCut, FCM, FFCAG, FGCC, and CEHM, achieving up to 82.76% accuracy. Moreover, the proposed method remains stable on large-scale datasets where conventional graph cut methods often suffer from memory limitations, making SS-FGCC an efficient and scalable clustering solution.
Attributed graph clustering aims to group nodes that are similar with respect to both graph structure and node attributes. However, effectively combining these two sources of information remains challenging, as structural proximity does not necessarily imply attribute similarity. The problem becomes even more difficult...
Youness Soussou, Loubna Mekouar, Youssef Iraqi et al.· Proceedings of the 35th ACM...· 0 citations
Markov clustering (MCL) is a widely used clustering algorithm for graph data partitioning. However, it suffers from three key limitations: the lack of theoretical investigation into the reliability of graph construction methods for MCL, difficulty in parameter expansion tuning, and the reliance on global pruning strate...
Le Li, Fei Wang, P. Fränti· Knowledge and Information Sy...· 0 citations
The normalized cut (NCut) problem is a fundamental one in the area of data clustering. Despite its fractional structure, the NCut problem is seldom considered from a fractional programming (FP) perspective in the existing literature. The main reason is that the conventional FP method is inadequate for this problem case...
Yan-Nan Chen, Bei-Chen Huang, Li-Cheng Zhao et al.· IEEE Transactions on Mobile...· 0 citations
Multi-view spectral clustering provides powerful modeling tools for clustering tasks in complex scenarios by fusing the complementary information of multi-source data. However, the existing methods have the following three defects: (1) failing to fully exploit the complementarity and differences among views, leading to...
Jian Wei, Jiang-Zhang Gan, Bo Zhou et al.· Electronics· 0 citations
Clustering graphs into different groups is a challenging problem due to the difficulty in quantifying the similarity or distance between graphs, especially when the graphs are large. In this work, we propose a novel approach by treating the adjacency matrices of two graphs as kernel matrices derived from some unknown i...
Ji-Cong Fan· IEEE Transactions on Pattern...· 0 citations
Data stream scenarios characterized by partially labeled data and evolving distributions pose significant challenges for clustering and classification methods. In particular, existing semi-supervised fuzzy clustering approaches often struggle to appropriately adapt the number of clusters over time, especially in the pr...
Gabriella Casalino, M. Boratyn, Katarzyna Kaczmarek-Majer· IEEE Conference on Evolving...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.