Object-Attribute Biclustering for Elimination of Missing Genotypes in Ischemic Stroke Genome-Wide Data
Missing genotypes can affect the efficacy of machine learning approaches to identify the risk genetic variants of common diseases and traits. The problem occurs when genotypic data are collected from different experiments with different DNA microarrays, each being characterised by its pattern of uncalled (missing) genotypes. This can prevent the machine learning classifier from assigning the classes correctly. To tackle this issue, we used well-developed notions of object-attribute biclusters and formal concepts that correspond to dense subrelations in the binary relation $\textit{patients} \times \textit{SNPs}$. The paper contains experimental results on applying a biclustering algorithm to a large real-world dataset collected for studying the genetic bases of ischemic stroke. The algorithm could identify large dense biclusters in the genotypic matrix for further processing, which in return significantly improved the quality of machine learning classifiers. The proposed algorithm was also able to generate biclusters for the whole dataset without size constraints in comparison to the In-Close4 algorithm for generation of formal concepts.
Code (1)
Tasks
AttributeBIG-bench Machine LearningSimilar Papers 제목 키워드 기반
Towards a Unified Taxonomy of Biclustering Methods
Being an unsupervised machine learning and data mining technique, biclustering and its multimodal extensions are becoming popular tools for analysing object-attribute data in different domains. Apart from conventional cl…
AttributeClusteringSurveyNew advances in enumerative biclustering algorithms with online partitioning
This paper further extends RIn-Close_CVC, a biclustering algorithm capable of performing an efficient, complete, correct and non-redundant enumeration of maximal biclusters with constant values on columns in numerical da…
AttributeDescriptiveMissing ValuesBi-objective Optimization of Biclustering with Binary Data
Clustering consists of partitioning data objects into subsets called clusters according to some similarity criteria. This paper addresses a generalization called quasi-clustering that allows overlapping of clusters, and …
ClusteringBiclustering Algorithms Based on Metaheuristics: A Review
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 applicat…
SurveyMOCICE-BCubed F$_1$: A New Evaluation Measure for Biclustering Algorithms
The validation of biclustering algorithms remains a challenging task, even though a number of measures have been proposed for evaluating the quality of these algorithms. Although no criterion is universally accepted as t…