Sciweavers

1923 search results - page 339 / 385
» Weighted Decision Trees
Sort
View
IADIS
2008
13 years 9 months ago
Customer Insights from Transactional Database: Database Marketing Case
Marketing databases are currently one of the most important resources in any marketing departments. Regarding their customer knowledge needs many of them had develop their own dat...
Filipe Mota Pinto, Alzira Ascensão Marques,...
IFIP12
2008
13 years 9 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»
13 years 9 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»
13 years 9 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»
13 years 9 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