Statistical relational learning

Statistical relational learning (SRL) is a subdiscipline of artificial intelligence and machine learning that is concerned with domain models that exhibit both uncertainty (which can be dealt with using statistical methods) and complex, relational structure. [1] [2] Note that SRL is sometimes called Relational Machine Learning (RML) in the literature. Typically, the knowledge representation formalisms developed in SRL use (a subset of) first-order logic to describe relational properties of a domain in a general manner (universal quantification) and draw upon probabilistic graphical models (such as Bayesian networks or Markov networks) to model the uncertainty; some also build upon the methods of inductive logic programming. Significant contributions to the field have been made since the late 1990s. [1]

As is evident from the characterization above, the field is not strictly limited to learning aspects; it is equally concerned with reasoning (specifically probabilistic inference) and knowledge representation. Therefore, alternative terms that reflect the main foci of the field include statistical relational learning and reasoning (emphasizing the importance of reasoning) and first-order probabilistic languages (emphasizing the key properties of the languages with which models are represented).

Canonical tasks

A number of canonical tasks are associated with statistical relational learning, the most common ones being [3].

  • collective classification, i.e. the (simultaneous) prediction of the class of several objects given objects' attributes and their relations
  • link prediction, i.e. predicting whether or not two or more objects are related
  • link-based clustering, i.e. the grouping of similar objects, where similarity is determined according to the links of an object, and the related task of collaborative filtering, i.e. the filtering for information that is relevant to an entity (where a piece of information is considered relevant to an entity if it is known to be relevant to a similar entity).
  • social network modelling
  • object identification/entity resolution/record linkage, i.e. the identification of equivalent entries in two or more separate databases/datasets

Representation formalisms

One of the fundamental design goals of the representation formalisms developed in SRL is to abstract away from concrete entities and to represent instead general principles that are intended to be universally applicable. Since there are countless ways in which such principles can be represented, many representation formalisms have been proposed in recent years.[1] In the following, some of the more common ones are listed in alphabetical order:

gollark: If I remember right Go strings are just byte sequences with no guarantee of being valid UTF-8, but all the functions working on them just assume they are.
gollark: Oh, and the strings are terrible.
gollark: Also, channels are not a particularly good primitive for synchronization.
gollark: Also, the implicit interfaces are terrible.
gollark: - lacking in generics - you have to use `interface{}`- public/private visibility is controlled by *capitalization* of all things- weird bodgey specialcasing instead of good generalizable solutions- you literally cannot express a `max` function which returns the largest of two of any type of number in a well-typed way

See also

Resources
  • Brian Milch, and Stuart J. Russell: First-Order Probabilistic Languages: Into the Unknown, Inductive Logic Programming, volume 4455 of Lecture Notes in Computer Science, page 10–24. Springer, 2006
  • Rodrigo de Salvo Braz, Eyal Amir, and Dan Roth: A Survey of First-Order Probabilistic Models, Innovations in Bayesian Networks, volume 156 of Studies in Computational Intelligence, Springer, 2008
  • Hassan Khosravi and Bahareh Bina: A Survey on Statistical Relational Learning, Advances in Artificial Intelligence, Lecture Notes in Computer Science, Volume 6085/2010, 256–268, Springer, 2010
  • Ryan A. Rossi, Luke K. McDowell, David W. Aha, and Jennifer Neville: Transforming Graph Data for Statistical Relational Learning, Journal of Artificial Intelligence Research (JAIR), Volume 45, page 363-441, 2012
  • Luc De Raedt, Kristian Kersting, Sriraam Natarajan and David Poole, "Statistical Relational Artificial Intelligence: Logic, Probability, and Computation", Synthesis Lectures on Artificial Intelligence and Machine Learning" March 2016 ISBN 9781627058414.

References
  1. Getoor, Lise; Taskar, Ben (2007). Introduction to Statistical Relational Learning. MIT Press. ISBN 978-0262072885.
  2. Ryan A. Rossi, Luke K. McDowell, David W. Aha, and Jennifer Neville, "Transforming Graph Data for Statistical Relational Learning." Journal of Artificial Intelligence Research (JAIR), Volume 45 (2012), pp. 363-441.
  3. Matthew Richardson and Pedro Domingos, "Markov Logic Networks." Machine Learning, 62 (2006), pp. 107–136.
  4. Friedman N, Getoor L, Koller D, Pfeffer A. (1999) "Learning probabilistic relational models". In: International joint conferences on artificial intelligence, 1300–09
  5. Teodor Sommestad, Mathias Ekstedt, Pontus Johnson (2010) "A probabilistic relational model for security risk analysis", Computers & Security, 29 (6), 659-679 doi:10.1016/j.cose.2010.02.002
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.