Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Relational learning with statistical predicate invention: better models for hypertext
Machine Learning - Special issue on inducive logic programming
Improving Text Classification by Shrinkage in a Hierarchy of Classes
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Information-theoretic co-clustering
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Cluster-based concept invention for statistical relational learning
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Learning Hidden Variable Networks: The Information Bottleneck Approach
The Journal of Machine Learning Research
Learning the structure of Markov logic networks
ICML '05 Proceedings of the 22nd international conference on Machine learning
Dirichlet enhanced relational learning
ICML '05 Proceedings of the 22nd international conference on Machine learning
Leveraging Relational Autocorrelation with Latent Group Models
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Machine Learning
Spectral clustering for multi-type relational data
ICML '06 Proceedings of the 23rd international conference on Machine learning
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Structured machine learning: the next ten years
Machine Learning
Extracting Semantic Networks from Text Via Relational Clustering
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Just Add Weights: Markov Logic for the Semantic Web
Uncertainty Reasoning for the Semantic Web I
StatSnowball: a statistical approach to extracting entity relationships
Proceedings of the 18th international conference on World wide web
Deep transfer via second-order Markov logic
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Learning Markov logic network structure via hypergraph lifting
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Unsupervised methods for determining object and relation synonyms on the web
Journal of Artificial Intelligence Research
Extracting ontology concept hierarchies from text using Markov logic
Proceedings of the 2010 ACM Symposium on Applied Computing
Probabilistic inductive logic programming
Relational network-service clustering analysis with set evidences
Proceedings of the 3rd ACM workshop on Artificial intelligence and security
Generative Structure Learning for Markov Logic Networks
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Factorizing YAGO: scalable machine learning for linked data
Proceedings of the 21st international conference on World Wide Web
Neural Computation
Location-based reasoning about complex multi-agent behavior
Journal of Artificial Intelligence Research
Transforming graph data for statistical relational learning
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We propose statistical predicate invention as a key problem for statistical relational learning. SPI is the problem of discovering new concepts, properties and relations in structured data, and generalizes hidden variable discovery in statistical models and predicate invention in ILP. We propose an initial model for SPI based on second-order Markov logic, in which predicates as well as arguments can be variables, and the domain of discourse is not fully known in advance. Our approach iteratively refines clusters of symbols based on the clusters of symbols they appear in atoms with (e.g., it clusters relations by the clusters of the objects they relate). Since different clusterings are better for predicting different subsets of the atoms, we allow multiple cross-cutting clusterings. We show that this approach outperforms Markov logic structure learning and the recently introduced infinite relational model on a number of relational datasets.