Graph based Partially Supervised Learning of documents
We propose a novel graph-based algorithm, Graph-Partially Supervised Learning (Graph-PSL), to solve the problem of document classification with positive and unlabeled documents. The key characteristic of the problem is that labeled negative documents are missing. We present a graph-based method to identify reliable negative documents and theoretically explain it by lazy information transfer network. The documents are classified by Transductive Support Vector Machine (TSVM), which can explore the information contained in unlabeled data. We explain how the similarity matrix of the graph and the kernel matrix in TSVM are calculated. We apply Graph-PSL to 20 Newsgroup dataset. The experimental results demonstrate that Graph-PSL identifies negative documents accurately and classifies the unlabeled ones more effectively and more robustly compared to Bayesian based algorithms.