A flexible cluster-oriented alternative clustering algorithm for choosing from the Pareto front of solutions

DOI10.1007/S10994-013-5350-YMaRDI QIDQ2260920zbMATH OpenOpenAlexFDO

Authors Duy Tin Truong, Roberto Battiti

Publication date 12 March 2015

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-013-5350-y

zbMATH Keywords

alternative clusteringcluster-oriented recombinationgenetic algorithmsmulti-objective optimization

Mathematics Subject Classification ID

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

Recommendations

• Multi-objective selection for collecting cluster alternatives
• How to ``alternatize a clustering algorithm
• Generating multiple alternative clusterings via globally optimal subspaces
• Subjectively interesting alternative clusterings
• A framework to uncover multiple alternative clusterings

Cites work

• Algorithms for the Assignment and Transportation Problems
• Least squares quantization in PCM
• Multiobjective optimization. Interactive and evolutionary approaches
• Optimization by simulated annealing
• Reactive search and intelligent optimization

Cited in

(5)

• Learning a metric when clustering data points in the presence of constraints
• Subjectively interesting alternative clusterings
• How to ``alternatize a clustering algorithm
• Multi-objective selection for collecting cluster alternatives
• Generating multiple alternative clusterings via globally optimal subspaces

Describes a project that uses

Uses Software

• UCI
• MOCK

This page was built for publication: A flexible cluster-oriented alternative clustering algorithm for choosing from the Pareto front of solutions

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