Efficient Clustering for Orders

DOI10.1007/978-3-540-88067-7_15zbMath1171.68697OpenAlexW2395728135MaRDI QIDQ3627918

Shotaro Akaho, Toshihiro Kamishima

Publication date: 13 May 2009

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88067-7_15

zbMATH Keywords

hierarchical clustering methods

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (6)

Non-parametric clustering over user features and latent behavioral functions with dual-view mixture models ⋮ An agglomerative hierarchical clustering algorithm for linear ordinal rankings ⋮ A scalable preference model for autonomous decision-making ⋮ Supervised clustering of label ranking data using label preference information ⋮ Signal processing on the permutahedron: tight spectral frames for ranked data analysis ⋮ Antithetic and Monte Carlo kernel estimators for partial rankings

Cites Work

• Parallel algorithms for hierarchical clustering
• Learning from cluster examples
• NON-NULL RANKING MODELS. I
• Machine Learning: ECML 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Clustering for Orders