A pairwise ranking based approach to learning with positive and unlabeled examples
Authors:
Open Access
- 24 October 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 663-672
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient algorithms for ranking with SVMsInformation Retrieval Journal, 2009
- Feature subset selection from positive and unlabelled examplesPattern Recognition Letters, 2009
- Learning classifiers from only positive and unlabeled data2008
- Learning Bayesian classifiers from positive and unlabeled examplesPattern Recognition Letters, 2007
- Large scale semi-supervised linear SVMs2006
- Learning to rank using gradient descent2005
- Feature selection for text categorization on imbalanced dataACM SIGKDD Explorations Newsletter, 2004
- Pebl:web page classification without negative examplesIEEE Transactions on Knowledge and Data Engineering, 2004
- Document Representation for One-Class SVMLecture Notes in Computer Science, 2004
- Text classification from positive and unlabeled documents2003