Sciweavers

1661 search results - page 284 / 333
» Decision Tree Fields
Sort
View
IFIP12
2008
15 years 1 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
IPCO
2007
108views Optimization» more  IPCO 2007»
15 years 1 months ago
Orbital Branching
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
SDM
2008
SIAM
136views Data Mining» more  SDM 2008»
15 years 1 months ago
Exploration and Reduction of the Feature Space by Hierarchical Clustering
In this paper we propose and test the use of hierarchical clustering for feature selection. The clustering method is Ward's with a distance measure based on GoodmanKruskal ta...
Dino Ienco, Rosa Meo
SEBD
2008
169views Database» more  SEBD 2008»
15 years 1 months ago
Clustering the Feature Space
Abstract Dino Ienco and Rosa Meo Dipartimento di Informatica, Universit`a di Torino, Italy In this paper we propose and test the use of hierarchical clustering for feature selectio...
Dino Ienco, Rosa Meo
AAAI
2004
15 years 1 months ago
Rapid Object Recognition from Discriminative Regions of Interest
Object recognition and detection represent a relevant component in cognitive computer vision systems, such as in robot vision, intelligent video surveillance systems, or multi-mod...
Gerald Fritz, Christin Seifert, Lucas Paletta, Hor...