K‐Plus anticlustering: An improved k‐means criterion for maximizing between‐group similarity

DOI10.1111/bmsp.12315MaRDI QIDQ6127072

Unnamed Author

Publication date: 10 April 2024

Published in: British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)

zbMATH Keywords

variancekurtosisskewness\(k\)-meansstimulus selectionanticlustering\(k\)-plus

Mathematics Subject Classification ID

Applications of statistics to psychology (62P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weighted sum method for multi-objective optimization: new insights
• NP-hardness of Euclidean sum-of-squares clustering
• Direct multicriteria clustering algorithms
• Cluster graph modification problems
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• An empirical comparison of heuristic methods for creating maximally diverse groups
• Unresolved Problems in Cluster Analysis
• Data Mining and Knowledge Discovery Handbook
• Combining diversity and dispersion criteria for anticlustering: A bicriterion approach

This page was built for publication: K‐Plus anticlustering: An improved k‐means criterion for maximizing between‐group similarity