PreCLAS: An Evolutionary Tool for Unsupervised Feature Selection

被引:1
|
作者
Carballido, Jessica A. [1 ]
Ponzoni, Ignacio [1 ]
Cecchini, Rocio L. [1 ]
机构
[1] Univ Nacl Sur, Dept Comp Sci & Engn, Inst Comp Sci & Engn UNS, CONICET, Bahia Blanca, Buenos Aires, Argentina
关键词
Clustering tendency; Classification strategies; Evolutionary algorithm; Unsupervised feature selection; Microarray data analysis; INSTANCE SELECTION; REDUCTION;
D O I
10.1007/978-3-030-61705-9_15
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Several research areas are being faced with data matrices that are not suitable to be managed with traditional clustering, regression, or classification strategies. For example, biological so-called omic problems present models with thousands or millions of rows and less than a hundred columns. This matrix structure hinders the successful progress of traditional data analysis methods and thus needs some means for reducing the number of rows. This article presents an unsupervised approach called PreCLAS for preprocessing matrices with dimension problems to obtain data that are apt for clustering and classification strategies. The PreCLAS was implemented as an unsupervised strategy that aims at finding a submatrix with a drastically reduced number of rows, preferring those rows that together present some group structure. Experimentation was carried out in two stages. First, to assess its functionality, a benchmark dataset was studied in a clustering context. Then, a microarray dataset with genomic information was analyzed, and the PreCLAS was used to select informative genes in the context of classification strategies. Experimentation showed that the new method performs successfully at drastically reducing the number of rows of a matrix, smartly performing unsupervised feature selection for both classification and clustering problems.
引用
收藏
页码:172 / 182
页数:11
相关论文
共 50 条
  • [21] Group Based Unsupervised Feature Selection
    Perera, Kushani
    Chan, Jeffrey
    Karunasekera, Shanika
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2020, PT I, 2020, 12084 : 805 - 817
  • [22] Unsupervised feature selection with ensemble learning
    University of Lyon, Lyon
    69622, France
    不详
    Mach Learn, 1-2 (157-180):
  • [23] Utility metric for unsupervised feature selection
    Villa, Amalia
    Narayanan, Abhijith Mundanad
    Van Huffel, Sabine
    Bertrand, Alexander
    Varon, Carolina
    PEERJ COMPUTER SCIENCE, 2021, 7 : 1 - 26
  • [24] A review of unsupervised feature selection methods
    Solorio-Fernandez, Saul
    Carrasco-Ochoa, J. Ariel
    Martinez-Trinidad, Jose Fco.
    ARTIFICIAL INTELLIGENCE REVIEW, 2020, 53 (02) : 907 - 948
  • [25] An unsupervised approach to feature discretization and selection
    Ferreira, Artur J.
    Figueiredo, Mario A. T.
    PATTERN RECOGNITION, 2012, 45 (09) : 3048 - 3060
  • [26] Unsupervised feature selection for ensemble of classifiers
    Morita, M
    Oliveira, LS
    Sabourin, R
    NINTH INTERNATIONAL WORKSHOP ON FRONTIERS IN HANDWRITING RECOGNITION, PROCEEDINGS, 2004, : 81 - 86
  • [27] Hypergraph Spectra for Unsupervised Feature Selection
    Zhang, Zhihong
    Hancock, Edwin R.
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, 2012, 7626 : 620 - 628
  • [28] Dependence Guided Unsupervised Feature Selection
    Guo, Jun
    Zhu, Wenwu
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 2232 - 2239
  • [29] Unsupervised Feature Selection by Pareto Optimization
    Feng, Chao
    Qian, Chao
    Tang, Ke
    THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 3534 - 3541
  • [30] Scalable and Flexible Unsupervised Feature Selection
    Hu, Haojie
    Wang, Rong
    Yang, Xiaojun
    Nie, Feiping
    NEURAL COMPUTATION, 2019, 31 (03) : 517 - 537