Sciweavers

1339 search results - page 201 / 268
» Robust learning from bites for data mining
Sort
View
JMLR
2006
140views more  JMLR 2006»
13 years 7 months ago
Active Learning in Approximately Linear Regression Based on Conditional Expectation of Generalization Error
The goal of active learning is to determine the locations of training input points so that the generalization error is minimized. We discuss the problem of active learning in line...
Masashi Sugiyama
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 2 months ago
Primal sparse Max-margin Markov networks
Max-margin Markov networks (M3 N) have shown great promise in structured prediction and relational learning. Due to the KKT conditions, the M3 N enjoys dual sparsity. However, the...
Jun Zhu, Eric P. Xing, Bo Zhang
MCS
2009
Springer
14 years 7 days 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
CVPR
2008
IEEE
14 years 9 months ago
Unsupervised modeling of object categories using link analysis techniques
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...
Gunhee Kim, Christos Faloutsos, Martial Hebert
CHI
2004
ACM
14 years 8 months ago
Science at the Speed of Thought
Abstract. In this paper we describe a virtual laboratory that is designed to accelerate scientific exploration and discovery by minimizing the time between the generation of a scie...
Judith Ellen Devaney, Steven G. Satterfield, John ...