Some experiments on clustering a set of strings

DOI10.1007/3-540-45028-9_19MaRDI QIDQ4450806zbMATH OpenFDO

Authors Jean-Michel Jolion

Publication date 16 February 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2726/27260214.htm

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Recommendations

• Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings
• New approach to searching for string median and visualization of string clusters
• Clustering words and interval exchanges

Cited in

(3)

• A mean string algorithm to compute the average among a set of 2D shapes
• scientific article; zbMATH DE number 4057049 (Why is no real title available?)
• Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain

This page was built for publication: Some experiments on clustering a set of strings

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