Abstract: This paper presents a concise tutorial on spectral clustering for broad spectrum graphs which include unipartite (undirected) graph, bipartite graph, and directed graph. We show how to ...

1 Department of Computer Science and Engineering, Jahangirnagar University, Dhaka, Bangladesh. 2 Brandenburg University of Technology Cottbus-Senftenberg, Cottbus, Germany. A social network refers to ...

Not uncommonly, the emergence of the quantum phenomenon accompanies dominant states that are not spatially homogeneous 1. This situation is generally originated from the cooperative interplay among ...

DBSCAN is a famous density-based clustering algorithm that can discover clusters with arbitrary shapes without the minimal requirements of domain knowledge to determine the input parameters. However, ...

A hierarchical scheme for clustering data is presented which applies to spaces with a high number of dimensions (). The data set is first reduced to a smaller set of partitions (multi-dimensional bins ...

Graph theory is a useful tool for deciphering structural and functional networks of the brain on various spatial and temporal scales. The clustering coefficient quantifies the abundance of connected ...

The past decade has been marked with a proliferation of community detection algorithms that aim to organize nodes (e.g., individuals, brain regions, variables) into modular structures that indicate ...