Some issues on scalable feature selection

doi:10.1016/S0957-4174(98)90049-5

Return

Some issues on scalable feature selection

1998-10-01

PRE

Liu, HA *

Rudy Setiono

DOI：10.1016/S0957-4174(98)90049-5

Original

Original request for help

Save

Abstract

En 中文

Feature selection determines relevant features in the data. It is often applied in pattern classification, data mining, as well as machine learning. A special concern for feature selection nowadays is that the size of a database is normally very large, both vertically and horizontally. In addition, feature sets may grow as the data collection process continues. Effective solutions are needed to accommodate the practical demands. This paper concentrates on three issues: large number of features, large data size, and expanding feature set. For the first issue, we suggest a probabilistic algorithm to select features. For the second issue, we present a scalable probabilistic algorithm that expedites feature selection further and can scale up without sacrificing the quality of selected features. For the third issue, we propose an incremental algorithm that adapts to the newly extended feature set and captures ''concept drifts' by removing features from previously selected and newly added ones. We expect that research on scalable: feature selection will be extended to distributed and parallel computing and have impact on applications of data mining and machine learning. (C) 1998 Elsevier Science Ltd. All rights reserved.

Keywords:

features

probabilistic selection

scalability

large databases

pattern classification

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.