Experimental Analysis and Evaluation of Cohesive Subgraph Discovery
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916844502253568 |
|---|---|
| author | Kim, Dahee Kim, Song Kim, Jeongseon Kim, Junghoon Feng, Kaiyu Lim, Sungsu Kim, Jungeun |
| author_facet | Kim, Dahee Kim, Song Kim, Jeongseon Kim, Junghoon Feng, Kaiyu Lim, Sungsu Kim, Jungeun |
| contents | Retrieving cohesive subgraphs in networks is a fundamental problem in social network analysis and graph data management. These subgraphs can be used for marketing strategies or recommendation systems. Despite the introduction of numerous models over the years, a systematic comparison of their performance, especially across varied network configurations, remains unexplored. In this study, we evaluated various cohesive subgraph models using task-based evaluations and conducted extensive experimental studies on both synthetic and real-world networks. Thus, we unveil the characteristics of cohesive subgraph models, highlighting their efficiency and applicability. Our findings not only provide a detailed evaluation of current models but also lay the groundwork for future research by shedding light on the balance between the interpretability and cohesion of the subgraphs. This research guides the selection of suitable models for specific analytical needs and applications, providing valuable insights. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_10262 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Experimental Analysis and Evaluation of Cohesive Subgraph Discovery Kim, Dahee Kim, Song Kim, Jeongseon Kim, Junghoon Feng, Kaiyu Lim, Sungsu Kim, Jungeun Social and Information Networks Retrieving cohesive subgraphs in networks is a fundamental problem in social network analysis and graph data management. These subgraphs can be used for marketing strategies or recommendation systems. Despite the introduction of numerous models over the years, a systematic comparison of their performance, especially across varied network configurations, remains unexplored. In this study, we evaluated various cohesive subgraph models using task-based evaluations and conducted extensive experimental studies on both synthetic and real-world networks. Thus, we unveil the characteristics of cohesive subgraph models, highlighting their efficiency and applicability. Our findings not only provide a detailed evaluation of current models but also lay the groundwork for future research by shedding light on the balance between the interpretability and cohesion of the subgraphs. This research guides the selection of suitable models for specific analytical needs and applications, providing valuable insights. |
| title | Experimental Analysis and Evaluation of Cohesive Subgraph Discovery |
| topic | Social and Information Networks |
| url | https://arxiv.org/abs/2507.10262 |