Central clustering of attributed graphs

DOI10.1023/B:MACH.0000033119.52532.cezbMath1089.68078OpenAlexW2026859125MaRDI QIDQ703083

Fritz Wysotzki, Brijnesh J. Jain

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)

Related Items (7)

On the geometry of graph spaces ⋮ Graph embedding using tree edit-union ⋮ Statistical graph space analysis ⋮ Neural predictor-based automated graph classifier framework ⋮ The graph matching problem ⋮ A spectral approach to learning structural variations in graphs ⋮ A model of analogue \(K\)-winners-take-all neural circuit

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