Central clustering of attributed graphs

DOI10.1023/B:MACH.0000033119.52532.CEMaRDI QIDQ703083zbMATH OpenOpenAlexFDO

Authors Brijnesh J. Jain, Fritz Wysotzki

Publication date 19 January 2005

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:mach.0000033119.52532.ce

zbMATH Keywords

graph matchingHopfield networksK-means clusteringAttributed graphsweighted maximum cliquewinner-takes-all networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Weighted clustering of attributed multi-graphs
• scientific article; zbMATH DE number 2043372
• Structural, Syntactic, and Statistical Pattern Recognition
• Spectral embedding network for attributed graph clustering
• Extending bootstrap AMG for clustering of attributed graphs

Cited in

(15)

• Graph embedding using tree edit-union
• Weighted clustering of attributed multi-graphs
• A spectral approach to learning structural variations in graphs
• Graph clustering with graph capsule network
• On the geometry of graph spaces
• Spectral embedding network for attributed graph clustering
• A model of analogue K-winners-take-all neural circuit
• Structural, Syntactic, and Statistical Pattern Recognition
• Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
• Statistical graph space analysis
• Attributed graph clustering with subspace stochastic block model
• Neural predictor-based automated graph classifier framework
• Extending bootstrap AMG for clustering of attributed graphs
• The graph matching problem
• K-plex cover pooling for graph neural networks

This page was built for publication: Central clustering of attributed graphs

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