Cited by 3,293Complex Network Analysis TechniquesAdvanced Graph Neural NetworksMachine Learning and Algorithms

The DOI matches its Crossref record; 72 of the 73 references it cites were found in a registry or an index.

Collective Classification in Network Data

Open access

Sen, Prithviraj, Namata, Galileo, Bilgic, Mustafa, Getoor, Lise, Gallagher, Brian, Eliassi‐Rad, Tina·2008·AI Magazine

Open this paper in CoChat — free account Open PDF

Abstract

Many real‐world applications produce networked data such as the worldwide web (hypertext documents connected through hyperlinks), social networks (such as people connected by friendship links), communication networks (computers connected through communication links), and biological networks (such as protein interaction networks). A recent focus in machine‐learning research has been to extend traditional machine‐learning classification techniques to classify nodes in such networks. In this article, we provide a brief introduction to this area of research and how it has progressed during the past decade. We introduce four of the most widely used inference algorithms for classifying networked data and empirically compare them on both synthetic and real‐world data.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

Integrity signals

Registry

Crossref · 10.1609/aimag.v29i3.2157

Cites

72 of 72 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Birds of a Feather: Homophily in Social Networks
McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001) · Annual Review of Sociology · doi:10.1146/annurev.soc.27.1.415 · Cited by 18,567
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
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
Advances in Neural Information Processing Systems 14
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 9,187
Markov Chain Monte Carlo in Practice
Gilks, W. R., Richardson, S. T., & Spiegelhalter, D. J. (1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,927
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Near Shannon limit error-correcting coding and decoding : Turbo-codes
Berrou, C. (1993) · International Conference on Communications · Cited by 4,264
On the Statistical Analysis of Dirty Pictures
Besag, J. E. (1986) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.2517-6161.1986.tb01412.x · Cited by 4,204
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
Markov logic networks
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
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,620
Expectation Propagation for approximate Bayesian inferencePreprint
Minka, T. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2294 · Cited by 1,391
Automating the Construction of Internet Portals with Machine Learning
McCallum, A. K., Nigam, K., Rennie, J. D. M., & Seymore, K. (2000) · Information Retrieval · doi:10.1023/a:1009953814988 · Cited by 1,346
Max-Margin Markov Networks
Taskar, B., Guestrin, C., & Koller, D. (2003) · Cited by 1,211
10.1007/978-1-4899-4485-6
(2000) · Time to knit · doi:10.1007/978-1-4899-4485-6 · Cited by 1,150
CiteSeer
Giles, C. L., Bollacker, K., & Lawrence, S. (1998) · doi:10.1145/276675.276685 · Cited by 1,045
Learning Probabilistic Relational Models
Getoor, L. C., Friedman, N., Koller, D., & Pfeffer, A. (2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2_13 · Cited by 936
Self-citation
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., Mackay, D., & Cheng, J.-F. T. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 919
Generalized Belief Propagation
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000) · Cited by 894
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) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/276304.276332 · Cited by 768
Link-based Classification
Getoor, L. C. (2006) · Springer eBooks · doi:10.1007/1-84628-284-5_7 · Cited by 688
Self-citation
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) · Cited by 677
MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
Wainwright, M. J., Jaakkola, T., & Willsky, A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856938 · Cited by 670
Discriminative probabilistic models for relational data
Taskar, B., Abbeel, P., & Koller, D. (2002) · Cited by 633
Proceedings of the Eighteenth International Conference on Machine Learning
Brodley, C. E., & Danyluk, A. (2001) · Cited by 566
Learning structured prediction models
Taskar, B., Chatalbashev, V., Koller, D., & Guestrin, C. (2005) · International Conference on Machine Learning · doi:10.1145/1102351.1102464 · Cited by 461
Bucket Elimination: A Unifying Framework for Probabilistic Inference
Dechter, R. (1998) · Springer eBooks · doi:10.1007/978-94-011-5014-9_4 · Cited by 457
Inference in belief networks: A procedural guide
Huang, C., & Darwiche, A. Y. (1996) · International Journal of Approximate Reasoning · doi:10.1016/s0888-613x(96)00069-2 · Cited by 453
Link Prediction in Relational Data
Taskar, B., Wong, M.-F., Abbeel, P., & Koller, D. (2003) · Cited by 452
Classification in Networked Data: A Toolkit and a Univariate Case Study
(2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248693 · Cited by 452
The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity
Cohn, D. A., & Hofmann, T. (2000) · Cited by 436
Iterative decoding of compound codes by probability propagation in graphical models
Kschischang, F. R., & Frey, B. J. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661110 · Cited by 394
Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
Anguelov, D., Taskar, B., Chatalbashev, V., Koller, D., Gupta, D., Heitz, G., & Ng, A. Y. (2005) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2005.133 · Cited by 363
Advanced Mean Field Methods
(2001) · The MIT Press eBooks · doi:10.7551/mitpress/1100.001.0001 · Cited by 335
A simple approach to Bayesian network computations
Zhang, N. L., & Poole, D. (1994) · Cited by 323
Iterative Classification in Relational Data
Neville, J., & Jensen, D. D. (2000) · Cited by 318
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 306
Relational Dependency Networks
Neville, J., & Jensen, D. D. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7432.003.0010 · Cited by 285
Propositionalization Approaches to Relational Data Mining
Krämer, S., Lavrač, N., & Flach, P. A. (2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2_11 · Cited by 273
Why collective inference improves relational classification
Jensen, D. D., Neville, J., & Gallagher, B. J. (2004) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1014052.1014125 · Cited by 257
Self-citation
CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
Yuille, A. (2002) · Neural Computation · doi:10.1162/08997660260028674 · Cited by 232
Probabilistic classification and clustering in relational data
Taskar, B., Segal, E., & Koller, D. (2001) · Cited by 229
Linkage and Autocorrelation Cause Feature Selection Bias in Relational Learning
Jensen, D. D., & Neville, J. (2002) · Cited by 167
On the collective classification of email "speech acts"
Carvalho, V. R., & Cohen, W. W. (2005) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1076034.1076094 · Cited by 161
Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Breese, J., & Koller, D. (2001) · Cited by 135
Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields
Kleinberg, J. M., & Eva Tardos, D. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sffcs.1999.814572 · Cited by 129
Comparative Evaluation of Approaches to Propositionalization
Krogel, M.-A., Rawles, S., Železný, F., Flach, P. A., Nada Lavrač, A., & Wrobel, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39917-9_14 · Cited by 125
Approximate Inference and Protein-Folding
Yanover, C., & Weiss, Y. (2002) · Cited by 106
Aggregation-based feature invention and relational concept classes
Perlich, C., & Provost, F. J. (2003) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956772 · Cited by 101
Propositionalisation and Aggregates
Knobbe, A., de Haas, M., & Siebes, A. P. J. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44794-6_23 · Cited by 94
Distribution-based aggregation for relational learning with identifier attributes
Perlich, C., & Provost, F. J. (2006) · Machine Learning · doi:10.1007/s10994-006-6064-1 · Cited by 94
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 77
Probabilistic Models of Text and Link Structure for Hypertext Classification
Getoor, L. C., Segal, E., Taskar, B., & Koller, D. (2001) · Cited by 76
Self-citation
Comparing the Mean Field Method and Belief Propagation for Approximate Inference in MRFs
Weiss, Y. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/1100.003.0019 · Cited by 74
Cautious Inference in Collective Classification
McDowell, L. K., Gupta, K. M., & Aha, D. W. (2007) · doi:10.21236/ada479429 · Cited by 68
Advanced Methods for Knowledge Discovery from Complex Data
Bandyopadhyay, S., Maulik, U., Holder, L. B., & Cook, D. J. (2005) · Springer eBooks · doi:10.1007/1-84628-284-5 · Cited by 67
Structural Logistic Regression for Link Analysis
Popescul, A., & Ungar, L. (2003) · ScholarlyCommons (University of Pennsylvania) · Cited by 60
Efficient inference with cardinality-based clique potentials
Gupta, R., Diwan, A. A., & Sarawagi, S. (2007) · International Conference on Machine Learning · doi:10.1145/1273496.1273538 · Cited by 52
Improving learning in networked data by combining explicit and mined links
Macskassy, S. A. (2007) · National Conference on Artificial Intelligence · Cited by 45
Multitarget-multisensor data association using the tree-reweighted max-product algorithm
Chen, L., Wainwright, M. J., Çetin, M., & Willsky, A. S. (2003) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.496939 · Cited by 43
Discriminative unsupervised learning of structured predictors
Xu, L., Wilkinson, D. F., Southey, F., & Schuurmans, D. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143977 · Cited by 39
Bias/Variance Analysis for Relational Domains
Neville, J., & Jensen, D. D. (2008) · Springer eBooks · doi:10.1007/978-3-540-78469-2_6 · Cited by 18
An Examination of Experimental Methodology for Classifiers of Relational Data
Gallagher, B. J., & Eliassi‐Rad, T. (2007) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2007.27 · Cited by 17
Self-citation
Learning and Inference in Massive Social Networks
Hill, S., Provost, F. J., & Volinsky, C. T. (2007) · Faculty Digital Archive (New York University Florence) · Cited by 16
Relaxation labeling of Markov random fields
Li, S. Z., Wang, H., & Petrou, M. (2002) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1994.576334 · Cited by 16
Suspicion scoring based on guilt-by-association, colle ctive inference, and focused data access 1
Macskassy, S. A., & Provost, F. J. (2005) · Cited by 13
Validity Estimates for Loopy Belief Propagation on Binary Real-world Networks
Mooij, J. M., & Kappen, H. J. (2004) · Radboud Repository (Radboud University) · Cited by 11
Twin Kernel Embedding with Back Constraints
Guo, Y., Kwan, P., & Gao, J. (2007) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw.2007.15 · Cited by 9
Leveraging Network Structure to Infer Missing Values in Relational Data
Gallagher, B. J., USDOE, & Eliassi‐Rad, T. (2007) · doi:10.2172/1082426 · Cited by 7
Self-citation

Flagged first, then by citations

1 of the 73 references couldn’t be matched to a known paper.

Research works printed but not linked: 7

Craven M., 1998, Proceedings of the Fifteenth National Conference on Artificial Intelligence
Lu Q., 2003, Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003)
Macskassy S., 2007, Proceedings of the Twenty‐Second Conference on Artificial Intelligence
Neville J., 2000, Learning Statistical Models from Relational Data: Papers from the AAAI Workshop
Taskar B., 2001, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence
Taskar B., 2003, Proceedings of the Seventeenth Annual Neural Information Processing Systems Conference
Yanover C., 2002, Proceedings of the Sixteenth Annual Neural Information Processing Systems Conference

Sorted by citations

A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
Geometric Deep Learning: Going beyond Euclidean data
Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., & Vandergheynst, P. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2693418 · Cited by 3,661
Fast Graph Representation Learning with PyTorch GeometricPreprint
Fey, M., & Lenssen, J. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02428 · Cited by 3,403
Deeper Insights Into Graph Convolutional Networks for Semi-Supervised Learning
Li, Q., Han, Z., & Wu, X.-M. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11604 · Cited by 2,872

See all 3,293

Authors: Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T.
Affiliations: University of Maryland, College Park (US)
ORCID: Bilgic, Mustafa
Gallagher, Brian
Eliassi‐Rad, Tina
Venue: AI Magazine
Publisher: Wiley
Published: 2008-09
Volume: 29
Issue: 3
Pages: 93-106
ISSN: 0738-4602 (ISSN-L)
2371-9621
DOI: 10.1609/aimag.v29i3.2157
OpenAlex: W2153959628
Cited by: 3,293
References: 73
Citations by year: 2026: 186 · 2025: 416 · 2024: 409 · 2023: 393 · 2022: 346 · 2021: 437 · 2020: 325 · 2019: 205 · 2018: 100 · 2017: 69 · 2016: 52 · 2015: 67 · 2014: 62 · 2013: 59 · 2012: 50
FWCI: 29.90
Type: journal article
Language: en
Open access: bronze
doi.org
Licence: onlinelibrary.wiley.com/termsAndConditions#vor (vor)
Locations: AI Magazine (publishedVersion)
University Libraries (University of Maryland) (submittedVersion)
Funders: National Science Foundation (0308030)
U.S. Department of Energy (DE‐AC52‐07NA27344)
Topics: Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
Keywords: collective classification, network data, node classification, inference algorithms, social networks, biological networks, communication networks, protein-protein interaction network, algorithm comparison

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

Collective Classification in Network Data

Abstract

Overview

Integrity signals

Verification

Claims the paper makes

Claims other papers make about this one

Self-check

Citations

Cites

Cited by

Related

Metadata

Record

About these checks