Sciweavers

132 search results - page 20 / 27
» Induction of Oblique Decision Trees
Sort
View
ACL
2003
13 years 10 months ago
Using Predicate-Argument Structures for Information Extraction
In this paper we present a novel, customizable IE paradigm that takes advantage of predicate-argument structures. We also introduce a new way of automatically identifying predicat...
Mihai Surdeanu, Sanda M. Harabagiu, John Williams,...
IJCAI
1997
13 years 10 months ago
Machine Learning Techniques to Make Computers Easier to Use
Identifying user-dependent information that can be automatically collected helps build a user model by which 1) to predict what the user wants to do next and 2) to do relevant pre...
Hiroshi Motoda, Kenichi Yoshida
APBC
2004
132views Bioinformatics» more  APBC 2004»
13 years 10 months ago
Identifying Character Non-Independence in Phylogenetic Data Using Data Mining Techniques
Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyse...
Anne M. Maglia, Jennifer L. Leopold, Venkat Ram Gh...
ECML
2003
Springer
14 years 1 months ago
Logistic Model Trees
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
Niels Landwehr, Mark Hall, Eibe Frank
ML
2000
ACM
154views Machine Learning» more  ML 2000»
13 years 8 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb