Sciweavers

507 search results - page 73 / 102
» Generating Better Decision Trees
Sort
View
VLDB
1995
ACM
194views Database» more  VLDB 1995»
15 years 6 months ago
Eager Aggregation and Lazy Aggregation
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
Weipeng P. Yan, Per-Åke Larson
BIOID
2008
103views Biometrics» more  BIOID 2008»
15 years 5 months ago
Promoting Diversity in Gaussian Mixture Ensembles: An Application to Signature Verification
Abstract. Classifiers based on Gaussian mixture models are good performers in many pattern recognition tasks. Unlike decision trees, they can be described as stable classifier: a s...
Jonas Richiardi, Andrzej Drygajlo, Laetitia Todesc...
127
Voted
AIPRF
2007
15 years 4 months ago
Evaluation of Different Approaches to Training a Genre Classifier
This paper presents experiments on classifying web pages by genre. Firstly, a corpus of 1539 manually labeled web pages was prepared. Secondly, 502 genre features were selected ba...
Vedrana Vidulin, Mitja Lustrek, Matjaz Gams
IFIP12
2008
15 years 4 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 4 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...