Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Inducing Features of Random Fields
IEEE Transactions on Pattern Analysis and Machine Intelligence
Wrappers for feature subset selection
Artificial Intelligence - Special issue on relevance
Enhanced hypertext categorization using hyperlinks
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Learning to extract symbolic knowledge from the World Wide Web
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A tutorial on learning with Bayesian networks
Learning in graphical models
Automating the Construction of Internet Portals with Machine Learning
Information Retrieval
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Linkage and Autocorrelation Cause Feature Selection Bias in Relational Learning
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Maximum Entropy Markov Models for Information Extraction and Segmentation
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Simple Estimators for Relational Bayesian Classifiers
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Learning relational probability trees
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Why collective inference improves relational classification
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Using relational knowledge discovery to prevent securities fraud
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Leveraging Relational Autocorrelation with Latent Group Models
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Machine Learning
Latent linkage semantic kernels for collective classification of link data
Journal of Intelligent Information Systems
Collective content selection for concept-to-text generation
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Relational Dependency Networks
The Journal of Machine Learning Research
Classification in Networked Data: A Toolkit and a Univariate Case Study
The Journal of Machine Learning Research
Handling Missing Values when Applying Classification Models
The Journal of Machine Learning Research
Exploiting Network Structure for Active Inference in Collective Classification
ICDMW '07 Proceedings of the Seventh IEEE International Conference on Data Mining Workshops
Effective label acquisition for collective classification
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Using ghost edges for classification in sparsely labeled networks
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
A bias/variance decomposition for models using collective inference
Machine Learning
Why Stacked Models Perform Effective Collective Classification
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
Improving learning in networked data by combining explicit and mined links
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Cautious inference in collective classification
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Exploiting causal independence in Bayesian network inference
Journal of Artificial Intelligence Research
Instance-based AMN classification for improved object recognition in 2D and 3D laser range data
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Empirical comparison of "hard" and "soft" label propagation for relational classification
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
SNAKDD'08 Proceedings of the Second international conference on Advances in social network mining and analysis
Loopy belief propagation for approximate inference: an empirical study
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Discriminative probabilistic models for relational data
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Turbo decoding as an instance of Pearl's “belief propagation” algorithm
IEEE Journal on Selected Areas in Communications
All liaisons are dangerous when all your friends are known to us
Proceedings of the 22nd ACM conference on Hypertext and hypermedia
Collective classification using heterogeneous classifiers
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
A nonparametric classification method based on K-associated graphs
Information Sciences: an International Journal
Transforming graph data for statistical relational learning
Journal of Artificial Intelligence Research
Collective Churn Prediction in Social Network
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
A few good predictions: selective node labeling in a social network
Proceedings of the 7th ACM international conference on Web search and data mining
Hi-index | 0.00 |
Many collective classification (CC) algorithms have been shown to increase accuracy when instances are interrelated. However, CC algorithms must be carefully applied because their use of estimated labels can in some cases decrease accuracy. In this article, we show that managing this label uncertainty through cautious algorithmic behavior is essential to achieving maximal, robust performance. First, we describe cautious inference and explain how four well-known families of CC algorithms can be parameterized to use varying degrees of such caution. Second, we introduce cautious learning and show how it can be used to improve the performance of almost any CC algorithm, with or without cautious inference. We then evaluate cautious inference and learning for the four collective inference families, with three local classifiers and a range of both synthetic and real-world data. We find that cautious learning and cautious inference typically outperform less cautious approaches. In addition, we identify the data characteristics that predict more substantial performance differences. Our results reveal that the degree of caution used usually has a larger impact on performance than the choice of the underlying inference algorithm. Together, these results identify the most appropriate CC algorithms to use for particular task characteristics and explain multiple conflicting findings from prior CC research.