The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.
Link-based Classification
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
(1990) · Choice Reviews Online · doi:10.5860/choice.27-3338 · Cited by 35,305
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
(1999) · Cited by 12,854
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
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
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
A comparison of event models for naive bayes text classification
McCallum, A., & Nigam, K. (1998) · Cited by 3,289
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
(2001) · Cited by 1,932
Nearest neighbor (NN) norms: NN pattern classification techniques
Dasarathy, B. V. (1991) · Medical Entomology and Zoology · Cited by 1,654
Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850085 · Cited by 1,617
Scene Labeling by Relaxation Operations
Rosenfeld, A., Hummel, R. A., & Zucker, S. W. (1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.4309519 · Cited by 1,399
Loopy Belief Propagation for Approximate Inference: An Empirical Study
Murphy, K. P., Weiss, Y., & Jordan, M. I. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6725 · Cited by 1,397
Automating the Construction of Internet Portals with Machine Learning
McCallum, A. K., Nigam, K., Rennie, J., & Seymore, K. (2000) · Information Retrieval · doi:10.1023/a:1009953814988 · Cited by 1,280
Taskar, B., Guestrin, C., & Koller, D. (2003) · Cited by 1,206
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
Editorial: On Machine Learning
Langley, P. (1986) · Machine Learning · doi:10.1023/a:1022687019898 · Cited by 951
Learning Probabilistic Relational Models
Getoor, L., Friedman, N., Koller, D., & Pfeffer, A. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_13 · Cited by 933
Self-citationLearning from Labeled and Unlabeled Data using Graph Mincuts
Blum, A. L., & Chawla, S. (2018) · doi:10.1184/r1/6606860 · Cited by 928
On the Foundations of Relaxation Labeling Processes
Hummel, R. A., & Zucker, S. W. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767390 · Cited by 885
Enhanced hypertext categorization using hyperlinks
Chakrabarti, S., Dom, B., & Indyk, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276332 · Cited by 769
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
Discriminative probabilistic models for relational data
Taskar, B., Abbeel, P., & Koller, D. (2002) · Cited by 625
Quinlan, J. R., & Cameron-Jones, R. M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-56602-3_124 · Cited by 528 · cited 1×
“Using these statistical features and a relational rule learner based on FOIL (Quinlan & Cameron-Jones, 1993), they propose a combined model for text classification.”
Finding related pages in the World Wide Web
Dean, J., & Henzinger, M. R. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00022-5 · Cited by 489
Link Prediction in Relational Data
Taskar, B., Wong, M.-F., Abbeel, P., & Koller, D. (2003) · Cited by 452
The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity
Cohn, D. A., & Hofmann, T. (2000) · Cited by 436
Cook, D. J., & Holder, L. B. (2000) · IEEE Intelligent Systems and their Applications · doi:10.1109/5254.850825 · Cited by 406
Text Categorization Based on Regularized Linear Classification Methods
Zhang, T., & Oles, F. J. (2001) · Information Retrieval · doi:10.1023/a:1011441423217 · Cited by 379
Iterative Classification in Relational Data
Neville, J., & Jensen, D. D. (2000) · Cited by 318
(2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2 · Cited by 313
A Study of Approaches to Hypertext Categorization
Yang, Y., Slattery, S., & Ghani, R. (2002) · Journal of Intelligent Information Systems · doi:10.1023/a:1013685612819 · Cited by 309
Bollobás, B., Borgs, C., Chayes, J., & Riordan, O. M. (2003) · doi:10.5555/644108.644133 · Cited by 302
Propositionalization Approaches to Relational Data Mining
Kramer, S., Lavrač, N., & Flach, P. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_11 · Cited by 271
Markov random fields : theory and application
Chellappa, R., & Jain, A. K. (1993) · Academic Press eBooks · Cited by 265
Why collective inference improves relational classification
Jensen, D., Neville, J., & Gallagher, B. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014125 · Cited by 256
A Simple Relational Classifier
Macskassy, S. A., & Provost, F. (2003) · doi:10.21236/ada452802 · Cited by 255
Learning probabilistic models of link structure
Getoor, L., Friedman, N., Koller, D., & Taskar, B. (2003) · Journal of Machine Learning Research · Cited by 252
Self-citationProbabilistic classification and clustering in relational data
Taskar, B., Segal, E., & Koller, D. (2001) · Cited by 225
Dězeroski, S. (2001) · Springer eBooks · Cited by 223
A probability analysis on the value of unlabeled data for classification problems
Zhang, T., & Oles, F. J. (2000) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 202
Learning associative Markov networks
Taskar, B., Chatalbashev, V., & Koller, D. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015444 · Cited by 171
The Role of Unlabeled Data in Supervised Learning
Mitchell, T. M. (2004) · Springer eBooks · doi:10.1007/978-1-4020-2783-3_7 · Cited by 157
Using unlabeled data to improve text classification
Nigam, K. P., & Mitchell, T. M. (2001) · Cited by 129
Combining statistical and relational methods for learning in hypertext domains
Slattery, S., & Craven, M. W. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027309 · Cited by 75
Stochastic link and group detection
Kubica, J., Moore, A., Schneider, J., & Yang, Y. (2002) · doi:10.5555/777092.777215 · Cited by 67
Combining labeled and unlabeled data for text classification with a large number of categories
Ghani, R. (2002) · Proceedings · doi:10.1109/icdm.2001.989574 · Cited by 66
Statistical challenges to inductive inference in linked data.
Jensen, D. D. (1999) · Cited by 36
The role of feature construction in inductive rule learning
Flach, P. A., De, R. L., Lavrač, N., & Kramer, S. (2000) · Bristol Research (University of Bristol) · Cited by 29
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
Self-citationA survey on semi-supervised learning
van Engelen, J. E., & Hoos, H. H. (2020) · Machine Learning · doi:10.1007/s10994-019-05855-6 · Cited by 2,666
Feng, Y., You, H., Zhang, Z., Ji, R., & Gao, Y. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013558 · Cited by 1,895
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801
“Feature-based models [11], [12], [56] generate features for nodes based on their neighborhood and local network statistics and then apply a classifier like Logistic Regression [57] and Naive Bayes [58] to predict the labels.”
MethodGraph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
Metadata
- Authors
- Getoor, L.
- Venue
- Advanced Information and Knowledge Processing
- Publisher
- Springer-Verlag
- Published
- 2006-01-01
- Pages
- 189-207
- OpenAlex
- W1908728294
- Cited by
- 612
- References
- 50
- FWCI
- 45.73
- Type
- book chapter
- 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.