Clustering reduced interval data using Hausdorff distance

DOI10.1007/S00180-006-0263-XMaRDI QIDQ880910zbMATH OpenOpenAlexFDO

Authors Antonio Irpino, Valentino Tontodonato

Publication date 29 May 2007

Published in Computational Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00180-006-0263-x

zbMATH Keywords

convex hullprincipal components analysissymbolic data

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Review text

The authors consider problems of clustering and principal components analysis (PCA), as a pre-processing before clustering for multivariate interval data. Different interval PCA schemes are discussed with special attention to those using convex hulls (CH) of projected intervals. A hierarchical agglomerative clustering for CH's based on the Hausdorff distance is described. Clustering of the Breiman waves dataset is considered as an example.

Recommendations

• Dynamical clustering of interval data: Optimization of an adequacy criterion based on Hausdorff distance
• A Clustering Algorithm for Symbolic Interval Data Based on a Single Adaptive Hausdorff Distance
• A new clustering method for interval data
• New clustering methods for interval data
• Clustering to minimize the maximum intercluster distance
• Dynamic clustering for interval data based on L₂ distance
• A hierarchical clustering method for random intervals based on a similarity measure
• Clustering for metric and nonmetric distance measures

Cites work

• A linear time algorithm for the Hausdorff distance between convex polygons
• An Algorithm for Convex Polytopes
• Analysis of symbolic data. Exploratory methods for extracting statistical information from complex data
• Applied interval analysis. With examples in parameter and state estimation, robust control and robotics. Incl. 1 CD-ROM
• Criterion-based divisive clustering for symbolic data
• Factorial methods with cohesion constraints on symbolic objects
• Hierarchical and pyramidal clustering for symbolic data
• Hierarchical clustering schemes
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 5280179 (Why is no real title available?)
• scientific article; zbMATH DE number 1049272 (Why is no real title available?)
• scientific article; zbMATH DE number 1063647 (Why is no real title available?)
• Interval arithmetic: from principles to implementation
• Principal component analysis of interval data: a symbolic data analysis approach
• Principal component analysis of symmetric fuzzy data

Cited in

(7)

• Clustering and classification of fuzzy data using the fuzzy EM algorithm
• Interval-based distance function for identifying RNA structure candidates
• The use of linked line segments for cluster representation and data reduction
• Dynamical clustering of interval data: Optimization of an adequacy criterion based on Hausdorff distance
• scientific article; zbMATH DE number 804124 (Why is no real title available?)
• Dissimilarity measures for histogram-valued observations
• New clustering methods for interval data

This page was built for publication: Clustering reduced interval data using Hausdorff distance

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