The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Pebl:web page classification without negative examples
Abstract
Web page classification is one of the essential techniques for Web mining because classifying Web pages of an interesting class is often the first step of mining the Web. However, constructing a classifier for an interesting class requires laborious preprocessing such as collecting positive and negative training examples. For instance, in order to construct a "homepage" classifier, one needs to collect a sample of homepages (positive examples) and a sample of nonhomepages (negative examples). In particular, collecting negative training examples requires arduous work and caution to avoid bias. The paper presents a framework, called positive example based learning (PEBL), for Web page classification which eliminates the need for manually collecting negative training examples in preprocessing. The PEBL framework applies an algorithm, called mapping-convergence (M-C), to achieve high classification accuracy (with positive and unlabeled data) as high as that of a traditional SVM (with positive and negative data). M-C runs in two stages: the mapping stage and convergence stage. In the mapping stage, the algorithm uses a weak classifier that draws an initial approximation of "strong" negative data. Based on the initial approximation, the convergence stage iteratively runs an internal classifier (e.g., SVM) which maximizes margins to progressively improve the approximation of negative data. Thus, the class boundary eventually converges to the true boundary of the positive class in the feature space. We present the M-C algorithm with supporting theoretical and experimental justifications. Our experiments show that, given the same set of positive examples; the M-C algorithm outperforms one-class SVMs, and it is almost as accurate as the traditional SVMs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736
Transductive Inference for Text Classification using Support Vector Machines
Joachims, T. (1999) · Cited by 2,723
A re-examination of text categorization methods
Yang, Y., & Liu, X. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312647 · Cited by 2,652
Support Vector Method for Novelty Detection
Schölkopf, B., Williamson, R. C., Smola, A. J., Shawe-Taylor, J. S., & Platt, J. C. (1999) · Cited by 2,040
Support vector domain description
Tax, D. M. J., & Duin, R. P. W. (1999) · Pattern Recognition Letters · doi:10.1016/s0167-8655(99)00087-2 · Cited by 1,614
Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers
Allwein, E. L., Schapire, R. E., & Singer, Y. (2000) · International Conference on Machine Learning · Cited by 1,312
One-class svms for document classification
Manevitz, L. M., & Yousef, M. (2002) · doi:10.5555/944790.944808 · Cited by 1,207
Cited by
Learning classifiers from only positive and unlabeled data
Elkan, C., & Noto, K. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401920 · Cited by 1,028
Learning from positive and unlabeled data: a survey
Bekker, J., & Davis, J. (2020) · Machine Learning · doi:10.1007/s10994-020-05877-5 · Cited by 651
One-class classification: taxonomy of study and review of techniques
Khan, S. S., & Madden, M. G. (2014) · The Knowledge Engineering Review · doi:10.1017/s026988891300043x · Cited by 600
A review of machine learning approaches to Spam filtering
Guzella, T. S., & Caminhas, W. M. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.02.037 · Cited by 542
Web page classification: Features and algorithms
Qi, X., & Davison, B. D. (2009) · ACM Computing Surveys · doi:10.1145/1459352.1459357 · Cited by 435
A bagging SVM to learn from positive and unlabeled examples
Mordelet, F., & Vert, J.-P. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2013.06.010 · Cited by 335
A Survey of Recent Trends in One Class Classification
Khan, S. S., & Madden, M. G. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17080-5_21 · Cited by 330
Fast nonparametric estimation of class proportions in the positive-unlabeled classification setting
Zeiberg, D., Jain, S., & Radivojac, P. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.6151 · Cited by 29
Metadata
- Authors
- Yu, H., Han, J., & Chang, K. C.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2004-01
- Volume
- 16
- Issue
- 1
- Pages
- 70-81
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2156772624
- Cited by
- 257
- References
- 25
- FWCI
- 24.15
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.