879 search results - page 33 / 176 » Greedy Attribute Selection |
CSDA
2004
13 years 9 months ago
2004
A common approach to split selection in classification trees is to search through all possible splits generated by predictor variables. A splitting criterion is then used to evalu...
VLDB
2004
ACM
14 years 3 months ago
2004
ACM
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
CHI
2008
ACM
14 years 10 months ago
2008
ACM
Selection is a fundamental task in interactive applications, typically performed by clicking or lassoing items of interest. However, users may require more nuanced forms of select...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
WECWIS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper we present a novel approach and a system for automated selection of building blocks, by exploiting business processes semantics. The selection process is based on a ...