.png){kind=icon}
Return
Distributed feature selection: An application to microarray data classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2015.01.035.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Feature selection is often required as a preliminary step for many pattern recognition problems. However, most of the existing algorithms only work in a centralized fashion, i.e. using the whole dataset at once. In this research a new method for distributing the feature selection process is proposed. It distributes the data by features, i.e. according to a vertical distribution, and then performs a merging procedure which updates the feature subset according to improvements in the classification accuracy. The effectiveness of our proposal is tested on microarray data, which has brought a difficult challenge for researchers due to the high number of gene expression contained and the small samples size. The results on eight microarray datasets show that the execution time is considerably shortened whereas the performance is maintained or even improved compared to the standard algorithms applied to the non-partitioned datasets. (C) 2015 Elsevier B.V. All rights reserved.
Keywords:
Feature selection
Distributed learning
Microarray data
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
ShareSaveMaximum weight and minimum redundancy: A novel framework for feature subset selection.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSaveShareSaveAn ensemble of filters and classifiers for microarray data classificationPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSave
View more