Sciweavers

462 search results - page 51 / 93
» Learning DNF by Decision Trees
Sort
View
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
15 years 2 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
ECML
2001
Springer
15 years 2 months ago
A Framework for Learning Rules from Multiple Instance Data
Abstract. This paper proposes a generic extension to propositional rule learners to handle multiple-instance data. In a multiple-instance representation, each learning example is r...
Yann Chevaleyre, Jean-Daniel Zucker
WFLP
2000
Springer
148views Algorithms» more  WFLP 2000»
15 years 1 months ago
The Use of Functional and Logic Languages in Machine Learning
Abstract. Traditionally, machine learning algorithms such as decision tree learners have employed attribute-value representations. From the early 80's on people have started t...
Peter A. Flach
PKDD
2005
Springer
95views Data Mining» more  PKDD 2005»
15 years 3 months ago
Ensembles of Balanced Nested Dichotomies for Multi-class Problems
Abstract. A system of nested dichotomies is a hierarchical decomposition of a multi-class problem with c classes into c − 1 two-class problems and can be represented as a tree st...
Lin Dong, Eibe Frank, Stefan Kramer
IPPS
2010
IEEE
14 years 7 months ago
Offline library adaptation using automatically generated heuristics
Automatic tuning has emerged as a solution to provide high-performance libraries for fast changing, increasingly complex computer architectures. We distinguish offline adaptation (...
Frédéric de Mesmay, Yevgen Voronenko...