The use of linked line segments for cluster representation and data reduction

DOI10.1016/S0167-8655(98)00125-1MaRDI QIDQ4244135zbMATH OpenOpenAlexFDO

Authors E. W. Tyree, J. A. Long

Publication date 24 May 1999

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8655(98)00125-1

zbMATH Keywords

cluster structuresdata reductiondensity linkage

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Clustering in random line graphs
• A sweep-line algorithm for spatial clustering
• Clustering lines in high-dimensional space, classification of incomplete data
• Fast line segment grouping method for finding globally more favorable line segments
• Clustering reduced interval data using Hausdorff distance

Cited in

(1)

• A multi-prototype clustering algorithm

This page was built for publication: The use of linked line segments for cluster representation and data reduction

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