Clustering algorithms for chains

zbMATH Open1280.68209MaRDI QIDQ5396644FDOQ5396644

Authors Antti Ukkonen

Publication date 3 February 2014

Full work available at URL http://www.jmlr.org/papers/v12/ukkonen11a.html

zbMATH Keywords

ordersplanted partition modelLloyd's algorithmrandomization testingpreference statements

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial probability (60C05)

Recommendations

• Efficient Clustering for Orders
• Chain development
• Clustering of Data Represented by Pairwise Comparisons
• scientific article; zbMATH DE number 1163863
• scientific article; zbMATH DE number 912680

Cited in

(5)

• Using extension sets to aggregate partial rankings in a flexible setting
• Chain development
• Approaching the rank aggregation problem by local search-based metaheuristics
• Sibrank: signed bipartite network analysis for neighbor-based collaborative ranking
• Efficient Clustering for Orders

This page was built for publication: Clustering algorithms for chains

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