Self-organizing map for clustering in the graph domain
From MaRDI portal
Publication:4538835
DOI10.1016/S0167-8655(01)00173-8zbMath1006.68111MaRDI QIDQ4538835
Publication date: 3 July 2002
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Related Items (9)
Protein classification by matching and clustering surface graphs ⋮ On the geometry of graph spaces ⋮ A long trip in the charming world of graphs for pattern recognition ⋮ Statistical graph space analysis ⋮ Adaptive topological tree structure for document organisation and visualisation ⋮ Object and image indexing based on region connection calculus and oriented matroid theory ⋮ Edit distance-based kernel functions for structural pattern classification ⋮ Batch and median neural gas ⋮ Self-organizing maps by difference of convex functions optimization
This page was built for publication: Self-organizing map for clustering in the graph domain