{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:23:45Z","timestamp":1777695825264,"version":"3.51.4"},"reference-count":42,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2019,11,8]]},"DOI":"10.3233\/ida-184339","type":"journal-article","created":{"date-parts":[[2019,11,13]],"date-time":"2019-11-13T08:15:30Z","timestamp":1573632930000},"page":"1299-1312","source":"Crossref","is-referenced-by-count":2,"title":["Summarizing significant subgraphs by probabilistic logic programming"],"prefix":"10.1177","volume":"23","author":[{"given":"Elena","family":"Bellodi","sequence":"first","affiliation":[{"name":"Department of Engineering, University of Ferrara, Ferrara, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ken","family":"Satoh","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahito","family":"Sugiyama","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"},{"name":"JST, PRESTO"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-184339_ref1","doi-asserted-by":"crossref","unstructured":"C.C. Aggarwal and J. Han, editors. Frequent Pattern Mining, Springer, 2014.","DOI":"10.1007\/978-3-319-07821-2"},{"key":"10.3233\/IDA-184339_ref2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imieli\u0144ski and A. Swami, Mining association rules between sets of items in large databases, In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 1993, pp. 207\u2013216.","DOI":"10.1145\/170036.170072"},{"key":"10.3233\/IDA-184339_ref3","unstructured":"R. Agrawal and R. Srikant, Fast algorithms for mining association rules, In Proceedings of the 20th International Conference on Very Large Data Bases, 1994, pp. 487\u2013499."},{"issue":"2","key":"10.3233\/IDA-184339_ref4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.3233\/IDA-130582","article-title":"Expectation Maximization over Binary Decision Diagrams for probabilistic logic programs","volume":"17","author":"Bellodi","year":"2013","journal-title":"Intelligent Data Analysis"},{"issue":"2","key":"10.3233\/IDA-184339_ref5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1017\/S1471068413000689","article-title":"Structure learning of probabilistic logic programs by searching the clause space","volume":"15","author":"Bellodi","year":"2015","journal-title":"Theory and Practice of Logic Programming"},{"key":"10.3233\/IDA-184339_ref6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","article-title":"The protein data bank","volume":"28","author":"Berman","year":"2000","journal-title":"Nucleic Acids Research"},{"key":"10.3233\/IDA-184339_ref7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S1574-1400(08)00012-1","article-title":"PubChem: integrated platform of small molecules and biological activities","volume":"4","author":"Bolton","year":"2008","journal-title":"Annual Reports in Computational Chemistry"},{"key":"10.3233\/IDA-184339_ref8","unstructured":"V.S. Costa, D. Page, M. Qazi and J. Cussens, CLP(BN): constraint logic programming for probabilistic knowledge, CoRR, abs\/1212.2519, 2012."},{"key":"10.3233\/IDA-184339_ref9","doi-asserted-by":"crossref","unstructured":"J. Davis and M. Goadrich, The relationship between precision-recall and ROC curves, In Proceedings of the 23rd International Conference on Machine Learning, 2006, pp.233\u2013240.","DOI":"10.1145\/1143844.1143874"},{"key":"10.3233\/IDA-184339_ref10","unstructured":"L. De Raedt, A. Kimmig and H. Toivonen, ProbLog: A probabilistic Prolog and its application in link discovery, In Proceedings of the 20th International Joint Conference on Artificial Intelligence, volume 7, 2007, pp. 2462\u20132467."},{"issue":"2","key":"10.3233\/IDA-184339_ref11","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1007460424845","article-title":"Pharmacophore discovery using the inductive logic programming system progol","volume":"30","author":"Finn","year":"1998","journal-title":"Machine Learning"},{"key":"10.3233\/IDA-184339_ref12","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/978-3-642-23780-5_47","article-title":"Learning the parameters of probabilistic logic programs from interpretations","author":"Gutmann","year":"2011","journal-title":"European Conference on Machine Learning and Knowledge Discovery in Databases"},{"key":"10.3233\/IDA-184339_ref13","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 2000, pp. 1\u201312.","DOI":"10.1145\/335191.335372"},{"key":"10.3233\/IDA-184339_ref14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","article-title":"An apriori-based algorithm for mining frequent substructures from graph data","author":"Inokuchi","year":"2000","journal-title":"Principles of Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-184339_ref15","doi-asserted-by":"crossref","unstructured":"N. Jin, C. Young and W. Wang, Graph classification based on pattern co-occurrence, In Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009, pp.\u00a0573\u2013582.","DOI":"10.1145\/1645953.1646027"},{"key":"10.3233\/IDA-184339_ref16","first-page":"1095","article-title":"Local query mining in a probabilistic Prolog,","author":"Kimmig","year":"2009","journal-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence"},{"issue":"12","key":"10.3233\/IDA-184339_ref17","doi-asserted-by":"crossref","first-page":"i240","DOI":"10.1093\/bioinformatics\/btv263","article-title":"Genome-wide detection of intervals of genetic heterogeneity associated with complex traits","volume":"31","author":"Llinares-L\u00f3pez","year":"2015","journal-title":"Bioinformatics"},{"key":"10.3233\/IDA-184339_ref18","doi-asserted-by":"crossref","unstructured":"F. Llinares-L\u00f3pez, L. Papaxanthos, D. Roqueiro, D. Bodenham and K. Borgwardt, CASMAP: detection of statistically significant combinations of SNPs in association mapping, Bioinformatics 12 (2018).","DOI":"10.1093\/bioinformatics\/bty1020"},{"key":"10.3233\/IDA-184339_ref19","doi-asserted-by":"crossref","unstructured":"F. Llinares-L\u00f3pez, M. Sugiyama, L. Papaxanthos and K.M. Borgwardt, Fast and memory-efficient significant pattern mining via permutation testing, In Proceedings of the 21st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2015, pp. 725\u2013734.","DOI":"10.1145\/2783258.2783363"},{"issue":"1","key":"10.3233\/IDA-184339_ref20","first-page":"131","article-title":"Learning ground CP-Logic theories by leveraging Bayesian network learning techniques","volume":"89","author":"Meert","year":"2008","journal-title":"Fundamenta Informaticae"},{"key":"10.3233\/IDA-184339_ref21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","article-title":"Inverse entailment and Progol","volume":"13","author":"Muggleton","year":"1995","journal-title":"New Generation Computing"},{"key":"10.3233\/IDA-184339_ref22","doi-asserted-by":"crossref","unstructured":"S. Nijssen and J.N. Kok, A quickstart in frequent structure mining can make a difference, In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004, pp.\u00a0647\u2013652.","DOI":"10.1145\/1014052.1014134"},{"key":"10.3233\/IDA-184339_ref23","unstructured":"L. Papaxanthos, F. Llinares-Lopez, D. Bodenham and K.M. Borgwardt, Finding significant combinations of features in the presence of categorical covariates, In Advances in Neural Information Processing Systems, volume 29, 2016, pp. 2271\u20132279."},{"key":"10.3233\/IDA-184339_ref24","unstructured":"J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal and M.-C. Hsu, PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth, In Proceedings of the 17th International Conference on Data Engineering, 2001, pp. 215\u2013224."},{"key":"10.3233\/IDA-184339_ref25","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-540-78652-8_8","article-title":"The Independent Choice Logic and beyond","author":"Poole","year":"2008","journal-title":"Probabilistic Inductive Logic Programming"},{"issue":"3","key":"10.3233\/IDA-184339_ref26","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1093\/comjnl\/bxt096","article-title":"Speeding up inference for probabilistic logic programs","volume":"57","author":"Riguzzi","year":"2014","journal-title":"The Computer Journal"},{"key":"10.3233\/IDA-184339_ref27","unstructured":"F. Riguzzi and T. Swift, Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions, In International Conference on Logic Programming, volume 7 of LIPIcs, 2010, pp. 162\u2013171."},{"issue":"4\u20135","key":"10.3233\/IDA-184339_ref28","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/S147106841100010X","article-title":"The PITA system: Tabling and answer subsumption for reasoning under uncertainty,","volume":"11","author":"Riguzzi","year":"2011","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2","key":"10.3233\/IDA-184339_ref29","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1017\/S1471068411000664","article-title":"Well-definedness and efficient inference for probabilistic logic programming under the distribution semantics","volume":"13","author":"Riguzzi","year":"2013","journal-title":"Theory and Practice of Logic Programming"},{"key":"10.3233\/IDA-184339_ref30","doi-asserted-by":"crossref","unstructured":"T. Sato, A statistical learning method for logic programs with distribution semantics, In Proceedings of the 12th International Conference on Logic Programming, 1995, pp. 715\u2013729.","DOI":"10.7551\/mitpress\/4298.003.0069"},{"issue":"2","key":"10.3233\/IDA-184339_ref31","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10844-008-0062-7","article-title":"A glimpse of symbolic-statistical modeling by PRISM","volume":"31","author":"Sato","year":"2008","journal-title":"Journal of Intelligent Information Systems"},{"key":"10.3233\/IDA-184339_ref32","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.912","article-title":"Parameter learning of logic programs for symbolic-statistical modeling","volume":"15","author":"Sato","year":"2001","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.3233\/IDA-184339_ref33","doi-asserted-by":"crossref","unstructured":"M. Sugiyama, F. Llinares-L\u00f3pez, N. Kasenburg and K.M. Borgwardt, Significant subgraph mining with multiple testing correction, In Proceedings of the 2015 SIAM International Conference on Data Mining, 2015, pp. 37\u201345.","DOI":"10.1137\/1.9781611974010.5"},{"issue":"2","key":"10.3233\/IDA-184339_ref34","doi-asserted-by":"crossref","first-page":"515","DOI":"10.2307\/2531456","article-title":"A modified Bonferroni method for discrete data","volume":"46","author":"Tarone","year":"1990","journal-title":"Biometrics"},{"key":"10.3233\/IDA-184339_ref35","doi-asserted-by":"crossref","unstructured":"A. Terada, M. Okada-Hatakeyama, K. Tsuda and J. Sese, Statistical significance of combinatorial regulations, Proc Natl Acad Sci USA 110(32) (2013), 12996\u201313001.","DOI":"10.1073\/pnas.1302233110"},{"key":"10.3233\/IDA-184339_ref36","doi-asserted-by":"crossref","unstructured":"A. Terada, K. Tsuda and J. Sese, Fast Westfall-Young permutation procedure for combinatorial regulation discovery, In 2013 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), 2013, pp. 153\u2013158.","DOI":"10.1109\/BIBM.2013.6732479"},{"key":"10.3233\/IDA-184339_ref37","doi-asserted-by":"crossref","unstructured":"J. Vennekens, S. Verbaeten and M. Bruynooghe, Logic Programs With Annotated Disjunctions, In International Conference on Logic Programming, volume 3131 of LNCS, Springer, 2004, pp. 195\u2013209.","DOI":"10.1007\/978-3-540-27775-0_30"},{"issue":"1","key":"10.3233\/IDA-184339_ref38","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","article-title":"KRIMP: Mining itemsets that compress","volume":"23","author":"Vreeken","year":"2011","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.3233\/IDA-184339_ref39","unstructured":"P.H. Westfall and S.S. Young, Resampling-based multiple testing: Examples and methods for p-value adjustment, John Wiley & Sons, 1993."},{"key":"10.3233\/IDA-184339_ref40","unstructured":"X. Yan and J. Han, gSpan: Graph-based substructure pattern mining, In Proceedings of 2002 IEEE International Conference on Data Mining, 2002, pp. 721\u2013724."},{"issue":"17","key":"10.3233\/IDA-184339_ref41","doi-asserted-by":"crossref","first-page":"3047","DOI":"10.1093\/bioinformatics\/bty219","article-title":"MP-LAMP: parallel detection of statistically significant multi-loci markers on cloud platforms","volume":"34","author":"Yoshizoe","year":"2018","journal-title":"Bioinformatics"},{"key":"10.3233\/IDA-184339_ref42","unstructured":"M.J. Zaki and W. Meira, Jr., Data Mining And Analysis, Cambridge, 2016."}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-184339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:35Z","timestamp":1777454315000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-184339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,8]]},"references-count":42,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/ida-184339","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,8]]}}}