SCGC-JWAF: Shallow contrastive graph clustering with Jaccard-based weighted adaptive filtering

Node clustering has gained significant attention due to its effectiveness in uncovering hidden structures in graph-structured data. However, real-world graphs often contain noise and are sparsely connected, which negatively impacts clustering accuracy. Moreover, unweighted graphs cannot reflect the varying strengths of connections between nodes, resulting in less discriminative representations and poor clustering outcomes. To address this, we propose SCGC-JWAF, a shallow contrastive node clustering model that introduces a weighted adaptive filter based on node intimacy-driven graph. First, we construct the weighted graph by combining graph’s structural data with jaccard similarity information. Then, we design a weighted adaptive filter with a new weight factor and the modified graph that incorporates high-pass and low-pass filters. By using a weighted Jaccard-based graph in the filtering process, nodes with higher Jaccard similarity contribute more to smoothing, while those with low overlap contribute less, reducing noisy influences. This filter refines nodes’ features and enhances the discriminative power of the filtered features by encoding fine-grained topological similarity. Finally, a proximity-level contrastive mechanism improves the topological structure of the graph and strengthens the discriminability of the learned graph by drawing similar nodes closer and pushing dissimilar ones apart. Extensive experiments demonstrate that our proposed shallow model achieves strong accuracy across multiple datasets–75.96% (Cora), 73.34% (Citeseer), 62.84% (Texas), 53% (Cornell), 68.69% (Pubmed), 62.57% (Wiki), and 64.14% (Wisconsin)–while outperforming 26 state-of-the-art graph clustering methods. • We propose a graph weighting method based on topology and neighborhood modeling. • We offer an adaptive weighted filter, merging a weighting factor with node intimacy. • We combine high-pass and low-pass filtering with weighted Jaccard similarity.

Authors

Institutions

Publication Details

Journal
Chaos Solitons & Fractals
Published
2025-10-09
DOI
https://doi.org/10.1016/j.chaos.2025.117374
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SCGC-JWAF: Shallow contrastive graph clustering with Jaccard-based weighted adaptive filtering

Nazila Pourhaji Aghayengejeh, Mohammad Ali Balafar, Farzaneh Ghorbani Dizaj Yekan
Chaos Solitons & Fractals
Recommender Systems and Techniques
article

SCGC-JWAF: Shallow contrastive graph clustering with Jaccard-based weighted adaptive filtering

Nazila Pourhaji Aghayengejeh, Mohammad Ali Balafar, Farzaneh Ghorbani Dizaj Yekan
article en

Abstract

Node clustering has gained significant attention due to its effectiveness in uncovering hidden structures in graph-structured data. However, real-world graphs often contain noise and are sparsely connected, which negatively impacts clustering accuracy. Moreover, unweighted graphs cannot reflect the varying strengths of connections between nodes, resulting in less discriminative representations and poor clustering outcomes. To address this, we propose SCGC-JWAF, a shallow contrastive node clustering model that introduces a weighted adaptive filter based on node intimacy-driven graph. First, we construct the weighted graph by combining graph’s structural data with jaccard similarity information. Then, we design a weighted adaptive filter with a new weight factor and the modified graph that incorporates high-pass and low-pass filters. By using a weighted Jaccard-based graph in the filtering process, nodes with higher Jaccard similarity contribute more to smoothing, while those with low overlap contribute less, reducing noisy influences. This filter refines nodes’ features and enhances the discriminative power of the filtered features by encoding fine-grained topological similarity. Finally, a proximity-level contrastive mechanism improves the topological structure of the graph and strengthens the discriminability of the learned graph by drawing similar nodes closer and pushing dissimilar ones apart. Extensive experiments demonstrate that our proposed shallow model achieves strong accuracy across multiple datasets–75.96% (Cora), 73.34% (Citeseer), 62.84% (Texas), 53% (Cornell), 68.69% (Pubmed), 62.57% (Wiki), and 64.14% (Wisconsin)–while outperforming 26 state-of-the-art graph clustering methods. • We propose a graph weighting method based on topology and neighborhood modeling. • We offer an adaptive weighted filter, merging a weighting factor with node intimacy. • We combine high-pass and low-pass filtering with weighted Jaccard similarity.

Chaos Solitons & FractalsVol. 201
University of Tabriz (IR)
Openalex Percentile: Top 59%
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

SCGC-JWAF: Shallow contrastive graph clustering with Jaccard-based weighted adaptive filtering — Nazila Pourhaji Aghayengejeh, Mohammad Ali Balafar, et al. · Chaos Solitons & Fractals (2025) | TGRS Research Map | TGRS