Sciweavers

1601 search results - page 75 / 321
» Closed Sets for Labeled Data
Sort
View
CIKM
2000
Springer
15 years 8 months ago
Analyzing the Effectiveness and Applicability of Co-training
Recently there has been significant interest in supervised learning algorithms that combine labeled and unlabeled data for text learning tasks. The co-training setting [1] applie...
Kamal Nigam, Rayid Ghani
ICML
2008
IEEE
16 years 5 months ago
Boosting with incomplete information
In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we pres...
Feng Jiao, Gholamreza Haffari, Greg Mori, Shaojun ...
AAAI
2008
15 years 6 months ago
Strategyproof Classification under Constant Hypotheses: A Tale of Two Functions
We consider the following setting: a decision maker must make a decision based on reported data points with binary labels. Subsets of data points are controlled by different selfi...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
LREC
2008
89views Education» more  LREC 2008»
15 years 6 months ago
Parser Evaluation and the BNC: Evaluating 4 constituency parsers with 3 metrics
We evaluate discriminative parse reranking and parser self-training on a new English test set using four versions of the Charniak parser and a variety of parser evaluation metrics...
Jennifer Foster, Josef van Genabith
ICDM
2002
IEEE
114views Data Mining» more  ICDM 2002»
15 years 9 months ago
Online Algorithms for Mining Semi-structured Data Stream
In this paper, we study an online data mining problem from streams of semi-structured data such as XML data. Modeling semi-structured data and patterns as labeled ordered trees, w...
Tatsuya Asai, Hiroki Arimura, Kenji Abe, Shinji Ka...