{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:06:38Z","timestamp":1768719998474,"version":"3.49.0"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2010,10]]},"abstract":"<jats:p>The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. The set of maximal frequent subgraphs is much smaller to that of the set of frequent subgraphs providing ample scope for pruning. MARGIN is a maximal subgraph mining algorithm that moves among promising nodes of the search space along the \u201cborder\u201d of the infrequent and frequent subgraphs. This drastically reduces the number of candidate patterns in the search space. The proof of correctness of the algorithm is presented. Experimental results validate the efficiency and utility of the technique proposed.<\/jats:p>","DOI":"10.1145\/1839490.1839491","type":"journal-article","created":{"date-parts":[[2010,10,19]],"date-time":"2010-10-19T12:36:24Z","timestamp":1287491784000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":51,"title":["MARGIN"],"prefix":"10.1145","volume":"4","author":[{"given":"Lini T.","family":"Thomas","sequence":"first","affiliation":[{"name":"International Institute of Information Technology, Hyderabad, India"}]},{"given":"Satyanarayana R.","family":"Valluri","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology, Hyderabad, India"}]},{"given":"Kamalakar","family":"Karlapalem","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology, Hyderabad, India"}]}],"member":"320","published-online":{"date-parts":[[2010,10,22]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM). 51--58","author":"Borgelt C."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.15"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE). 443--452","author":"Burdick D."},{"key":"e_1_2_1_4_1","first-page":"1","article-title":"Frequent subtree mining\u2014an overview","volume":"66","author":"Chi Y.","year":"2005","journal-title":"Fund. Informatics"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.30"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/998688.1007091"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008694.1008702"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1618595.1618605"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009863704807"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM). 163--170","author":"Gouda K."},{"key":"e_1_2_1_11_1","unstructured":"GSPAN. gspan Software. http:\/\/www.xifengyan.net\/software\/gSpan.htm.  GSPAN. gspan Software. http:\/\/www.xifengyan.net\/software\/gSpan.htm."},{"key":"e_1_2_1_12_1","unstructured":"GTL. Graph Template Library. http:\/\/www.infosun.fmi.uni-passau.de\/GTL\/.  GTL. Graph Template Library. http:\/\/www.infosun.fmi.uni-passau.de\/GTL\/."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/777943.777945"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.45"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.37"},{"key":"e_1_2_1_16_1","unstructured":"Hu J. Shen X. Shao Y. Bystroff C. and Zaki M. J. 2002. Mining protein contact maps. BIOKDD 3--10.  Hu J. Shen X. Shao Y. Bystroff C. and Zaki M. J. 2002. Mining protein contact maps. BIOKDD 3--10."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM). 549--552","author":"Huan J."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014123"},{"key":"e_1_2_1_19_1","unstructured":"IGRAPH. igraph Library. http:\/\/igraph.sourceforge.net\/.  IGRAPH. igraph Library. http:\/\/igraph.sourceforge.net\/."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Inokuchi A. Washio T. and Motoda H. 2000. An apriori-based algorithm for mining frequent substructures from graph data. PKDD 13--23.   Inokuchi A. Washio T. and Motoda H. 2000. An apriori-based algorithm for mining frequent substructures from graph data. PKDD 13--23.","DOI":"10.1007\/3-540-45372-5_2"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE). 566--575","author":"Jiang H."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE). 129--140","author":"Kaushik R."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281236"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth919"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0003-9"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM). 313--320","author":"Kuramochi M."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM). 258--265","author":"Kuramochi M."},{"key":"e_1_2_1_28_1","unstructured":"LIBGTOP. Unix Libgtop Utility. http:\/\/library.gnome.org\/devel\/libgtop\/stable\/libgtop-GlibTop.html.  LIBGTOP. Unix Libgtop Utility. http:\/\/library.gnome.org\/devel\/libgtop\/stable\/libgtop-GlibTop.html."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the International Workshop on Graph-Based Tools.","author":"Nijssen S."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM). 378--385","author":"Pei J."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. ACM","author":"Pei J."},{"key":"e_1_2_1_32_1","unstructured":"Srinivasa S. and Balasundararaman L. 2004. A filtration based technique for mining maximal common subgraphs. Tech. rep. International Institute of Information Technology Bangalore.  Srinivasa S. and Balasundararaman L. 2004. A filtration based technique for mining maximal common subgraphs. Tech. rep. International Institute of Information Technology Bangalore."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.102"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281271"},{"key":"e_1_2_1_35_1","unstructured":"TOP. Unix Top Utility. http:\/\/en.wikipedia.org\/wiki\/Top_(Unix).  TOP. Unix Top Utility. http:\/\/en.wikipedia.org\/wiki\/Top_(Unix)."},{"key":"e_1_2_1_36_1","unstructured":"UCI KDD ARCHIVE. Anonymous web data of msnbc.com. http:\/\/kdd.ics.uci.edu\/databases\/msnbc\/msnbc.html.  UCI KDD ARCHIVE. Anonymous web data of msnbc.com. http:\/\/kdd.ics.uci.edu\/databases\/msnbc\/msnbc.html."},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM). 458--465","author":"Vanetik N."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.7"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.34"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959249"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE). 976--985","author":"Williams D. W."},{"key":"e_1_2_1_42_1","unstructured":"Yahoo Finance. Yahoo Finance Stock Data. http:\/\/finance.yahoo.com\/.  Yahoo Finance. Yahoo Finance Stock Data. http:\/\/finance.yahoo.com\/."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining (ICDM). 721--724","author":"Yan X."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007607"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014091"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00872095"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775058"},{"key":"e_1_2_1_49_1","volume-title":"-J","author":"Zaki M. J.","year":"2002"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150506"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE). 966--975","author":"Zhang S."}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1839490.1839491","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1839490.1839491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:35Z","timestamp":1750245755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1839490.1839491"}},"subtitle":["Maximal frequent subgraph mining"],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["10.1145\/1839490.1839491"],"URL":"https:\/\/doi.org\/10.1145\/1839490.1839491","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]},"assertion":[{"value":"2006-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}