Skip to main content

2018 | OriginalPaper | Buchkapitel

Counting and Conjunctive Queries in the Lifted Junction Tree Algorithm

verfasst von : Tanya Braun, Ralf Möller

Erschienen in: Graph Structures for Knowledge Representation and Reasoning

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Standard approaches for inference in probabilistic formalisms with first-order constructs include lifted variable elimination (LVE) for single queries. To handle multiple queries efficiently, the lifted junction tree algorithm (LJT) uses a first-order cluster representation of a knowledge base and LVE in its computations. We extend LJT with a full formal specification of its algorithm steps incorporating (i) the lifting tool of counting and (ii) answering of conjunctive queries. Given multiple queries, e.g., in machine learning applications, our approach enables us to compute answers faster than the current LJT and existing approaches tailored for single queries.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Ahmadi, B., Kersting, K., Mladenov, M., Natarajan, S.: Exploiting symmetries for scaling loopy belief propagation and relational training. Mach. Learn. 92(1), 91–132 (2013)MathSciNetCrossRefMATH Ahmadi, B., Kersting, K., Mladenov, M., Natarajan, S.: Exploiting symmetries for scaling loopy belief propagation and relational training. Mach. Learn. 92(1), 91–132 (2013)MathSciNetCrossRefMATH
2.
Zurück zum Zitat Bellodi, E., Lamma, E., Riguzzi, F., Costa, V.S., Zese, R.: Lifted variable elimination for probabilistic logic programming. Theory Pract. Log. Program. 14(4–5), 681–695 (2014)CrossRefMATH Bellodi, E., Lamma, E., Riguzzi, F., Costa, V.S., Zese, R.: Lifted variable elimination for probabilistic logic programming. Theory Pract. Log. Program. 14(4–5), 681–695 (2014)CrossRefMATH
5.
Zurück zum Zitat van den Broeck, G.: Lifted inference and learning in statistical relational models. Ph.D. thesis, KU Leuven (2013) van den Broeck, G.: Lifted inference and learning in statistical relational models. Ph.D. thesis, KU Leuven (2013)
6.
Zurück zum Zitat van den Broeck, G., Niepert, M.: Lifted probabilistic inference for asymmetric graphical models. In: AAAI 2015 Proceedings of the 29th Conference on Artificial Intelligence, pp. 3599–3605 (2015) van den Broeck, G., Niepert, M.: Lifted probabilistic inference for asymmetric graphical models. In: AAAI 2015 Proceedings of the 29th Conference on Artificial Intelligence, pp. 3599–3605 (2015)
7.
Zurück zum Zitat Chavira, M., Darwiche, A.: Compiling Bayesian networks using variable elimination. In: IJCAI 2007 Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 2443–2449 (2007) Chavira, M., Darwiche, A.: Compiling Bayesian networks using variable elimination. In: IJCAI 2007 Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 2443–2449 (2007)
8.
Zurück zum Zitat Choi, J., Amir, E., Hill, D.J.: Lifted inference for relational continuous models. In: UAI 2010 Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, pp. 13–18 (2010) Choi, J., Amir, E., Hill, D.J.: Lifted inference for relational continuous models. In: UAI 2010 Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, pp. 13–18 (2010)
10.
Zurück zum Zitat Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press, Cambridge (2009)CrossRefMATH Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press, Cambridge (2009)CrossRefMATH
11.
Zurück zum Zitat Das, M., Wu, Y., Khot, T., Kersting, K., Natarajan, S.: Scaling lifted probabilistic inference and learning via graph databases. In: Proceedings of the SIAM International Conference on Data Mining, pp. 738–746 (2016) Das, M., Wu, Y., Khot, T., Kersting, K., Natarajan, S.: Scaling lifted probabilistic inference and learning via graph databases. In: Proceedings of the SIAM International Conference on Data Mining, pp. 738–746 (2016)
12.
Zurück zum Zitat Gogate, V., Domingos, P.: Exploiting logical structure in lifted probabilistic inference. In: Working Note of the Workshop on Statistical Relational Artificial Intelligence at the 24th Conference on Artificial Intelligence, pp. 19–25 (2010) Gogate, V., Domingos, P.: Exploiting logical structure in lifted probabilistic inference. In: Working Note of the Workshop on Statistical Relational Artificial Intelligence at the 24th Conference on Artificial Intelligence, pp. 19–25 (2010)
13.
Zurück zum Zitat Gogate, V., Domingos, P.: Probabilistic theorem proving. In: UAI 2011 Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, pp. 256–265 (2011) Gogate, V., Domingos, P.: Probabilistic theorem proving. In: UAI 2011 Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, pp. 256–265 (2011)
14.
Zurück zum Zitat Jensen, F.V., Lauritzen, S.L., Olesen, K.G.: Bayesian updating in recursive graphical models by local computations. Comput. Stat. Q. 4, 269–282 (1990)MATH Jensen, F.V., Lauritzen, S.L., Olesen, K.G.: Bayesian updating in recursive graphical models by local computations. Comput. Stat. Q. 4, 269–282 (1990)MATH
15.
Zurück zum Zitat Kersting, K., Ahmadi, B., Natarajan, S.: Counting belief propagation. In: UAI 2009 Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, pp. 277–284 (2009) Kersting, K., Ahmadi, B., Natarajan, S.: Counting belief propagation. In: UAI 2009 Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, pp. 277–284 (2009)
16.
Zurück zum Zitat Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. The MIT Press, Cambridge (2009)MATH Koller, D., Friedman, N.: Probabilistic Graphical Models: Principles and Techniques. The MIT Press, Cambridge (2009)MATH
17.
Zurück zum Zitat Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. Royal Stat. Soc. Ser. B Methodol. 50, 157–224 (1988)MathSciNetMATH Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. Royal Stat. Soc. Ser. B Methodol. 50, 157–224 (1988)MathSciNetMATH
18.
Zurück zum Zitat Milch, B., Zettelmeyer, L.S., Kersting, K., Haimes, M., Kaelbling, L.P.: Lifted probabilistic inference with counting formulas. In: AAAI 2008 Proceedings of the 23rd Conference on Artificial Intelligence, pp. 1062–1068 (2008) Milch, B., Zettelmeyer, L.S., Kersting, K., Haimes, M., Kaelbling, L.P.: Lifted probabilistic inference with counting formulas. In: AAAI 2008 Proceedings of the 23rd Conference on Artificial Intelligence, pp. 1062–1068 (2008)
19.
Zurück zum Zitat Poole, D., Zhang, N.L.: Exploiting contextual independence in probabilistic inference. J. Artif. Intell. 18, 263–313 (2003)MathSciNetMATH Poole, D., Zhang, N.L.: Exploiting contextual independence in probabilistic inference. J. Artif. Intell. 18, 263–313 (2003)MathSciNetMATH
20.
Zurück zum Zitat de Salvo Braz, R., Amir, E., Roth, D.: Lifted first-order probabilistic inference. In: IJCAI 2005 Proceedings of the 19th International Joint Conference on Artificial Intelligence (2005) de Salvo Braz, R., Amir, E., Roth, D.: Lifted first-order probabilistic inference. In: IJCAI 2005 Proceedings of the 19th International Joint Conference on Artificial Intelligence (2005)
22.
Zurück zum Zitat Shenoy, P.P., Shafer, G.R.: Axioms for probability and belief-function propagation. Uncertain. Artif. Intell. 4(9), 169–198 (1990)MathSciNetCrossRef Shenoy, P.P., Shafer, G.R.: Axioms for probability and belief-function propagation. Uncertain. Artif. Intell. 4(9), 169–198 (1990)MathSciNetCrossRef
23.
Zurück zum Zitat Singla, P., Domingos, P.: Lifted first-order belief propagation. In: AAAI 2008 Proceedings of the 23rd Conference on Artificial Intelligence, pp. 1094–1099 (2008) Singla, P., Domingos, P.: Lifted first-order belief propagation. In: AAAI 2008 Proceedings of the 23rd Conference on Artificial Intelligence, pp. 1094–1099 (2008)
24.
Zurück zum Zitat Taghipour, N.: Lifted probabilistic inference by variable elimination. Ph.D. thesis, KU Leuven (2013) Taghipour, N.: Lifted probabilistic inference by variable elimination. Ph.D. thesis, KU Leuven (2013)
25.
Zurück zum Zitat Taghipour, N., Davis, J., Blockeel, H.: First-order decomposition trees. In: Advances in Neural Information Processing Systems 26, pp. 1052–1060. Curran Associates, Inc. (2013) Taghipour, N., Davis, J., Blockeel, H.: First-order decomposition trees. In: Advances in Neural Information Processing Systems 26, pp. 1052–1060. Curran Associates, Inc. (2013)
26.
Zurück zum Zitat Taghipour, N., Fierens, D., Davis, J., Blockeel, H.: Lifted variable elimination: decoupling the operators from the constraint language. J. Artif. Intell. Res. 47(1), 393–439 (2013)MathSciNetMATH Taghipour, N., Fierens, D., Davis, J., Blockeel, H.: Lifted variable elimination: decoupling the operators from the constraint language. J. Artif. Intell. Res. 47(1), 393–439 (2013)MathSciNetMATH
27.
Zurück zum Zitat Vlasselaer, J., Meert, W., van den Broeck, G., Raedt, L.D.: Exploiting local and repeated structure in dynamic Baysian networks. Artif. Intell. 232, 43–53 (2016)CrossRefMATH Vlasselaer, J., Meert, W., van den Broeck, G., Raedt, L.D.: Exploiting local and repeated structure in dynamic Baysian networks. Artif. Intell. 232, 43–53 (2016)CrossRefMATH
28.
Zurück zum Zitat Zhang, N.L., Poole, D.: A simple approach to Bayesian network computations. In: Proceedings of the 10th Canadian Conference on Artificial Intelligence, pp. 171–178 (1994) Zhang, N.L., Poole, D.: A simple approach to Bayesian network computations. In: Proceedings of the 10th Canadian Conference on Artificial Intelligence, pp. 171–178 (1994)
Metadaten
Titel
Counting and Conjunctive Queries in the Lifted Junction Tree Algorithm
verfasst von
Tanya Braun
Ralf Möller
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-78102-0_3