Clustering Binary Data by Application of Combinatorial Optimization Heuristics
We study clustering methods for binary data, first defining aggregation criteria that measure the compactness of clusters. Five new and original methods are introduced, using neighborhoods and population behavior combinatorial optimization metaheuristics: first ones are simulated annealing, threshold accepting and tabu search, and the others are a genetic algorithm and ant colony optimization. The methods are implemented, performing the proper calibration of parameters in the case of heuristics, to ensure good results. From a set of 16 data tables generated by a quasi-Monte Carlo experiment, a comparison is performed for one of the aggregations using L1 dissimilarity, with hierarchical clustering, and a version of k-means: partitioning around medoids or PAM. Simulated annealing perform very well, especially compared to classical methods.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringCombinatorial OptimizationSimilar Papers 제목 키워드 기반
Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem
In this paper, we study the problem of fair sparse regression on a biased dataset where bias depends upon a hidden binary attribute. The presence of a hidden attribute adds an extra layer of complexity to the problem by …
AttributeClusteringFairnessregressionQuantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering
This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, a…
Feature ImportanceBenchmarking Randomized Optimization Algorithms on Binary, Permutation, and Combinatorial Problem Landscapes
In this paper, we evaluate the performance of four randomized optimization algorithms: Randomized Hill Climbing (RHC), Simulated Annealing (SA), Genetic Algorithms (GA), and MIMIC (Mutual Information Maximizing Input Clu…
BenchmarkingIsing-based Consensus Clustering on Specialized Hardware
The emergence of specialized optimization hardware such as CMOS annealers and adiabatic quantum computers carries the promise of solving hard combinatorial optimization problems more efficiently in hardware. Recent work …
ClusteringCombinatorial OptimizationProfile Likelihood Biclustering
Biclustering, the process of simultaneously clustering the rows and columns of a data matrix, is a popular and effective tool for finding structure in a high-dimensional dataset. Many biclustering procedures appear to wo…
Clustering