2000
DOI: 10.1007/3-540-45164-1_40
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Feature Selection in Incremental Hierarchical Clustering

Abstract: Feature selection has received a lot of attention in the machine learning community, but mainly under the supervised paradigm. In this work we study the potential benefits of feature selection in hierarchical clustering tasks. Particularly we address this problem in the context of incremental clustering, following the basic ideas of Gennari [8]. By using a simple implementation, we show that a feature selection scheme running in parallel with the learning process can improve the clustering task under the dimen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
29
0
4

Year Published

2003
2003
2016
2016

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(34 citation statements)
references
References 11 publications
0
29
0
4
Order By: Relevance
“…Other related work has been done on feature selection as a pre-processing step for hierarchical clustering algorithms (Talavera, 1999). However, feature selection algorithms simply select a subset of meaningful features from V , by setting degrees of relevance to either zero or one.…”
Section: Introductionmentioning
confidence: 99%
“…Other related work has been done on feature selection as a pre-processing step for hierarchical clustering algorithms (Talavera, 1999). However, feature selection algorithms simply select a subset of meaningful features from V , by setting degrees of relevance to either zero or one.…”
Section: Introductionmentioning
confidence: 99%
“…Filter approaches use an evaluation function based on the characteristics of all data, independently of any classification algorithm [6][7][8][9][10]. These methods are fast, general and less expensive in computation time, which allows them to operate more easily with databases of very large dimensions.…”
Section: Introductionmentioning
confidence: 99%
“…In case of unsupervised classification it is very difficult to measure the goodness of a particular feature. In recent years some works have been reported to solve the unsupervised feature selection problem (Dash and Liu 1999;Dy and Brodley 2004;Kim et al 2002;Mitra et al 2002;Pe帽a et al 2001;Talavera 1999). But most of these techniques pose the feature selection problem as a single objective optimization technique.…”
Section: Introductionmentioning
confidence: 99%