Sciweavers

132 search results - page 17 / 27
» Induction of Oblique Decision Trees
Sort
View
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 8 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
MLDM
2009
Springer
14 years 3 months ago
PMCRI: A Parallel Modular Classification Rule Induction Framework
In a world where massive amounts of data are recorded on a large scale we need data mining technologies to gain knowledge from the data in a reasonable time. The Top Down Induction...
Frederic T. Stahl, Max A. Bramer, Mo Adda
SGAI
2009
Springer
14 years 3 months ago
Parallel Rule Induction with Information Theoretic Pre-Pruning
In a world where data is captured on a large scale the major challenge for data mining algorithms is to be able to scale up to large datasets. There are two main approaches to indu...
Frederic T. Stahl, Max Bramer, Mo Adda
IFIP12
2008
13 years 10 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
AIIDE
2006
13 years 10 months ago
Predicting User Physiological Response for Interactive Environments: An Inductive Approach
Affective reasoning holds great potential for interactive digital entertainment, education, and training. Incorporating affective reasoning into the decision-making capabilities o...
Scott W. McQuiggan, Sunyoung Lee, James C. Lester