The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Automating the Construction of Internet Portals with Machine Learning
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
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
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743 · cited 3×
“The Forward algorithm can be used to calculate this probability e ciently (Rabiner, 1989).”
MethodInfluentialAdvances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,759
Combining labeled and unlabeled data with co-training
Blum, A., & Mitchell, T. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279962 · Cited by 5,495
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
Maximum likelihood estimation from incomplete data via the EM algorithm
Dempster, A. P. (1977) · Journal of the Royal Statistical Society Series A (Statistics in Society) · Cited by 4,543
A comparison of event models for naive bayes text classification
McCallum, A., & Nigam, K. (1998) · Cited by 3,289
Self-citationText 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
Self-citationUnsupervised word sense disambiguation rivaling supervised methods
Yarowsky, D. (1995) · Proceedings of the 33rd annual meeting on Association for Computational Linguistics - · doi:10.3115/981658.981684 · Cited by 2,385
Naive (Bayes) at forty: The independence assumption in information retrieval
Lewis, D. D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026666 · Cited by 2,104
An empirical study of smoothing techniques for language modeling
Chen, S. F., & Goodman, J. (1999) · Computer Speech & Language · doi:10.1006/csla.1999.0128 · Cited by 2,066
Focused crawling: a new approach to topic-specific Web resource discovery
Chakrabarti, S., van den Berg, M., & Dom, B. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00052-3 · Cited by 1,486
Baum, L. E. (1972) · Medical Entomology and Zoology · Cited by 1,405
CiteSeer: an automatic citation indexing system
Giles, C. L., Bollacker, K. D., & Lawrence, S. (1998) · Proceedings of the third ACM conference on Digital libraries - DL '98 · doi:10.1145/276675.276685 · Cited by 1,040
Efficient crawling through URL ordering
Cho, J., Garcia-Molina, H., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00108-1 · Cited by 837
Nymble: a high-performance learning name-finder
Bikel, D. M., Miller, S., Schwartz, R., & Weischedel, R. (1997) · Proceedings of the fifth conference on Applied natural language processing - · doi:10.3115/974557.974586 · Cited by 726
Web Watcher: A Tour Guide for the World Wide Web.
Joachims, T., Freitag, D., & Mitchell, T. M. (1997) · Cited by 685
Learning to extract symbolic knowledge from the World Wide Web
Craven, M. W., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T. M., Nigam, K., & Slattery, S. (1998) · National Conference on Artificial Intelligence · Cited by 662
Self-citationDigital libraries and autonomous citation indexing
Lawrence, S., Lee Giles, C., & Bollacker, K. (1999) · Computer · doi:10.1109/2.769447 · Cited by 607
On structuring probabilistic dependences in stochastic language modelling
Ney, H., Essen, U., & Kneser, R. (1994) · Computer Speech & Language · doi:10.1006/csla.1994.1001 · Cited by 517
Tagging English text with a probabilistic model
Mérialdo, B. (1994) · Cited by 474
Improving Text Classification by Shrinkage in a Hierarchy of Classes
McCallum, A., Rosenfeld, R., Mitchell, T., & Ng, A. Y. (2022) · doi:10.1184/r1/21708647 · Cited by 471
Self-citationRobust part-of-speech tagging using a hidden Markov model
Kupiec, J. (1992) · Computer Speech & Language · doi:10.1016/0885-2308(92)90019-z · Cited by 416
Information Extraction with HMM Structures Learned by Stochastic Optimization
Freitag, D., & McCallum, A. (2000) · Cited by 282
Self-citationInformation Extraction with HMMs and Shrinkage
Freitag, D., & McCallum, A. K. (1999) · Cited by 237
Self-citationUsing Reinforcement Learning to Spider the Web Efficiently
Rennie, J. D. M., & McCallum, A. (1999) · Cited by 212
Self-citationOn-line policy improvement using Monte-Carlo search
Tesauro, G., & Galperin, G. R. (2025) · arXiv · doi:10.48550/arxiv.2501.05407 · Cited by 209
Approximate Planning in Large POMDPs via Reusable Trajectories
Kearns, M. J., Mansour, Y., & Ng, A. Y. (1999) · neural information processing systems · Cited by 163
A Machine Learning Architecture for Optimizing Web Search Engines
Boyan, J. A., & Freitag, D. (1999) · Cited by 130
Dialog act modelling for conversational speech
Stolcke, A., Shriberg, E. E., Bates, R. A., Coccaro, N., Jurafsky, D. S., Martin, R. W., Meteer, M. W., Ries, K., Taylor, P., & Ess-Dykema, C. V. (1998) · ERA · Cited by 68
AAAI-96 Workshop on Internet-Based Information Systems
Franz, A. (1997) · AI Magazine · Cited by 31
(1999)
Cited by
Collective Classification in Network Data
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T. (2008) · AI Magazine · doi:10.1609/aimag.v29i3.2157 · Cited by 3,293
Is All That Talk Just Noise? The Information Content of Internet Stock Message Boards
Antweiler, W., & Frank, M. Z. (2004) · The Journal of Finance · doi:10.1111/j.1540-6261.2004.00662.x · Cited by 2,373
Cui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
Efficient clustering of high-dimensional data sets with application to reference matching
McCallum, A., Nigam, K., & Ungar, L. H. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347123 · Cited by 1,096
Self-citationAdversarial Attacks on Neural Networks for Graph Data
Zügner, D., Akbarnejad, A., & Günnemann, S. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220078 · Cited by 968
Metadata
- Authors
- McCallum, A. K., Nigam, K., Rennie, J., & Seymore, K.
- Venue
- Information Retrieval
- Published
- 2000-07
- Volume
- 3
- Issue
- 2
- Pages
- 127-163
- ISSN
- 1386-4564 (ISSN-L)
- 1573-7659
- OpenAlex
- W2162630660
- Cited by
- 1,280
- References
- 36
- FWCI
- 54.00
- 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.