Partitional vs hierarchical clustering using a minimum grammar complexity approach

DOI10.1007/3-540-44522-6_20MaRDI QIDQ4536489zbMATH OpenFDO

Authors Ana Fred, José M. N. Leitão

Publication date 25 June 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44522-6_20

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• Hierarchical clustering based on ordinal consistency
• An application of array grammars to clustering analysis for syntactic patterns
• The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm
• scientific article; zbMATH DE number 5343761
• scientific article; zbMATH DE number 907944

Cited in

(1)

• An application of array grammars to clustering analysis for syntactic patterns

This page was built for publication: Partitional vs hierarchical clustering using a minimum grammar complexity approach

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