Sciweavers

1291 search results - page 11 / 259
» Learning Rules from Distributed Data
Sort
View
DAWAK
2006
Springer
15 years 3 months ago
Learning Classifiers from Distributed, Ontology-Extended Data Sources
Abstract. There is an urgent need for sound approaches to integrative and collaborative analysis of large, autonomous (and hence, inevitably semantically heterogeneous) data source...
Doina Caragea, Jun Zhang 0002, Jyotishman Pathak, ...
IFIP12
2008
15 years 1 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
90
Voted
ECML
2005
Springer
15 years 5 months ago
Learning from Positive and Unlabeled Examples with Different Data Distributions
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive exam...
Xiaoli Li, Bing Liu
82
Voted
NIPS
1994
15 years 29 days ago
From Data Distributions to Regularization in Invariant Learning
Ideally pattern recognition machines provide constant output when the inputs are transformed under a group G of desired invariances. These invariances can be achieved by enhancing...
Todd K. Leen
ICDM
2002
IEEE
93views Data Mining» more  ICDM 2002»
15 years 4 months ago
Learning from Order Examples
We advocate a new learning task that deals with orders of items, and we call this the Learning from Order Examples (LOE) task. The aim of the task is to acquire the rule that is u...
Toshihiro Kamishima, Shotaro Akaho