Sciweavers

27 search results - page 5 / 6
» Empirical and theoretical support for lenient learning
Sort
View
ECML
1997
Springer
13 years 10 months ago
Global Data Analysis and the Fragmentation Problem in Decision Tree Induction
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...
Ricardo Vilalta, Gunnar Blix, Larry A. Rendell
PKDD
2009
Springer
118views Data Mining» more  PKDD 2009»
14 years 17 days ago
Sparse Kernel SVMs via Cutting-Plane Training
We explore an algorithm for training SVMs with Kernels that can represent the learned rule using arbitrary basis vectors, not just the support vectors (SVs) from the training set. ...
Thorsten Joachims, Chun-Nam John Yu
AI
2006
Springer
13 years 6 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
IDA
1998
Springer
13 years 5 months ago
Self-Organized-Expert Modular Network for Classification of Spatiotemporal Sequences
We investigate a form of modular neural network for classification with (a) pre-separated input vectors entering its specialist (expert) networks, (b) specialist networks which ar...
Sylvian R. Ray, William H. Hsu
MCS
2009
Springer
13 years 10 months ago
Random Ordinality Ensembles A Novel Ensemble Method for Multi-valued Categorical Data
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...
Amir Ahmad, Gavin Brown