{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:19:18Z","timestamp":1760170758466},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239625"},{"type":"electronic","value":"9783642239632"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23963-2_20","type":"book-chapter","created":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T21:29:02Z","timestamp":1317850142000},"page":"247-260","source":"Crossref","is-referenced-by-count":1,"title":["Patterns Discovery for Efficient Structured Probabilistic Inference"],"prefix":"10.1007","author":[{"given":"Lionel","family":"Torti","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Gonzales","sequence":"additional","affiliation":[]},{"given":"Pierre-Henri","family":"Wuillemin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Bangs\u00f8, O.: Object Oriented Bayesian Networks. Ph.D. thesis. Aalborg University (March 2004)","DOI":"10.1007\/978-3-540-25945-9_45"},{"key":"20_CR2","unstructured":"Bangs\u00f8, O., S\u00f8nderberg-Madsen, N., Jensen, F.: A bn framework for the construction of virtual agents with human-like behaviour. In: Proc. of PGM 2006 (2006)"},{"key":"20_CR3","unstructured":"Bangs\u00f8, O., Wuillemin, P.H.: Top-down construction and repetitive structures representation in Bayesian networks. In: Proc. of FLAIRS 2000, pp. 282\u2013286 (2000)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R. Dechter","year":"1999","unstructured":"Dechter, R.: Bucket elimination: A unifying framework for reasoning. Artificial Intelligence\u00a0113, 41\u201385 (1999)","journal-title":"Artificial Intelligence"},{"key":"20_CR5","unstructured":"Friedman, N., Getoor, L., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Proc. of IJCAI 1999 (1999)"},{"key":"20_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"20_CR7","series-title":"ch. 5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"An Introduction to Statistical Relational Learning","author":"L. Getoor","year":"2007","unstructured":"Getoor, L., Friedman, N., Koller, D., Pfeffer, A., Taskar, B.: Probabilistic relational models. In: Getoor, L., Taskar, B. (eds.) An Introduction to Statistical Relational Learning. ch. 5. MIT Press, Cambridge (2007)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Getoor, L., Koller, D., Taskar, B., Friedman, N.: Learning probabilistic relational models with structural uncertainty. In: ICML 2000 Workshop on Attribute-Value and Relational Learning: Crossing the Boundaries (2000)","DOI":"10.1007\/978-3-662-04599-2_13"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.: Approximations of weighted independent set and hereditary subset problems. Journal of Graph Algorithms and Applications (2000)","DOI":"10.7155\/jgaa.00020"},{"key":"20_CR10","unstructured":"Heckerman, D., Meek, C., Koller, D.: Probabilistic models for relational data. Tech. rep., WA: Microsoft Corporation, Redmond (2004)"},{"key":"20_CR11","unstructured":"Ide, J.S., Cozman, F.G., Ramos, F.T.: Generating random Bayesian networks with constraints on induced width. In: Proc. of ECAI 2004, pp. 323\u2013327 (2004)"},{"key":"20_CR12","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: A general framework for mining frequent subgraphs from labeled graphs. Fundamenta Informaticae (2005)"},{"key":"20_CR13","unstructured":"Jaeger, M.: Relational Bayesian networks. In: Proc. of UAI 1997 (1997)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Kersting, K., Raedt, L.D.: Bayesian logic programs. Technical report no. 151, Institute for Computer Science, University of Freiburg, Germany (April 2001)","DOI":"10.1007\/3-540-44797-0_9"},{"key":"20_CR15","unstructured":"Koller, D., Pfeffer, A.: Object-oriented Bayesian networks. In: Proc. of AAAI 1997, pp. 302\u2013313 (1997)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. of ICDM 2001 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"1\u20132","key":"20_CR17","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0004-3702(99)00062-4","volume":"113","author":"A. Madsen","year":"1999","unstructured":"Madsen, A., Jensen, F.: LAZY propagation: A junction tree inference algorithm based on lazy inference. Artificial Intelligence\u00a0113(1\u20132), 203\u2013245 (1999)","journal-title":"Artificial Intelligence"},{"key":"20_CR18","unstructured":"Mahoney, S., Laskey, K.: Network engineering for complex belief networks. In: Proc. of UAI 1996 (1996)"},{"key":"20_CR19","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)"},{"key":"20_CR20","unstructured":"Pfeffer, A., Koller, D., Milch, B., Takusagawa, K.: SPOOK: A system for probabilistic object-oriented knowledge representation. In: Proc. of UAI 1999 (1999)"},{"key":"20_CR21","unstructured":"Pfeffer, A.: Probabilistic Reasoning for Complex Systems. Ph.D. thesis. Stanford University (2000)"},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"Rose, D., Lueker, G., Tarjan, R.: Algorithmic aspects of vertex elimination on graphs. SIAM J. on Computing\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J. on Computing"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Rose, D.: Triangulated graphs and the elimination process. J. Math. Analysis and Applications (1970)","DOI":"10.1016\/0022-247X(70)90282-9"},{"key":"20_CR24","unstructured":"Torti, L., Wuillemin, P.H.: Structured value elimination with d-separation analysis. In: Proc. of FLAIRS 2010, pp. 122\u2013127 (2010)"},{"key":"20_CR25","unstructured":"Torti, L., Wuillemin, P.H., Gonzales, C.: Reinforcing the object-oriented aspect of probabilistic relational models. In: Proc. of PGM 2010 (2010)"},{"key":"20_CR26","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Proc. of ICDM 2002 (2002)"}],"container-title":["Lecture Notes in Computer Science","Scalable Uncertainty Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23963-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:40:14Z","timestamp":1560728414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23963-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239625","9783642239632"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23963-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}