{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T19:24:31Z","timestamp":1783797871212,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:00:00Z","timestamp":1766102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100008199","name":"RTI International","doi-asserted-by":"crossref","award":["0282103.100.007"],"award-info":[{"award-number":["0282103.100.007"]}],"id":[{"id":"10.13039\/100008199","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100008199","name":"RTI International","doi-asserted-by":"crossref","award":["0282103.100.007"],"award-info":[{"award-number":["0282103.100.007"]}],"id":[{"id":"10.13039\/100008199","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Knowledge graphs have been growing in popularity in recent years, due to their successful use in many data-analytics and knowledge-discovery tasks. As the sizes of domain graphs continue to grow, they can become too large to be processed efficiently by downstream applications. It is thus essential in many cases to address the\n                    <jats:italic>efficiency<\/jats:italic>\n                    issue by reducing knowledge-graph sizes via summarization. At the same time, to provide\n                    <jats:italic>effective<\/jats:italic>\n                    results on the graph summaries, many downstream analytics tasks require the summaries to retain as much information from the original graph as possible. It turns out that state-of-the-art data-reduction approaches may generate task-specific or lossy summaries, which may present challenges for the effectiveness of downstream analytics. Toward addressing the efficiency and effectiveness challenges, we introduce GAME+, a domain- and application-independent knowledge-graph summarization approach for generating size-reduced\n                    <jats:italic>abstract<\/jats:italic>\n                    knowledge graphs from a given graph. Through provenance maintenance, the abstract graphs generated by GAME+ can be used to reconstruct the original graphs, that is, the summarization in the proposed approach is\n                    <jats:italic>lossless<\/jats:italic>\n                    . We explore the performance of one type of knowledge-graph analytics, inference rule mining, on the abstract graphs as compared with the original graphs. Through various experiments on large-scale, real-world knowledge graphs, we provide evidence that our approach can substantially reduce knowledge-graph sizes, thereby improving rule mining efficiency on the graph data. At the same time, the abstract knowledge graphs can still enable effective rule mining due to the lossless nature of the approach. We posit that the knowledge-graph reduction provided by the proposed GAME+ approach can enable efficient, yet effective, results for diverse healthcare-related applications and use cases.\n                  <\/jats:p>","DOI":"10.1007\/s41060-025-00911-y","type":"journal-article","created":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T05:40:33Z","timestamp":1766122833000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["GAME+: lossless knowledge-graph compression for improving the efficiency and effectiveness of rule mining"],"prefix":"10.1007","volume":"21","author":[{"given":"Kara","family":"Schatz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jon-Michael","family":"Beasley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Tropsha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rada","family":"Chirkova","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,19]]},"reference":[{"key":"911_CR1","doi-asserted-by":"publisher","unstructured":"Schatz, K., Tropsha, A., Chirkova, R.: GAME: Improving efficiency and effectiveness of knowledge-graph rule mining via data reduction. In: IEEE Int. Conf. on Big Data, pp. 4248\u20134257 (2023). https:\/\/doi.org\/10.1109\/BigData59044.2023.10386384","DOI":"10.1109\/BigData59044.2023.10386384"},{"key":"911_CR2","doi-asserted-by":"publisher","unstructured":"Lajus, J., Gal\u00e1rraga, L., Suchanek, F.: Fast and Exact Rule Mining with AMIE 3. In: Semant. Web, pp. 36\u201352 (2020). https:\/\/doi.org\/10.1007\/978-3-030-49461-2_3","DOI":"10.1007\/978-3-030-49461-2_3"},{"issue":"2","key":"911_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3371315","volume":"12","author":"N Ahmadi","year":"2020","unstructured":"Ahmadi, N., Huynh, V.-P., Meduri, V., Ortona, S., Papotti, P.: Mining Expressive Rules in Knowledge Graphs. ACM J. Data Inf. Qual. 12(2), 1\u201327 (2020). https:\/\/doi.org\/10.1145\/3371315","journal-title":"ACM J. Data Inf. Qual."},{"key":"911_CR4","unstructured":"Wang, Z., Li, J.: RDF2Rules: Learning Rules from RDF Knowledge Bases by Mining Frequent Predicate Cycles. arXiv:1512.07734 [cs] (2015)"},{"key":"911_CR5","unstructured":"Sadeghian, A., Armandpour, M., Ding, P., Wang, D.Z.: DRUM: End-To-End Differentiable Rule Mining On Knowledge Graphs. arXiv:1911.00055 [cs, stat] (2019)"},{"key":"911_CR6","doi-asserted-by":"publisher","unstructured":"Wang, Q., Mao, Z., Wang, B., Guo, L.: Knowledge graph embedding: A survey of approaches and applications. IEEE Trans. on Knowl. and Data Eng. 29(12), 2724\u20132743 (2017) https:\/\/doi.org\/10.1109\/TKDE.2017.2754499","DOI":"10.1109\/TKDE.2017.2754499"},{"issue":"1","key":"911_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/nrd.2018.168","volume":"18","author":"S Pushpakom","year":"2019","unstructured":"Pushpakom, S., Iorio, F., Eyers, P.A., Escott, K.J., Hopper, S., Wells, A., Doig, A., Guilliams, T., Latimer, J., McNamee, C., Norris, A., Sanseau, P., Cavalla, D., Pirmohamed, M.: Drug repurposing: progress, challenges and recommendations. Nat. Rev. Drug Discov. 18(1), 41\u201358 (2019). https:\/\/doi.org\/10.1038\/nrd.2018.168","journal-title":"Nat. Rev. Drug Discov."},{"key":"911_CR8","doi-asserted-by":"publisher","unstructured":"Schatz, K., Melo-Filho, C., Tropsha, A., Chirkova, R.: Explaining Drug-Discovery Hypotheses Using Knowledge-Graph Patterns. In: IEEE Int. Conf. on Big Data, pp. 3709\u20133716 (2021). https:\/\/doi.org\/10.1109\/BigData52589.2021.9672006","DOI":"10.1109\/BigData52589.2021.9672006"},{"issue":"12","key":"911_CR9","doi-asserted-by":"publisher","first-page":"4968","DOI":"10.1021\/acs.jcim.9b00683","volume":"59","author":"C Bizon","year":"2019","unstructured":"Bizon, C., Cox, S., Balhoff, J., Kebede, Y., Wang, P., Morton, K., Fecho, K., Tropsha, A.: ROBOKOP KG and KGB: Integrated knowledge graphs from federated sources. J. Chem. Inf. Model. 59(12), 4968\u20134973 (2019). https:\/\/doi.org\/10.1021\/acs.jcim.9b00683","journal-title":"J. Chem. Inf. Model."},{"issue":"3","key":"911_CR10","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00778-018-0528-3","volume":"28","author":"\u0160 \u010cebiri\u0107","year":"2019","unstructured":"\u010cebiri\u0107, \u0160, Goasdou\u00e9, F., Kondylakis, H., Kotzinos, D., Manolescu, I., Troullinou, G., Zneika, M.: Summarizing semantic graphs: a survey. The VLDB J. 28(3), 295\u2013327 (2019). https:\/\/doi.org\/10.1007\/s00778-018-0528-3","journal-title":"The VLDB J."},{"key":"911_CR11","doi-asserted-by":"publisher","unstructured":"Liu, Y., Safavi, T., Dighe, A., Koutra, D.: Graph summarization methods and applications: A survey. ACM Comput. Surv. 51(3) (2018) https:\/\/doi.org\/10.1145\/3186727","DOI":"10.1145\/3186727"},{"key":"911_CR12","unstructured":"Bonifati, A., Dumbrava, S., Kondylakis, H.: Graph Summarization. arXiv:2004.14794 (2020)"},{"issue":"4","key":"911_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tips.2021.01.003","volume":"42","author":"HI Roessler","year":"2021","unstructured":"Roessler, H.I., Knoers, N.V.A.M., Van Haelst, M.M., Van Haaften, G.: Drug Repurposing for Rare Diseases. Trends Pharmacol. Sci. 42(4), 255\u2013267 (2021). https:\/\/doi.org\/10.1016\/j.tips.2021.01.003","journal-title":"Trends Pharmacol. Sci."},{"issue":"2","key":"911_CR14","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.therap.2020.02.006","volume":"75","author":"C Fetro","year":"2020","unstructured":"Fetro, C., Scherman, D.: Drug repurposing in rare diseases: Myths and reality. Therapies 75(2), 157\u2013160 (2020). https:\/\/doi.org\/10.1016\/j.therap.2020.02.006","journal-title":"Therapies"},{"issue":"3","key":"911_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.jvlc.2005.10.003","volume":"17","author":"X Huang","year":"2006","unstructured":"Huang, X., Lai, W.: Clustering graphs for visualization via node similarities. J. of Vis. Lang. Comput. 17(3), 225\u2013253 (2006). https:\/\/doi.org\/10.1016\/j.jvlc.2005.10.003","journal-title":"J. of Vis. Lang. Comput."},{"key":"911_CR16","doi-asserted-by":"publisher","unstructured":"Tran, T.-K., Gad-Elrab, M.H., Stepanova, D., Kharlamov, E., Str\u00f6tgen, J.: Fast Computation of Explanations for Inconsistency in Large-Scale Knowledge Graphs. In: The Web Conf., pp. 2613\u20132619 (2020). https:\/\/doi.org\/10.1145\/3366423.3380014","DOI":"10.1145\/3366423.3380014"},{"issue":"1","key":"911_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10844-021-00650-z","volume":"58","author":"JAP Sacenti","year":"2022","unstructured":"Sacenti, J.A.P., Fileto, R., Willrich, R.: Knowledge graph summarization impacts on movie recommendations. J. of Intell. Inf. Sys. 58(1), 43\u201366 (2022). https:\/\/doi.org\/10.1007\/s10844-021-00650-z","journal-title":"J. of Intell. Inf. Sys."},{"key":"911_CR18","doi-asserted-by":"publisher","unstructured":"Song, Q., Wu, Y., Lin, P., Dong, L.X., Sun, H.: Mining Summaries for Knowledge Graph Search. IEEE Trans. on Knowl. and Data Eng. 30(10), 1887\u20131900 (2018) https:\/\/doi.org\/10.1109\/TKDE.2018.2807442","DOI":"10.1109\/TKDE.2018.2807442"},{"key":"911_CR19","doi-asserted-by":"publisher","unstructured":"Jin, D., Koutra, D.: Exploratory Analysis of Graph Data by Leveraging Domain Knowledge. In: IEEE Int. Conf. on Data Min., pp. 187\u2013196 (2017). https:\/\/doi.org\/10.1109\/ICDM.2017.28","DOI":"10.1109\/ICDM.2017.28"},{"key":"911_CR20","doi-asserted-by":"publisher","unstructured":"Jin, D., Rossi, R.A., Koh, E., Kim, S., Rao, A., Koutra, D.: Latent Network Summarization: Bridging Network Embedding and Summarization. In: ACM SIGKDD, pp. 987\u2013997 (2019). https:\/\/doi.org\/10.1145\/3292500.3330992","DOI":"10.1145\/3292500.3330992"},{"issue":"18","key":"911_CR21","doi-asserted-by":"publisher","first-page":"2988","DOI":"10.1093\/bioinformatics\/btab207","volume":"37","author":"Y Yu","year":"2021","unstructured":"Yu, Y., Huang, K., Zhang, C., Glass, L.M., Sun, J., Xiao, C.: SumGNN: multi-typed drug interaction prediction via efficient knowledge graph summarization. Bioinform 37(18), 2988\u20132995 (2021). https:\/\/doi.org\/10.1093\/bioinformatics\/btab207","journal-title":"Bioinform"},{"key":"911_CR22","doi-asserted-by":"publisher","unstructured":"Koutra, D., Kang, U., Vreeken, J., Faloutsos, C.: VOG: Summarizing and understanding large graphs. In: SIAM Int. Conf. on Data Min., pp. 91\u201399 (2014). https:\/\/doi.org\/10.1137\/1.9781611973440.11","DOI":"10.1137\/1.9781611973440.11"},{"key":"911_CR23","doi-asserted-by":"publisher","unstructured":"Safavi, T., Belth, C., Faber, L., Mottin, D., M\u00fcller, E., Koutra, D.: Personalized Knowledge Graph Summarization: From the Cloud to Your Pocket. In: IEEE Int. Conf. on Data Min., pp. 528\u2013537 (2019). https:\/\/doi.org\/10.1109\/ICDM.2019.00063","DOI":"10.1109\/ICDM.2019.00063"},{"key":"911_CR24","unstructured":"Ioannidis, V.N., Song, X., Manchanda, S., Li, M., Pan, X., Zheng, D., Ning, X., Zeng, X., Karypis, G.: DRKG - Drug Repurposing Knowledge Graph for Covid-19. https:\/\/github.com\/gnn4dr\/DRKG\/ (2020)"},{"key":"911_CR25","doi-asserted-by":"publisher","unstructured":"Himmelstein, D.S., Lizee, A., Hessler, C., Brueggeman, L., Chen, S.L., Hadley, D., Green, A., Khankhanian, P., Baranzini, S.E.: Systematic integration of biomedical knowledge prioritizes drugs for repurposing. eLife 6, 26726 (2017) https:\/\/doi.org\/10.7554\/eLife.26726","DOI":"10.7554\/eLife.26726"},{"key":"911_CR26","unstructured":"The Neo4j Team: The Neo4j Operations Manual v4.4 (2022). https:\/\/neo4j.com\/docs\/operations-manual\/current\/"},{"key":"911_CR27","unstructured":"The Neo4j Team: The Neo4j Cypher Manual v4.4 (2022). https:\/\/neo4j.com\/docs\/cypher-manual\/current\/"},{"key":"911_CR28","volume-title":"Python 3 Reference Manual","author":"G Van Rossum","year":"2009","unstructured":"Van Rossum, G., Drake, F.L.: Python 3 Reference Manual. CreateSpace, Scotts Valley, CA (2009)"},{"key":"911_CR29","unstructured":"Small, N.: The Py2neo v4 Handbook (2019). https:\/\/py2neo.org\/2021.1\/"},{"key":"911_CR30","doi-asserted-by":"publisher","unstructured":"Schatz, K., Korn, D., Tropsha, A., Chirkova, R.: Workflow for Domain- and Task-Sensitive Curation of Knowledge Graphs, with Use Case of DRKG. In: IEEE Int. Conf. on Big Data, pp. 3692\u20133701 (2022). https:\/\/doi.org\/10.1109\/BigData55660.2022.10020536","DOI":"10.1109\/BigData55660.2022.10020536"},{"key":"911_CR31","doi-asserted-by":"publisher","unstructured":"Jaccard, P.: The distribution of the flora in the alpine zone. New Phytol. 11(2), 37\u201350 (1912). https:\/\/doi.org\/10.1111\/j.1469-8137.1912.tb05611.x","DOI":"10.1111\/j.1469-8137.1912.tb05611.x"},{"key":"911_CR32","unstructured":"Newman, M.: Networks, 2nd edn. Oxford University Press Inc, Oxford (2018)"},{"key":"911_CR33","doi-asserted-by":"publisher","unstructured":"Kleinberg, J.M.: Hubs, authorities, and communities. ACM Comput. Surv. 31(4es), 5 (1999) https:\/\/doi.org\/10.1145\/345966.345982","DOI":"10.1145\/345966.345982"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-025-00911-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-025-00911-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-025-00911-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:35:17Z","timestamp":1773480917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-025-00911-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,19]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["911"],"URL":"https:\/\/doi.org\/10.1007\/s41060-025-00911-y","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,19]]},"assertion":[{"value":"13 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"79"}}