Sciweavers

14 search results - page 1 / 3
» Learning to Find Relevant Biological Articles without Negati...
Sort
View
AUSAI
2008
Springer
13 years 6 months ago
Learning to Find Relevant Biological Articles without Negative Training Examples
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...
Keith Noto, Milton H. Saier Jr., Charles Elkan
TREC
2004
13 years 5 months ago
Identifying Relevant Full-Text Articles for GO Annotation Without MeSH Terms
Gene Ontology (GO) is a controlled vocabulary. Given a gene product, GO enables scientists to clearly and unambiguously describe specific molecular functions of the gene product, ...
Chih Lee, Wen-Juan Hou, Hsin-Hsi Chen
CIKM
2009
Springer
13 years 11 months ago
Enabling multi-level relevance feedback on pubmed by integrating rank learning into DBMS
Background: Finding relevant articles from PubMed is challenging because it is hard to express the user’s specific intention in the given query interface, and a keyword query ty...
Hwanjo Yu, Taehoon Kim, Jinoh Oh, Ilhwan Ko, Sungc...
SDM
2004
SIAM
174views Data Mining» more  SDM 2004»
13 years 5 months ago
Classifying Documents Without Labels
Automatic classification of documents is an important area of research with many applications in the fields of document searching, forensics and others. Methods to perform classif...
Daniel Barbará, Carlotta Domeniconi, Ning K...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 4 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto