Spectral feature vectors for graph clustering

DOI10.1007/3-540-70659-3_8MaRDI QIDQ4808930zbMATH OpenFDO

Authors Bin Luo, Richard C. Wilson, Edwin R. Hancock, Richard C. Wilson

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2396/23960083.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Spectral clustering of graphs
• Spectral embedding of graphs.
• Clustering based on eigenvectors of the adjacency matrix
• Spectral methods for graph clustering - a survey
• Spectral graph features for the classification of graphs and graph sequences

Cited in

(6)

• Spectral graph features for the classification of graphs and graph sequences
• Spectral clustering of graphs
• Graph clustering
• scientific article; zbMATH DE number 7626732 (Why is no real title available?)
• A spectral approach to clustering numerical vectors as nodes in a network
• Matching graphs with unique node labels

This page was built for publication: Spectral feature vectors for graph clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808930)