Applications of a new subspace clustering algorithm (COSA) in medical systems biology

Metabolomics ◽  
2007 ◽  
Vol 3 (1) ◽  
pp. 69-77 ◽  
Author(s):  
Doris Damian ◽  
Matej Orešič ◽  
Elwin Verheij ◽  
Jacqueline Meulman ◽  
Jerome Friedman ◽  
...  
2021 ◽  
Vol 11 (13) ◽  
pp. 5999
Author(s):  
Diego A. Camacho-Hernández ◽  
Victor E. Nieto-Caballero ◽  
José E. León-Burguete ◽  
Julio A. Freyre-González

Identifying groups that share common features among datasets through clustering analysis is a typical problem in many fields of science, particularly in post-omics and systems biology research. In respect of this, quantifying how a measure can cluster or organize intrinsic groups is important since currently there is no statistical evaluation of how ordered is, or how much noise is embedded in the resulting clustered vector. Much of the literature focuses on how well the clustering algorithm orders the data, with several measures regarding external and internal statistical validation; but no score has been developed to quantify statistically the noise in an arranged vector posterior to a clustering algorithm, i.e., how much of the clustering is due to randomness. Here, we present a quantitative methodology, based on autocorrelation, in order to assess this problem.


2018 ◽  
Author(s):  
María Elena Álvarez-Buylla Roces ◽  
Juan Carlos Martínez-García ◽  
José Dávila-Velderrain ◽  
Elisa Domínguez-Hüttinger ◽  
Mariana Esther Martínez-Sánchez

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 54741-54750 ◽  
Author(s):  
Xiaoge Deng ◽  
Tao Sun ◽  
Peibing Du ◽  
Dongsheng Li

Author(s):  
Billy Peralta ◽  
◽  
Luis Alberto Caro

Generic object recognition algorithms usually require complex classificationmodels because of intrinsic difficulties arising from problems such as changes in pose, lighting conditions, or partial occlusions. Decision trees present an inexpensive alternative for classification tasks and offer the advantage of being simple to understand. On the other hand, a common scheme for object recognition is given by the appearances of visual words, also known as the bag-of-words method. Although multiple co-occurrences of visual words are more informative regarding visual classes, a comprehensive evaluation of such combinations is unfeasible because it would result in a combinatorial explosion. In this paper, we propose to obtain the multiple co-occurrences of visual words using a variant of the CLIQUE subspace-clustering algorithm for improving the object recognition performance of simple decision trees. Experiments on standard object datasets show that our method improves the accuracy of the classification of generic objects in comparison to traditional decision tree techniques that are similar, in terms of accuracy, to ensemble techniques. In future we plan to evaluate other variants of decision trees, and apply other subspace-clustering algorithms.


Sign in / Sign up

Export Citation Format

Share Document