Sciweavers

19 search results - page 3 / 4
» Scalable Inductive Learning on Partitioned Data
Sort
View
JUCS
2008
160views more  JUCS 2008»
13 years 6 months ago
Automatic Construction of Fuzzy Rule Bases: a further Investigation into two Alternative Inductive Approaches
: The definition of the Fuzzy Rule Base is one of the most important and difficult tasks when designing Fuzzy Systems. This paper discusses the results of two different hybrid meth...
Marcos Evandro Cintra, Heloisa de Arruda Camargo, ...
IFIP12
2008
13 years 7 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
ICML
2002
IEEE
14 years 7 months ago
Adaptive View Validation: A First Step Towards Automatic View Detection
Multi-view algorithms reduce the amount of required training data by partitioning the domain features into separate subsets or views that are sufficient to learn the target concep...
Ion Muslea, Steven Minton, Craig A. Knoblock
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 6 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
MLDM
2005
Springer
13 years 11 months ago
Multivariate Discretization by Recursive Supervised Bipartition of Graph
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
Sylvain Ferrandiz, Marc Boullé