BiWeighted Regular Grid Graphs - A New Class of Graphs for Which Graph Spectral Clustering is Applicable in Analytical Form.
Mieczyslaw A. KlopotekSlawomir T. WierzchonBartlomiej StarostaDariusz CzerskiPiotr BorkowskiPublished in: ICCS (2) (2024)
Keyphrases
- spectral clustering
- graph construction
- graph clustering
- graph partitioning
- laplacian matrix
- regular grid
- spectral methods
- graph representation
- adjacency matrix
- graph matching
- weighted graph
- normalized cut
- graph structure
- directed graph
- similarity graph
- graph laplacian
- bipartite graph
- graph mining
- graph model
- random walk
- graph structures
- image segmentation
- graph kernels
- graph data
- data clustering
- similarity matrix
- clustering algorithm
- label propagation
- undirected graph
- clustering method
- neighborhood graph
- cluster analysis
- class labels
- pairwise similarities
- nearest neighbor
- spanning tree
- eigendecomposition
- kernel function
- super resolution
- high dimensional
- data sets