Learning classifiers without negative examples: A reduction approach

作者: Dell Zhang , Wee Sun Lee

DOI: 10.1109/ICDIM.2008.4746761

关键词:

摘要: The problem of PU Learning, i.e., learning classifiers with positive and unlabelled examples (but not negative examples), is very important in information retrieval data mining. We address this through a novel approach: reducing it to the for some meaningful multivariate performance measures. In particular, we show how powerful machine algorithm, support vector machine, can be adapted solve problem. effectiveness efficiency proposed approach have been confirmed by our experiments on three real-world datasets.

参考文章(21)
B. Liu, Y. Dai, X. Li, W.S. Lee, P.S. Yu, Building text classifiers using positive and unlabeled examples international conference on data mining. pp. 179- 186 ,(2003) , 10.1109/ICDM.2003.1250918
Gabriel Pui Cheong Fung, J.X. Yu, Hongjun Lu, P.S. Yu, Text classification without negative examples revisit IEEE Transactions on Knowledge and Data Engineering. ,vol. 18, pp. 6- 20 ,(2006) , 10.1109/TKDE.2006.16
Hwanjo Yu, Jiawei Han, K.C. Chang, PEBL: Web page classification without negative examples IEEE Transactions on Knowledge and Data Engineering. ,vol. 16, pp. 70- 81 ,(2004) , 10.1109/TKDE.2004.1264823
Bernhard Schölkopf, Learning with kernels ,(2001)
Rémi Gilleron, Marc Tommasi, François Denis, Text Classification from Positive and Unlabeled Examples international conference information processing. ,(2002)
Bing Liu, Xiaoli Li, Learning to classify texts using positive and unlabeled data international joint conference on artificial intelligence. pp. 587- 592 ,(2003)
Marina Sokolova, Nathalie Japkowicz, Stan Szpakowicz, Beyond Accuracy, F-Score and ROC: A Family of Discriminant Measures for Performance Evaluation Lecture Notes in Computer Science. pp. 1015- 1021 ,(2006) , 10.1007/11941439_114
Hinrich Schütze, Christopher D. Manning, Prabhakar Raghavan, Introduction to Information Retrieval ,(2005)