Text classification without negative examples revisit

@article{citeulike:2939328, abstract = {Traditionally, building a classifier requires two sets of examples: positive examples and negative examples. This paper studies the problem of building a text classifier using positive examples (P) and unlabeled examples (U). The unlabeled examples are mixed with both positive and negative examples. Since no negative example is given explicitly, the task of building a reliable text classifier becomes far more challenging. Simply treating all of the unlabeled examples as negative examples and building a classifier thereafter is undoubtedly a poor approach to tackling this problem. Generally speaking, most of the studies solved this problem by a two-step heuristic: first, extract negative examples (N) from U. Second, build a classifier based on P and N. Surprisingly, most studies did not try to extract positive examples from U. Intuitively, enlarging P by P' (positive examples extracted from U) and building a classifier thereafter should enhance the effectiveness of the classifier. Throughout our study, we find that extracting P' is very difficult. A document in U that possesses the features exhibited in P does not necessarily mean that it is a positive example, and vice versa. The very large size of and very high diversity in U also contribute to the difficulties of extracting P'. In this paper, we propose a labeling heuristic called PNLH to tackle this problem. PNLH aims at extracting high quality positive examples and negative examples from U and can be used on top of any existing classifiers. Extensive experiments based on several benchmarks are conducted. The results indicated that PNLH is highly feasible, especially in the situation where |P| is extremely small.}, author = {Gabriel and Yu, J. X. and Lu, Hongjun and Yu, P. S. }, booktitle = {Knowledge and Data Engineering, IEEE Transactions on}, citeulike-article-id = {2939328}, doi = {10.1109/TKDE.2006.16}, journal = {Knowledge and Data Engineering, IEEE Transactions on}, keywords = {textmining}, number = {1}, pages = {6--20}, posted-at = {2008-06-28 17:32:10}, priority = {2}, title = {Text classification without negative examples revisit}, url = {http://dx.doi.org/10.1109/TKDE.2006.16}, volume = {18}, year = {2006} }

TY - JOUR ID - citeulike:2939328 L3 - citeulike-article-id:2939328 TI - Text classification without negative examples revisit T2 - Knowledge and Data Engineering, IEEE Transactions on JF - Knowledge and Data Engineering, IEEE Transactions on VL - 18 IS - 1 SP - 6 EP - 20 N2 - Traditionally, building a classifier requires two sets of examples: positive examples and negative examples. This paper studies the problem of building a text classifier using positive examples (P) and unlabeled examples (U). The unlabeled examples are mixed with both positive and negative examples. Since no negative example is given explicitly, the task of building a reliable text classifier becomes far more challenging. Simply treating all of the unlabeled examples as negative examples and building a classifier thereafter is undoubtedly a poor approach to tackling this problem. Generally speaking, most of the studies solved this problem by a two-step heuristic: first, extract negative examples (N) from U. Second, build a classifier based on P and N. Surprisingly, most studies did not try to extract positive examples from U. Intuitively, enlarging P by P' (positive examples extracted from U) and building a classifier thereafter should enhance the effectiveness of the classifier. Throughout our study, we find that extracting P' is very difficult. A document in U that possesses the features exhibited in P does not necessarily mean that it is a positive example, and vice versa. The very large size of and very high diversity in U also contribute to the difficulties of extracting P'. In this paper, we propose a labeling heuristic called PNLH to tackle this problem. PNLH aims at extracting high quality positive examples and negative examples from U and can be used on top of any existing classifiers. Extensive experiments based on several benchmarks are conducted. The results indicated that PNLH is highly feasible, especially in the situation where |P| is extremely small. KW - textmining AU - Gabriel AU - Yu, JX AU - Lu, Hongjun AU - Yu, PS PY - 2006/// UR - http://dx.doi.org/10.1109/TKDE.2006.16 ER -