Incremental clustering of attributed graphs
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 23 (5) , 1399-1411
- https://doi.org/10.1109/21.260671
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Introduction:Paradigms for machine learningArtificial Intelligence, 1989
- Models of incremental concept formationArtificial Intelligence, 1989
- Recognition and shape synthesis of 3-D objects based on attributed hypergraphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- An eigendecomposition approach to weighted graph matching problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Knowledge acquisition via incremental conceptual clusteringMachine Learning, 1987
- Experiments with incremental concept formation: UNIMEMMachine Learning, 1987
- Entropy and Distance of Random Graphs with Application to Structural Pattern RecognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A distance measure between attributed relational graphs for pattern recognitionIEEE Transactions on Systems, Man, and Cybernetics, 1983
- Pattern recognition as a quest for minimum entropyPattern Recognition, 1981
- Random Graphs: Structural-Contextual DichotomyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980