{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:07:07Z","timestamp":1743037627422,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035239"},{"type":"electronic","value":"9783319035246"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03524-6_13","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:35:00Z","timestamp":1386592500000},"page":"145-156","source":"Crossref","is-referenced-by-count":0,"title":["Abstraction in Markov Networks"],"prefix":"10.1007","author":[{"given":"Lorenza","family":"Saitta","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"053039","DOI":"10.1088\/1367-2630\/10\/5\/053039","volume":"10","author":"A. Arenas","year":"2008","unstructured":"Arenas, A., Fernandez, A., Gomez, S.: Analysis of the structure of complex networks at different resolution levels. New Journal of Physics 10, 053039 (2008)","journal-title":"New Journal of Physics"},{"key":"13_CR2","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer (2006)"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1613\/jair.2293","volume":"30","author":"V. Bulitko","year":"2007","unstructured":"Bulitko, V., Sturtevant, N., Lu, J., Yau, T.: Graph abstraction in real-time heuristic search. Journal of Artificial Intelligence Research\u00a030, 51\u2013100 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A. Clauset","year":"2008","unstructured":"Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature\u00a0453, 98\u2013101 (2008)","journal-title":"Nature"},{"key":"13_CR5","unstructured":"Epstein, S.L., Li, X.: Cluster graphs as abstractions for constraint satisfaction problems. In: Proc. Symposium on Abstraction, Reformulation and Approximation, Lake Arrowhead, CA, pp. 58\u201365 (2009)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(95)00111-5","volume":"85","author":"R.C. Holte","year":"1996","unstructured":"Holte, R.C., Mkadmi, T., Zimmer, R.M., MacDonald, A.J.: Speeding up problem solving by abstraction: A graph oriented approach. Artificial Intelligence\u00a085, 321\u2013361 (1996)","journal-title":"Artificial Intelligence"},{"key":"13_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-44914-0_27","volume-title":"Abstraction, Reformulation, and Approximation","author":"C. Lecoutre","year":"2000","unstructured":"Lecoutre, C., Merchez, S., Boussemart, F., Gr\u00e9goire, \u00c9.: A CSP Abstraction Framework. In: Choueiry, B.Y., Walsh, T. (eds.) SARA 2000. LNCS (LNAI), vol.\u00a01864, pp. 326\u2013327. Springer, Heidelberg (2000)"},{"key":"13_CR8","unstructured":"Poon, H., Domingos, P.: Sound and efficient inference with probabilistic and deterministic dependencies. In: Proc. of the National Conference on Artificial Intelligence, Boston, MA, pp. 458\u2013463 (2006)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M. Richardson","year":"2006","unstructured":"Richardson, M., Domingos, P.: Markov logic networks. Machine Learning\u00a062, 107\u2013136 (2006)","journal-title":"Machine Learning"},{"key":"13_CR10","unstructured":"Saitta, L., Henegar, C., Zucker, J.D.: Abstracting complex interaction networks. In: Proc. Symposium on Abstraction, Reformulation and Approximation, Lake Arrowhead, CA, pp. 190\u2013193 (2009)"},{"key":"13_CR11","unstructured":"Shavlik, J., Natarajan, S.: Speeding up inference in Markov logic networks by preprocessing to reduce the size of the resulting grounded network. In: Proc. Intern. Joint Conf. on Artificial Intelligence, Pasadena, CA, pp. 1951\u20131956 (2009)"},{"key":"13_CR12","unstructured":"Wiegerinck, W.: Variational approximations between mean field theory and the junction tree algorithm. In: Proc. of the 16th Conf. on Uncertainty in Artifical Intelligence, Stanford, CA, USA, pp. 626\u2013633 (2000)"},{"key":"13_CR13","unstructured":"Saitta, L., Vrain, C.: Abstracting Markov networks. Presentation to the Symposium on Abstraction, Reformulation and Approximation, Cardona, Spain (2010)"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, P.: On Random Graphs. Publ. Math. Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"159","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0159, 509\u2013512 (1999)","journal-title":"Science"},{"key":"13_CR17","first-page":"43","volume":"45","author":"J. Xie","year":"2013","unstructured":"Xie, J., Kelley, S., Szymanski, B.K.: Overlapping Community Detection in Networks: the State of the Art and Comparative Study. ACM Computing Surveys 45, Article 43 (2013)","journal-title":"ACM Computing Surveys"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Krzakala, F., M\u00e9zard, M., Sausset, L., Sun, Y., Zdeborova, L.: Probabilistic Reconstruction in Compressed Sensing: Algorithms, Phase Diagrams, and Threshold Achieving Matrices. J. Stat. Mech., P08009 (2012)","DOI":"10.1088\/1742-5468\/2012\/08\/P08009"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Barbier, J., M\u00e9zard, Zdeborova, L.: Compressed Sensing of Approximately-Sparse Signals: Phase Transitions and Optimal Reconstruction. In: Proc. of the 50th Annual Conf. on Communication, Control, and Computing, Allerton, USA, pp. 800\u2013807 (2012)","DOI":"10.1109\/Allerton.2012.6483300"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2013: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03524-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T19:23:15Z","timestamp":1675797795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-03524-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035239","9783319035246"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03524-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}