{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:34:55Z","timestamp":1760016895522,"version":"3.40.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s41060-021-00292-y","type":"journal-article","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T03:02:28Z","timestamp":1638414148000},"page":"105-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mining subgraph coverage patterns from graph transactions"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4212-1460","authenticated-orcid":false,"given":"A. Srinivas","family":"Reddy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Krishna","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U. Deva","family":"Priyakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"key":"292_CR1","unstructured":"ADA. http:\/\/hpc.iiit.ac.in\/wiki\/index.php\/Ada_User_Guide (Accessed in September 2021)"},{"key":"292_CR2","unstructured":"UIUC technical report, UIUCDCS-R-2002-2296. https:\/\/sites.cs.ucsb.edu\/~xyan\/papers\/gSpan.pdf (Accessed in September 2021)"},{"key":"292_CR3","unstructured":"Pubchem. https:\/\/pubchem.ncbi.nlm.nih.gov\/ (2021)"},{"issue":"1","key":"292_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13040-018-0162-z","volume":"11","author":"M Aida","year":"2018","unstructured":"Aida, M., Pieter, M., Wout, B., Pieter, M., Boris, C., Bart Goethals, K.L.: Grasping frequent subgraph mining for bioinformatics applications. BioData Min. 11(1), 1\u201320 (2018)","journal-title":"BioData Min."},{"issue":"12","key":"292_CR5","doi-asserted-by":"publisher","first-page":"2496","DOI":"10.1109\/TVCG.2013.184","volume":"19","author":"B Alsallakh","year":"2013","unstructured":"Alsallakh, B., Aigner, W., Miksch, S., Hauser, H.: Radial sets: interactive visual analysis of large overlapping sets. IEEE Trans. Visual Comput. Gr. 19(12), 2496\u20132505 (2013)","journal-title":"IEEE Trans. Visual Comput. Gr."},{"issue":"2","key":"292_CR6","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00291-018-0541-3","volume":"41","author":"A Amiri","year":"2019","unstructured":"Amiri, A., Salari, M.: Time-constrained maximal covering routing problem. OR Spectrum 41(2), 415\u2013468 (2019)","journal-title":"OR Spectrum"},{"issue":"1","key":"292_CR7","first-page":"63","volume":"31","author":"GD Andrew","year":"2017","unstructured":"Andrew, G.D., Paola, V.L.: The minimal hitting set generation problem: Algorithms and computation. SIAM 31(1), 63\u2013100 (2017)","journal-title":"SIAM"},{"key":"292_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10844-019-00579-4","volume":"55","author":"R Ayed","year":"2020","unstructured":"Ayed, R., Hacid, M.S., Haque, R., Jemai, A.: An updated dashboard of complete search FSM implementations in centralized graph transaction databases. J. Intell. Inf. Syst. 55, 149\u2013182 (2020)","journal-title":"J. Intell. Inf. Syst."},{"key":"292_CR9","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Berthold, M.R.: Mining molecular fragments: finding relevant substructures of molecules. In: Proceedings of the ICDM, pp. 51\u201358 (2002)","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"292_CR10","unstructured":"Charu\u00a0C, A., Haixun, W.: Managing and mining graph data, vol.\u00a040. Springer (2010)"},{"key":"292_CR11","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.asoc.2016.02.003","volume":"42","author":"J Chen","year":"2016","unstructured":"Chen, J., Lin, Y., Li, J., Lin, G., Ma, Z., Tan, A.: A rough set method for the minimum vertex cover problem of graphs. Appl. Soft Comput. 42, 360\u2013367 (2016)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"292_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"292_CR13","doi-asserted-by":"crossref","unstructured":"Cormode, G., Karloff, H., Wirth, A.: Set cover algorithms for very large datasets. In: Proceedings of the ACM CIKM, pp. 479\u2013488 (2010)","DOI":"10.1145\/1871437.1871501"},{"key":"292_CR14","unstructured":"Dehaspe, L., Toivonen, H., King, R.D.: Finding frequent substructures in chemical compounds. In: Proceedings of the KDD, pp. 30\u201336 (1998)"},{"key":"292_CR15","doi-asserted-by":"crossref","unstructured":"Fazekas, K., Bacchus, F., Biere, A.: Implicit hitting set algorithms for maximum satisfiability modulo theories. In: Proceedings of the IJCAR, pp. 134\u2013151 (2018)","DOI":"10.1007\/978-3-319-94205-6_10"},{"key":"292_CR16","volume-title":"The graph isomorphism problem: Technical report","author":"S Fortin","year":"1996","unstructured":"Fortin, S.: The graph isomorphism problem: Technical report. Univ Alberta, Edmonton (1996)"},{"key":"292_CR17","doi-asserted-by":"crossref","unstructured":"Fournier\u00a0Viger, P., Cheng, C., Lin, J.C.W., Yun, U., Kiran, R.U.: TKG: Efficient mining of top-k frequent subgraphs. In: Proceedings of the Big Data Analytics, pp. 209\u2013226 (2019)","DOI":"10.1007\/978-3-030-37188-3_13"},{"key":"292_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10844-014-0318-3","volume":"45","author":"P Gowtham Srinivas","year":"2015","unstructured":"Gowtham Srinivas, P., Krishna Reddy, P., Trinath, A.V., Bhargav, S., Uday Kiran, R.: Mining coverage patterns from transactional databases. J. Intell. Inf. Syst. 45, 423\u2013439 (2015)","journal-title":"J. Intell. Inf. Syst."},{"key":"292_CR19","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithm. pp. 2.2\u20132.15 (2009)","DOI":"10.1145\/1412228.1412236"},{"key":"292_CR20","doi-asserted-by":"publisher","first-page":"19752","DOI":"10.1109\/ACCESS.2019.2895296","volume":"7","author":"VIG Guevara","year":"2019","unstructured":"Guevara, V.I.G., Calderon, S.G., Cabrera, E.A., Calvo, H.: Symbolic learning for improving the performance of transversal-computation algorithms. IEEE Access 7, 19752\u201319761 (2019)","journal-title":"IEEE Access"},{"issue":"1","key":"292_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Disc. 15(1), 55\u201386 (2007)","journal-title":"Data Min. Knowl. Disc."},{"key":"292_CR22","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of the European Conference on Principles of Data Mining and Knowledge Discovery, pp. 13\u201323 (2000)","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"1","key":"292_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang, C., Coenen, F., Zito, M.: A survey of frequent subgraph mining algorithms. Knowl. Eng. Rev. 28(1), 75\u2013105 (2013)","journal-title":"Knowl. Eng. Rev."},{"key":"292_CR24","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Philip, S.Y., Zhou, S.: GString: A novel approach for efficient search in graph databases. In: Proceedings of the ICDE, pp. 566\u2013575 (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"key":"292_CR25","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the ICDM, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"292_CR26","doi-asserted-by":"crossref","unstructured":"Li, R., Wang, W.: REAFUM: Representative approximate frequent subgraph mining. In: Proceedings of the ICDM, pp. 757\u2013765. SIAM (2015)","DOI":"10.1137\/1.9781611974010.85"},{"issue":"10","key":"292_CR27","first-page":"1852","volume":"30","author":"Y Li","year":"2018","unstructured":"Li, Y., Fan, J., Wang, Y., Tan, K.L.: Influence maximization on social graphs: A survey. IEEE TKDE 30(10), 1852\u20131872 (2018)","journal-title":"IEEE TKDE"},{"key":"292_CR28","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: Proceedings of the ACM SIGKDD, pp. 337\u2013341 (1999)","DOI":"10.1145\/312129.312274"},{"key":"292_CR29","doi-asserted-by":"crossref","unstructured":"Medina, S.G., Fassio, A.V., de\u00a0A.\u00a0Silveira, S., da\u00a0Silveira, C.H., de\u00a0Melo-Minardi, R.C.: CALI: A novel visual model for frequent pattern mining in protein-ligand graphs. In: International Conference on Bioinformatics and Bioengineering, pp. 352\u2013358 (2017)","DOI":"10.1109\/BIBE.2017.00-29"},{"issue":"16","key":"292_CR30","doi-asserted-by":"publisher","first-page":"2785","DOI":"10.1002\/jcc.21256","volume":"30","author":"GM Morris","year":"2009","unstructured":"Morris, G.M., Huey, R., Lindstrom, W., Sanner, M.F., Belew, R.K., Goodsell, D.S., Olson, A.J.: AutoDock4 and AutoDockTools4: automated docking with selective receptor flexibility. J. Comput. Chem. 30(16), 2785\u20132791 (2009)","journal-title":"J. Comput. Chem."},{"issue":"10","key":"292_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcbi.1005777","volume":"13","author":"Y Orenstein","year":"2017","unstructured":"Orenstein, Y., Pellow, D., Mar\u00e7ais, G., Shamir, R., Kingsford, C.: Designing small universal $$k$$-mer hitting sets for improved analysis of high-throughput sequencing. PLoS Comput. Biol. 13(10), 1\u201315 (2017)","journal-title":"PLoS Comput. Biol."},{"key":"292_CR32","doi-asserted-by":"crossref","unstructured":"Ralla, A., Siddiqie, S., Reddy, P.K., Mondal, A.: Coverage pattern mining based on MapReduce. In: Proceedings of the ACM IKDD CoDS-COMAD, pp. 209\u2013213 (2020)","DOI":"10.1145\/3371158.3371188"},{"key":"292_CR33","doi-asserted-by":"crossref","unstructured":"Rehman, S.U., Khan, A.U., Fong, S.: Graph mining: A survey of graph mining techniques. In: Proceedings of the International Conference on Digital Information Management, pp. 88\u201392 (2012)","DOI":"10.1109\/ICDIM.2012.6360146"},{"key":"292_CR34","doi-asserted-by":"crossref","unstructured":"Ribeiro, V.S., Santana, C.A., Fassio, A.V., Cerqueira, F.R., da\u00a0Silveira, C.H., Romanelli, J.P.R., Patarroyo-Vargas, A., Oliveira, M.G.A., Gon\u00e7alves-Almeida, V., Izidoro, S.C., de\u00a0Melo-Minardi, R.C., Silveira, S.d.A.: visGReMLIN: Graph mining-based detection and visualization of conserved motifs at 3D protein-ligand interface at the atomic level. BMC Bioinformatics 21(2), 1\u201312 (2020)","DOI":"10.1186\/s12859-020-3347-7"},{"key":"292_CR35","doi-asserted-by":"crossref","unstructured":"Santana, C.A., Cerqueira, F.R., Da\u00a0Silveira, C.H., Fassio, A.V., De\u00a0Melo-Minardi, R.C., Silveira, S.d.A.: GReMLIN: A graph mining strategy to infer protein-ligand interaction patterns. In: IEEE International Conference on Bioinformatics and Bioengineering, pp. 28\u201335 (2016)","DOI":"10.1109\/BIBE.2016.48"},{"key":"292_CR36","doi-asserted-by":"crossref","unstructured":"Srinivas, P.G., Reddy, P.K., Bhargav, S., Kiran, R.U., Kumar, D.S.: Discovering coverage patterns for banner advertisement placement. In: Proceedings of the PAKDD, pp. 133\u2013144 (2012)","DOI":"10.1007\/978-3-642-30220-6_12"},{"issue":"11","key":"292_CR37","doi-asserted-by":"publisher","first-page":"2324","DOI":"10.1021\/acs.jcim.5b00559","volume":"55","author":"T Sterling","year":"2015","unstructured":"Sterling, T., Irwin, J.J.: ZINC 15 - Ligand discovery for everyone. J. Chem. Inf. Model. 55(11), 2324\u20132337 (2015)","journal-title":"J. Chem. Inf. Model."},{"key":"292_CR38","unstructured":"Tan, P.N., Steinbach, M., Karpatne, A., Kumar, V.: Introduction to Data Mining, $$2{nd}$$ edn. Pearson (2018)"},{"key":"292_CR39","doi-asserted-by":"crossref","unstructured":"Wagner, M., Friedrich, T., Lindauer, M.: Improving local search in a minimum vertex cover solver for classes of networks. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1704\u20131711 (2017)","DOI":"10.1109\/CEC.2017.7969507"},{"key":"292_CR40","doi-asserted-by":"crossref","unstructured":"Wang, C., Xie, M., Bhowmick, S.S., Choi, B., Xiao, X., Zhou, S.: FERRARI: an efficient framework for visual exploratory subgraph search in graph databases. VLDB J. pp. 1\u201326 (2020)","DOI":"10.1007\/s00778-020-00601-0"},{"key":"292_CR41","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104867","volume":"116","author":"J Wu","year":"2020","unstructured":"Wu, J., Li, C.M., Jiang, L., Zhou, J., Yin, M.: Local search for diversified top- k clique search problem. Computers & Operations Research 116, 104867 (2020)","journal-title":"Computers & Operations Research"},{"key":"292_CR42","unstructured":"Xifeng Y., Jiawei H.: gSpan: Graph-based substructure pattern mining. In: Proceedings of the ICDM, pp. 721\u2013724 (2002)"},{"key":"292_CR43","doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by leap search. In: Proceedings of the ACM SIGMOD, pp. 433\u2013444 (2008)","DOI":"10.1145\/1376616.1376662"},{"key":"292_CR44","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: a frequent structure-based approach. In: Proceedings of the ACM SIGMOD, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"issue":"10","key":"292_CR45","doi-asserted-by":"publisher","first-page":"1742","DOI":"10.1371\/journal.pbio.0030324","volume":"3","author":"H Yang","year":"2005","unstructured":"Yang, H., Xie, W., Xue, X., Yang, K., Ma, J., Liang, W., Zhao, Q., Zhou, Z., Pei, D., Ziebuhr, J., Hilgenfeld, R., Yuen, K.Y., Wong, L., Gao, G., Chen, S., Chen, Z., Ma, D., Bartlam, M., Rao, Z.: Design of wide-spectrum inhibitors targeting coronavirus main proteases. PLoS Biol. 3(10), 1742\u20131752 (2005)","journal-title":"PLoS Biol."},{"key":"292_CR46","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.eswa.2018.05.001","volume":"108","author":"A Zareie","year":"2018","unstructured":"Zareie, A., Sheikhahmadi, A., Khamforoosh, K.: Influence maximization in social networks based on TOPSIS. Expert Syst. Appl. 108, 96\u2013107 (2018)","journal-title":"Expert Syst. Appl."},{"key":"292_CR47","unstructured":"Zhefeng, W., Enhong, C., Qi, L., Yu, Y., Yong, G., Biao, C.: Information coverage maximization in social networks. Comput. Res. Repository arxiv:1510.03822 (2015)"},{"key":"292_CR48","doi-asserted-by":"crossref","unstructured":"Zhou, D., Zhang, S., Yildirim, M.Y., Alcorn, S., Tong, H., Davulcu, H., He, J.: A local algorithm for structure-preserving graph cut. In: Proceedings of the ACM SIGKDD, pp. 655\u2013664 (2017)","DOI":"10.1145\/3097983.3098015"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-021-00292-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-021-00292-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-021-00292-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T03:05:38Z","timestamp":1744167938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-021-00292-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,2]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["292"],"URL":"https:\/\/doi.org\/10.1007\/s41060-021-00292-y","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2021,12,2]]},"assertion":[{"value":"23 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"The source code is available at .","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}