arrow
返回

Y-Graph: A Max-Ascent-Angle Graph for Detecting Clusters

delete2025-01-01
delete0
PRE
AI
J
Junyi Guan
S
Sheng Li *
X
Xiongxiong He
J
Jiajia Chen
Y
Yangyang Zhao
Y
Yuxuan Zhang
DOI:10.1109/TKDE.2024.3486221delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Graph clustering technique is highly effective in detecting complex-shaped clusters, in which graph building is a crucial step. Nevertheless, building a reasonable graph that can exhibit high connectivity within clusters and low connectivity across clusters is challenging. Herein, we design a max-ascent-angle graph called the Y-graph, a high-sparse graph that automatically allocates dense edges within clusters and sparse edges across clusters, regardless of their shapes or dimensionality. In the graph, every point x is allowed to connect its nearest higher-density neighbor delta, and another higher-density neighbor gamma, satisfying that the angle angle delta x gamma is the largest, called max-ascent-angle. By seeking the max-ascent-angle, points are automatically connected as the Y-graph, which is a reasonable graph that can effectively balance inter-cluster connectivity and intra-cluster non-connectivity. Besides, an edge weight function is designed to capture the similarity of the neighbor probability distribution, which effectively represents the density connectivity between points. By employing the Normalized-Cut (Ncut) technique, a Ncut-Y algorithm is proposed. Benefiting from the excellent performance of Y-graph, Ncut-Y can fast seek and cut the edges located in the low-density boundaries between clusters, thereby, capturing clusters effectively. Experimental results on both synthetic and real datasets demonstrate the effectiveness of Y-graph and Ncut-Y.
Keyword:
Clustering algorithms
Merging
Buildings
Shape
Couplings
Resource management
Costs
Tuning
Symmetric matrices
Standards
Complex-shaped clusters
normalized-cut
graph clustering

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.9K
被引数:
3.2W

机构

H
hangzhou normal university
学者数:
1.3W
论文数: 7.8K
被引数: 8
Z
zhejiang university of technology
学者数:
3.3W
论文数: 2.0W
被引数: 22
引用论文

引用论文

err分享
err收藏
DCSNE: Density-based Clustering using Graph Shared Neighbors and Entropy
err2023-05-01
err23
PREAI
errMaheshwari, Rashmi; Mohanty, Sraban Kumar; Mishra, Amaresh Chandra
err分享
err收藏
Capacidade de suporte de carga de Latossolo Vermelho cultivado com cana-de-açúcar e efeitos da mecanização no solo
err2015-04-01
err0
errOAAI
errOswaldo Julio Vischi Filho; Zigomar Menezes de Souza; Reginaldo Barbosa da Silva; Camila Cassante de Lima; Danilo de Moraes Gomes Pereira; Márcio Emanuel de Lima; Allan Charlles Mendes de Sousa; Gustavo Soares de Souza
err分享
err收藏
err分享
err收藏
Inflammaging and Anti-Inflammaging: The Role of Cytokines in Extreme Longevity
err2015-12-12
err0
PREAI
errPaola Lucia Minciullo; Antonino Catalano; Giuseppe Mandraffino; Marco Casciaro; Andrea Crucitti; Giuseppe Maltese; Nunziata Morabito; Antonino Lasco; Sebastiano Gangemi; Giorgio Basile
err分享
err收藏
TSF-DBSCAN: A Novel Fuzzy Density-Based Approach for Clustering Unbounded Data Streams
err2022-03-01
err22
PREAI
errBechini, Alessio; Marcelloni, Francesco; Renda, Alessandro
err分享
err收藏
学者 查看更多内容