[PDF][PDF] Benchmarking for graph clustering and partitioning

P Sanders, C Schulz, D Wagner - Encyclopedia of social network …, 2014 - researchgate.net
2 the assembled benchmark suite, the challenges create a reproducible picture of the state
of the art in the area under consideration. This helps to foster an effective technology transfer …

Discovering and Maintaining the Best in Core Decomposition

D Chu, F Zhang, W Zhang, X Lin… - … on Knowledge and …, 2024 - ieeexplore.ieee.org
The mode of-core and its hierarchical decomposition have been applied in many areas,
such as sociology, the world wide web, and biology. Algorithms on related studies often …

Less is more: basic variable neighborhood search heuristic for balanced minimum sum-of-squares clustering

LR Costa, D Aloise, N Mladenović - Information Sciences, 2017 - Elsevier
Clustering addresses the problem of finding homogeneous and well-separated subsets,
called clusters, from a set of given data points. In addition to the points themselves, in many …

KO: Modularity optimization in community detection

F Öztemiz, A Karcı - Neural Computing and Applications, 2023 - Springer
Many algorithms have been developed to detect communities in networks. The success of
these developed algorithms varies according to the types of networks. A community …

Distance geometry and data science

L Liberti - Top, 2020 - Springer
Data are often represented as graphs. Many common tasks in data science are based on
distances between entities. While some data science methodologies natively take graphs as …

An adaptive time series segmentation algorithm based on visibility graph and particle swarm optimization

Z He, S Zhang, J Hu, F Dai - Physica A: Statistical Mechanics and its …, 2024 - Elsevier
Time series segmentation is a crucial area of research in time series analysis as it can
reveal meaningful patterns or segments hidden within time series data. In this paper, we …

Finding the best k in core decomposition: A time and space optimal solution

D Chu, F Zhang, X Lin, W Zhang… - 2020 IEEE 36th …, 2020 - ieeexplore.ieee.org
The mode of k-core and its hierarchical decomposition have been applied in many areas,
such as sociology, the world wide web, and biology. Algorithms on related studies often …

Graph neural network inspired algorithm for unsupervised network community detection

S Sobolevsky, A Belyi - Applied Network Science, 2022 - Springer
Network community detection often relies on optimizing partition quality functions, like
modularity. This optimization appears to be a complex problem traditionally relying on …

Detection of composite communities in multiplex biological networks

L Bennett, A Kittas, G Muirhead, LG Papageorgiou… - Scientific reports, 2015 - nature.com
The detection of community structure is a widely accepted means of investigating the
principles governing biological systems. Recent efforts are exploring ways in which multiple …

A density-based statistical analysis of graph clustering algorithm performance

P Miasnikof, AY Shestopaloff, AJ Bonner… - Journal of Complex …, 2020 - academic.oup.com
We introduce graph clustering quality measures based on comparisons of global, intra-and
inter-cluster densities, an accompanying statistical significance test and a step-by-step …