Name
Abstract | ||
|---|---|---|
In knowledge discovery applications, where new features are to be added, an acquisition policy can help select the features to be acquired based on their relevance and the cost of extraction. This can be posed as a feature selection problem where the feature values are not known in advance. We propose a technique to actively sample the feature values with the ultimate goal of choosing between alternative candidate features with minimum sampling cost. Our heuristic algorithm is based on extracting candidate features in a region of the instance space where the feature value is likely to alter our knowledge the most. An experimental evaluation on a standard database shows that it is possible outperform a random subsampling policy in terms of the accuracy in feature selection. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/ICDM.2003.1251003 | ICDM |
Keywords | Field | DocType |
data mining,feature extraction,sampling methods,active sampling,feature extraction,feature selection,heuristic algorithm,knowledge acquisition,knowledge discovery | Data mining,Pattern recognition,Feature selection,Feature (computer vision),Heuristic (computer science),Computer science,Feature extraction,Knowledge extraction,Artificial intelligence,Sampling (statistics),Kanade–Lucas–Tomasi feature tracker,Machine learning | Conference |
ISBN | Citations | PageRank |
0-7695-1978-4 | 4 | 0.56 |
References | Authors | |
12 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sriharsha Veeramachaneni | 1 | 4 | 0.56 |
| Paolo Avesani | 2 | 1311 | 89.56 |