{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:21Z","timestamp":1740122361987,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T00:00:00Z","timestamp":1520294400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Research Fund KU Leuven","award":["OT\/11\/051"],"award-info":[{"award-number":["OT\/11\/051"]}]},{"name":"FWO","award":["G.0356.12"],"award-info":[{"award-number":["G.0356.12"]}]},{"name":"ERC-StG","award":["240186"],"award-info":[{"award-number":["240186"]}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P2-0103"],"award-info":[{"award-number":["P2-0103"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10618-018-0553-2","type":"journal-article","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T07:47:59Z","timestamp":1520322479000},"page":"913-948","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model"],"prefix":"10.1007","volume":"32","author":[{"given":"Irma","family":"Ravkic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"\u017dnidar\u0161i\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesse","family":"Davis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,6]]},"reference":[{"key":"553_CR1","volume-title":"Predictably irrational: the hidden forces that shape our decisions","author":"D Ariely","year":"2008","unstructured":"Ariely D (2008) Predictably irrational: the hidden forces that shape our decisions. Harper Collins, New York"},{"issue":"5439","key":"553_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barabasi","year":"1999","unstructured":"Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509\u2013512","journal-title":"Science"},{"issue":"3","key":"553_CR3","doi-asserted-by":"publisher","first-page":"036107","DOI":"10.1103\/PhysRevE.76.036107","volume":"76","author":"K Baskerville","year":"2007","unstructured":"Baskerville K, Grassberger P, Paczuski M (2007) Graph animals, subgraph sampling, and motif search in large networks. Phys Rev E 76(3):036107","journal-title":"Phys Rev E"},{"key":"553_CR4","doi-asserted-by":"crossref","unstructured":"Bordino I, Donato D, Gionis A, Leonardi S (2008) Mining large networks with subgraph counting. In: Proceedings of the 2008 IEEE international conference on data mining (ICDM), pp 737\u2013742","DOI":"10.1109\/ICDM.2008.109"},{"issue":"10","key":"553_CR5","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"L Cordella","year":"2004","unstructured":"Cordella L, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"553_CR6","doi-asserted-by":"crossref","unstructured":"Das M, Wu Y, Khot T, Kersting K, Natarajan S (2016) Scaling lifted probabilistic inference and learning via graph databases. In: Proceedings of the 2016 SIAM international conference on data mining (SDM), pp 738\u2013746","DOI":"10.1137\/1.9781611974348.83"},{"key":"553_CR7","doi-asserted-by":"crossref","unstructured":"Davis J, Domingos P (2009) Deep transfer via second-order Markov logic. In: Proceedings of the 26th international conference on machine learning (ICML), pp 217\u2013224","DOI":"10.1145\/1553374.1553402"},{"key":"553_CR8","doi-asserted-by":"crossref","unstructured":"Davis J, Burnside E, Dutra IC, Page D, Costa VS (2005) An integrated approach to learning Bayesian networks of rules. In: Proceedings of the 16th European conference on machine learning (ECML), pp 84\u201395","DOI":"10.1007\/11564096_13"},{"issue":"1","key":"553_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1186\/1471-2105-11-96","volume":"11","author":"R Natale Di","year":"2010","unstructured":"Di Natale R, Ferro A, Giugno R, Mongiovi M, Pulvirenti A, Shasha D (2010) SING: subgraph search in non-homogeneous graphs. BMC Bioinform 11(1):96","journal-title":"BMC Bioinform"},{"key":"553_CR10","unstructured":"Fierens D, Blockeel H, Ramon J, Bruynooghe M (2004) Logical Bayesian networks. In: Proceedings of the 3rd international workshop on multi-relational data mining (MRDM), pp 19\u201330"},{"key":"553_CR11","unstructured":"Friedman N, Goldzsmidt M (1996) Learning Bayesian networks with local structure. In: Proceedings of the 12th annual conference on uncertainty in artificial intelligence (UAI), pp 252\u2013262"},{"issue":"6","key":"553_CR12","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1017\/S0963548314000339","volume":"23","author":"M F\u00fcrer","year":"2014","unstructured":"F\u00fcrer M, Kasiviswanathan SP (2014) Approximately counting embeddings into random graphs. Combin Probab Comput 23(6):1028\u20131056","journal-title":"Combin Probab Comput"},{"key":"553_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to statistical relational learning","author":"L Getoor","year":"2007","unstructured":"Getoor L, Taskar B (2007) Introduction to statistical relational learning. MIT Press, Cambridge"},{"key":"553_CR14","doi-asserted-by":"crossref","unstructured":"Giugno R, Shasha D (2002) GraphGrep: A fast and universal method for querying graphs. In: Proceedings of the 16th international conference on pattern recognition (ICPR), pp 112\u2013115","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"553_CR15","doi-asserted-by":"crossref","unstructured":"Huynh T, Mooney R (2008) Discriminative structure and parameter learning for Markov logic networks. In: Proceedings of the 25th international conference on machine learning, pp 416\u2013423","DOI":"10.1145\/1390156.1390209"},{"issue":"3","key":"553_CR16","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A Inokuchi","year":"2003","unstructured":"Inokuchi A, Washio T, Motoda H (2003) Complete mining of frequent patterns from graphs: mining graph data. Mach Learn 50(3):321\u2013354","journal-title":"Mach Learn"},{"key":"553_CR17","doi-asserted-by":"crossref","unstructured":"Jowhari H, Ghodsi M (2005) New streaming algorithms for counting triangles in graphs. In: Proceedings of the 11th international conference on computing and combinatorics (COCOON), pp 710\u2013716","DOI":"10.1007\/11533719_72"},{"issue":"11","key":"553_CR18","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan N, Itzkovitz S, Milo R, Alon U (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11):1746\u20131758","journal-title":"Bioinformatics"},{"key":"553_CR19","unstructured":"Kersting K, De\u00a0Raedt L, Kramer S (2000) Interpreting Bayesian logic programs. In: Proceedings of the AAAI-2000 workshop on learning statistical models from relational data, pp 29\u201335"},{"key":"553_CR20","doi-asserted-by":"crossref","unstructured":"Kok S, Domingos P (2005) Learning the structure of Markov logic networks. In: Proceedings of the 22nd international conference on machine learning (ICML), pp 441\u2013448","DOI":"10.1145\/1102351.1102407"},{"key":"553_CR21","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C (2006) Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 631\u2013636","DOI":"10.1145\/1150402.1150479"},{"issue":"1","key":"553_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1093\/nar\/28.1.37","volume":"28","author":"HW Mewes","year":"2000","unstructured":"Mewes HW, Frishman D, Gruber C, Geier B, Haase D, Kaps A, Lemcke K, Mannhaupt G, Pfeiffer F, Sch\u00fcller C, Stocker S, Weil B (2000) MIPS: a database for genomes and protein sequences. Nucleic Acids Res 28(1):37\u201340","journal-title":"Nucleic Acids Res"},{"issue":"2","key":"553_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj N (2007) Biological network comparison using graphlet degree distribution. Bioinformatics 23(2):177\u2013183","journal-title":"Bioinformatics"},{"issue":"2\u20133","key":"553_CR24","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10994-015-5483-2","volume":"100","author":"I Ravkic","year":"2015","unstructured":"Ravkic I, Ramon J, Davis J (2015) Learning relational dependency networks in hybrid domains. Mach Learn 100(2\u20133):217\u2013254","journal-title":"Mach Learn"},{"key":"553_CR25","unstructured":"Richards BL, Mooney RJ (1992) Learning relations by pathfinding. In: Proceedings of the 10th national conference on artificial intelligence (AAAI), pp 50\u201355"},{"issue":"1\u20132","key":"553_CR26","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 (2006) Markov logic networks. Mach Learn 62(1\u20132):107\u2013136","journal-title":"Mach Learn"},{"key":"553_CR27","unstructured":"Shervashidze N, Vishwanathan S, Petri T, Mehlhorn K, Borgwardt K (2009) Efficient graphlet kernels for large graph comparison. In: Proceedings of the 12th international conference on artificial intelligence and statistics (AISTATS), pp 488\u2013495"},{"key":"553_CR28","doi-asserted-by":"crossref","unstructured":"Tang J, Zhang J, Yao L, Li J, Zhang L, Su Z (2008) Arnetminer: Extraction and mining of academic social networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 990\u2013998","DOI":"10.1145\/1401890.1402008"},{"issue":"1","key":"553_CR29","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23(1):31\u201342","journal-title":"J ACM"},{"key":"553_CR30","doi-asserted-by":"crossref","unstructured":"Van\u00a0Haaren J, Kolobov A, Davis J (2015) TODTLER: two-order-deep transfer learning. In: Proceedings of the 29th AAAI conference on artificial intelligence, pp 3007\u20133015","DOI":"10.1609\/aaai.v29i1.9624"},{"key":"553_CR31","doi-asserted-by":"crossref","unstructured":"Venugopal D, Sarkhel S, Gogate V (2015) Just count the satisfied groundings: scalable local-search and sampling based inference in MLNs. In: Proceedings of the 29th AAAI conference on artificial intelligence, pp 3606\u20133612","DOI":"10.1609\/aaai.v29i1.9676"},{"key":"553_CR32","doi-asserted-by":"crossref","unstructured":"Wernicke S (2005) A faster algorithm for detecting network motifs. In: Proceedings of the 5th international workshop on algorithms in bioinformatics (WABI), pp 165\u2013177","DOI":"10.1007\/11557067_14"},{"key":"553_CR33","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE international conference on data mining (ICDM), pp 721\u2013724"},{"key":"553_CR34","doi-asserted-by":"crossref","unstructured":"Zou R, Holder LB (2010) Frequent subgraph mining on a single large graph using sampling techniques. In: Proceedings of the 8th workshop on mining and learning with graphs (MLG), pp 171\u2013178","DOI":"10.1145\/1830252.1830274"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-018-0553-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0553-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0553-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T08:57:39Z","timestamp":1660553859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-018-0553-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,6]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["553"],"URL":"https:\/\/doi.org\/10.1007\/s10618-018-0553-2","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2018,3,6]]},"assertion":[{"value":"18 April 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}