Biclustering Algorithms Based on Metaheuristics: A Review
- URL: http://arxiv.org/abs/2203.16241v1
- Date: Wed, 30 Mar 2022 12:16:32 GMT
- Title: Biclustering Algorithms Based on Metaheuristics: A Review
- Authors: Adan Jose-Garcia, Julie Jacques, Vincent Sobanski, Clarisse Dhaenens
- Abstract summary: Biclustering is an unsupervised machine learning technique that simultaneously clusters rows and columns in a data matrix.
Finding significant biclusters is an NP-hard problem that can be formulated as an optimization problem.
Different metaheuristics have been applied to biclustering problems because of their exploratory capability of solving complex optimization problems in reasonable time.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Biclustering is an unsupervised machine learning technique that
simultaneously clusters rows and columns in a data matrix. Biclustering has
emerged as an important approach and plays an essential role in various
applications such as bioinformatics, text mining, and pattern recognition.
However, finding significant biclusters is an NP-hard problem that can be
formulated as an optimization problem. Therefore, different metaheuristics have
been applied to biclustering problems because of their exploratory capability
of solving complex optimization problems in reasonable computation time.
Although various surveys on biclustering have been proposed, there is a lack of
a comprehensive survey on the biclustering problem using metaheuristics. This
chapter will present a survey of metaheuristics approaches to address the
biclustering problem. The review focuses on the underlying optimization methods
and their main search components: representation, objective function, and
variation operators. A specific discussion on single versus multi-objective
approaches is presented. Finally, some emerging research directions are
presented.
Related papers
- HBIC: A Biclustering Algorithm for Heterogeneous Datasets [0.0]
Biclustering is an unsupervised machine-learning approach aiming to cluster rows and columns simultaneously in a data matrix.
We introduce a biclustering approach called HBIC, capable of discovering meaningful biclusters in complex heterogeneous data.
arXiv Detail & Related papers (2024-08-23T16:48:10Z) - CDIMC-net: Cognitive Deep Incomplete Multi-view Clustering Network [53.72046586512026]
We propose a novel incomplete multi-view clustering network, called Cognitive Deep Incomplete Multi-view Clustering Network (CDIMC-net)
It captures the high-level features and local structure of each view by incorporating the view-specific deep encoders and graph embedding strategy into a framework.
Based on the human cognition, i.e., learning from easy to hard, it introduces a self-paced strategy to select the most confident samples for model training.
arXiv Detail & Related papers (2024-03-28T15:45:03Z) - One-step Multi-view Clustering with Diverse Representation [47.41455937479201]
We propose a one-step multi-view clustering with diverse representation method, which incorporates multi-view learning and $k$-means into a unified framework.
We develop an efficient optimization algorithm with proven convergence to solve the resultant problem.
arXiv Detail & Related papers (2023-06-08T02:52:24Z) - Unified Multi-View Orthonormal Non-Negative Graph Based Clustering
Framework [74.25493157757943]
We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework.
We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
arXiv Detail & Related papers (2022-11-03T08:18:27Z) - Differentially-Private Clustering of Easy Instances [67.04951703461657]
In differentially private clustering, the goal is to identify $k$ cluster centers without disclosing information on individual data points.
We provide implementable differentially private clustering algorithms that provide utility when the data is "easy"
We propose a framework that allows us to apply non-private clustering algorithms to the easy instances and privately combine the results.
arXiv Detail & Related papers (2021-12-29T08:13:56Z) - Fast and Interpretable Consensus Clustering via Minipatch Learning [0.0]
We develop IMPACC: Interpretable MiniPatch Adaptive Consensus Clustering.
We develop adaptive sampling schemes for observations, which result in both improved reliability and computational savings.
Results show that our approach yields more accurate and interpretable cluster solutions.
arXiv Detail & Related papers (2021-10-05T22:39:28Z) - Conjugate Mixture Models for Clustering Multimodal Data [24.640116037967985]
The problem of multimodal clustering arises whenever the data are gathered with several physically different sensors.
We show that multimodal clustering can be addressed within a novel framework, namely conjugate mixture models.
arXiv Detail & Related papers (2020-12-09T10:13:22Z) - Multi-View Spectral Clustering with High-Order Optimal Neighborhood
Laplacian Matrix [57.11971786407279]
Multi-view spectral clustering can effectively reveal the intrinsic cluster structure among data.
This paper proposes a multi-view spectral clustering algorithm that learns a high-order optimal neighborhood Laplacian matrix.
Our proposed algorithm generates the optimal Laplacian matrix by searching the neighborhood of the linear combination of both the first-order and high-order base.
arXiv Detail & Related papers (2020-08-31T12:28:40Z) - Unsupervised Multi-view Clustering by Squeezing Hybrid Knowledge from
Cross View and Each View [68.88732535086338]
This paper proposes a new multi-view clustering method, low-rank subspace multi-view clustering based on adaptive graph regularization.
Experimental results for five widely used multi-view benchmarks show that our proposed algorithm surpasses other state-of-the-art methods by a clear margin.
arXiv Detail & Related papers (2020-08-23T08:25:06Z) - Bi-objective Optimization of Biclustering with Binary Data [0.0]
Clustering consists of partitioning data objects into subsets called clusters according to some similarity criteria.
This paper addresses a quasi-clustering that allows overlapping of clusters, and which we link to biclustering.
Biclustering simultaneously groups the objects and features so that a specific group of objects has a special group of features.
arXiv Detail & Related papers (2020-02-09T21:49:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.