Illumination Planning for Object Recognition Using Parametric Eigenspaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Organizing Large Structural Modelbases
IEEE Transactions on Pattern Analysis and Machine Intelligence
Genetic operators for hierarchical graph clustering
Pattern Recognition Letters
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph matching using spectral seriation and string edit distance
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Graph clustering using the weighted minimum common supergraph
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Graph-based tools for data mining and machine learning
MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
Effecting parallel graph eigensolvers through library composition
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Network ensemble clustering using latent roles
Advances in Data Analysis and Classification
Computer Science Review
Unsupervised clustering of human pose using spectral embedding
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
| Hi-index | 0.00 |
This paper investigates whether vectors of graph-spectral features can be used for the purposes of graph-clustering. We commence from the eigenvalues and eigenvectors of the adjacency matrix. Each of the leading eigenmodes represents a cluster of nodes and is mapped to a component of a feature vector. The spectral features used as components of the vectors are the eigenvalues, the cluster volume, the cluster perimeter, the cluster Cheeger constant, the inter-cluster edge distance, and the shared perimeter length. We explore whether these vectors can be used for the purposes of graph-clustering. Here we investigate the use of both central and pairwise clustering methods. On a data-base of view-graphs, the vectors of eigenvalues and shared perimeter lengths provide the best clusters.