Sciweavers

1760 search results - page 268 / 352
» Learning from Partial Observations
Sort
View
144
Voted
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
15 years 7 months ago
Predicting and Optimizing Classifier Utility with the Power Law
When data collection is costly and/or takes a significant amount of time, an early prediction of the classifier performance is extremely important for the design of the data minin...
Mark Last
KDD
1995
ACM
139views Data Mining» more  KDD 1995»
15 years 7 months ago
Extracting Support Data for a Given Task
We report a novel possibility for extracting a small subset of a data base which contains all the information necessary to solve a given classification task: using the Support Vec...
Bernhard Schölkopf, Chris Burges, Vladimir Va...
AUSAI
2008
Springer
15 years 5 months ago
Discriminating Against New Classes: One-class versus Multi-class Classification
Many applications require the ability to identify data that is anomalous with respect to a target group of observations, in the sense of belonging to a new, previously unseen `atta...
Kathryn Hempstalk, Eibe Frank
139
Voted
CIKM
2008
Springer
15 years 5 months ago
A latent variable model for query expansion using the hidden markov model
We propose a novel probabilistic method based on the Hidden Markov Model (HMM) to learn the structure of a Latent Variable Model (LVM) for query language modeling. In the proposed...
Qiang Huang, Dawei Song
96
Voted
LREC
2010
154views Education» more  LREC 2010»
15 years 5 months ago
Porting an Ancient Greek and Latin Treebank
We have recently converted a dependency treebank, consisting of ancient Greek and Latin texts, from one annotation scheme to another that was independently designed. This paper ma...
John Lee, Dag Haug