Edge perturbation on signed graphs with clusters: Adjacency and Laplacian eigenvalues.
Francesco BelardoMaurizio BrunettiAdriana CiampellaPublished in: Discret. Appl. Math. (2019)
Keyphrases
- laplacian matrix
- graph clustering
- weighted graph
- edge detection
- undirected graph
- strongly connected
- adjacency matrix
- clustering algorithm
- densely connected
- graph laplacian
- spectral decomposition
- spectral methods
- edge weights
- cluster analysis
- hierarchical clustering
- covariance matrix
- proximity graph
- heat kernel
- minimum spanning trees
- graph theoretic
- vertex set
- zero crossing
- graph partitioning
- spectral clustering
- fuzzy clustering
- data points
- edge information
- data clustering
- data objects
- graph kernels
- random graphs
- graph theory
- graph structure
- graph mining
- image processing
- eigenvalues and eigenvectors
- principal component analysis
- low dimensional
- hierarchical structure
- directed graph
- subspace clustering
- affinity propagation clustering
- graph classification
- edge detector
- graph matching
- graph structures
- bipartite graph
- spectral analysis
- similarity matrix
- graph representation