Sciweavers

493 search results - page 77 / 99
» A Multi-relational Decision Tree Learning Algorithm - Implem...
Sort
View
RULEML
2004
Springer
14 years 1 months ago
Rule Learning for Feature Values Extraction from HTML Product Information Sheets
The Web is now a huge information repository with a rich semantic structure that, however, is primarily addressed to human understanding rather than automated processing by a compu...
Costin Badica, Amelia Badica
ICML
2002
IEEE
14 years 9 months ago
Pruning Improves Heuristic Search for Cost-Sensitive Learning
This paper addresses cost-sensitive classification in the setting where there are costs for measuring each attribute as well as costs for misclassification errors. We show how to ...
Valentina Bayer Zubek, Thomas G. Dietterich
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
ML
2006
ACM
110views Machine Learning» more  ML 2006»
13 years 8 months ago
Classification-based objective functions
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
Michael Rimer, Tony Martinez
ICML
2007
IEEE
14 years 9 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...