{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:35:12Z","timestamp":1777703712075,"version":"3.51.4"},"reference-count":27,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2017,3,29]],"date-time":"2017-03-29T00:00:00Z","timestamp":1490745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2017,3,29]]},"abstract":"<jats:p>Graphs are considered to be one of the best studied data structures in discrete mathematics and computer science. Hence, data mining on graphs has become quite popular in the past few years. The problem of finding frequent itemsets in conventional data mining on transactional databases, thus transformed to the discovery of subgraphs that frequently occur in the graph dataset containing either single graph or multiple graphs. Most of the existing algorithms in the field of frequent subgraph discovery adopts an Apriori approach based on generation of candidate set and test approach. The problem with this approach is the costlier candidate set generation, particularly when there exist more number of large subgraphs. The research goals in frequent subgraph discovery are to evolve (i) mechanisms that can effectively generate candidate subgraphs excluding duplicates and (ii) mechanisms that find best processing techniques that generate only necessary candidate subgraphs in order to discover the useful and desired frequent subgraphs. In this paper, a two phase approach is proposed by integrating Apriori algorithm on graphs to frequent subgraph (FS) tree to discover frequent subgraphs in graph datasets.<\/jats:p>","DOI":"10.3233\/jifs-169264","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T18:23:52Z","timestamp":1490984632000},"page":"3209-3219","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":9,"title":["Improvised Apriori with frequent subgraph tree for extracting frequent subgraphs"],"prefix":"10.1177","volume":"32","author":[{"given":"Jyothisha J.","family":"Nair","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanna","family":"Thomas","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Amrita School of Engineering, Amritapuri, Amrita Vishwa Vidyapeetham, Amrita University, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,3,29]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"https:\/\/en.wikipedia.org\/wiki\/Datamining"},{"key":"e_1_3_2_3_2","unstructured":"http:\/\/systemg.research.ibm.com\/about.html- aspirin"},{"key":"e_1_3_2_4_2","unstructured":"http:\/\/www.socialmediatoday.com\/"},{"key":"e_1_3_2_5_2","unstructured":"http:\/\/dreuarchive.cra.org\/"},{"key":"e_1_3_2_6_2","unstructured":"http:\/\/current.cs.ucsb.edu\/socialmodels\/sandlab.cs.ucsb.edu"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959249"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1613\/jair.43"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00872095"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45372-5_2"},{"key":"e_1_3_2_11_2","unstructured":"KuramochiM. and KarypisG. Frequent Subgraph Discovery. In ICDM01."},{"key":"e_1_3_2_12_2","article-title":"Efficient mining of frequent subgraph in the presence of isomorphism","author":"Huan J.","year":"2003","unstructured":"HuanJ., WangW. and PrinsJ., Efficient mining of frequent subgraph in the presence of isomorphism, In UNC Computer Science Technique Report TR03-0212003.","journal-title":"In UNC Computer Science Technique Report TR03-021"},{"key":"e_1_3_2_13_2","article-title":"GREW A Scalable frequent subgraph discovery algorithm","author":"Kuramochi M.","year":"2004","unstructured":"KuramochiM. and KarypisG., GREW A Scalable frequent subgraph discovery algorithm, In Technical Report 04-024, University of Minnesota, Department of Computer Science2004.","journal-title":"In Technical Report 04-024, University of Minnesota, Department of Computer Science"},{"key":"e_1_3_2_14_2","article-title":"Pattern Mining in Frequent Dynamic Subgraphs","author":"Borgwardt K.M.","year":"2006","unstructured":"BorgwardtK.M., KriegelH.-P. and WackersreutherP., Pattern Mining in Frequent Dynamic Subgraphs, ICDM2006.","journal-title":"ICDM"},{"key":"e_1_3_2_15_2","article-title":"gspan: graph based Sustructure Pattern mining","author":"yan X.","year":"2002","unstructured":"yanX. and HanJ., gspan: graph based Sustructure Pattern mining, Proc 2nd IEEE Conf2002.","journal-title":"Proc 2nd IEEE Conf"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","unstructured":"KetkarN.S. HolderL.B. and CookD.J. Subdue: Compression Based Frequent Pattern Discovery in Graph Data 2005.","DOI":"10.1145\/1133905.1133915"},{"key":"e_1_3_2_18_2","article-title":"Graph Sig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases","author":"Ranu S.","year":"2009","unstructured":"RanuS. and SinghA.K., Graph Sig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases, In the proceedings IEEE International Conference on Data Engineering2009.","journal-title":"In the proceedings IEEE International Conference on Data Engineering"},{"key":"e_1_3_2_19_2","article-title":"Mining Temporal Subgraph Patterns in Heterogeneous Information Networks","author":"Hsieh H.-P.","year":"2010","unstructured":"HsiehH.-P. and LiC.-T., Mining Temporal Subgraph Patterns in Heterogeneous Information Networks, IEEE International Conference on Social Computing \/ IEEE International Conference on Privacy, Security, Risk and Trust2010.","journal-title":"IEEE International Conference on Social Computing \/ IEEE International Conference on Privacy, Security, Risk and Trust"},{"issue":"69","key":"e_1_3_2_20_2","first-page":"222","article-title":"Towards Efficient Analysis of Massive Networks","volume":"10","author":"Gayathri R.G.","year":"2015","unstructured":"GayathriR.G. and NairJ.J., Towards Efficient Analysis of Massive Networks, in International Journal of Applied Engineering Research10(69) (2015), 222\u2013227.","journal-title":"International Journal of Applied Engineering Research"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.07.297"},{"key":"e_1_3_2_22_2","first-page":"127","article-title":"The gaston tool for frequent subgraph mining","author":"Nijssen S.","year":"2005","unstructured":"NijssenS. and KokJ.N., The gaston tool for frequent subgraph mining, Electronic Notes in Theoretical Computer Science (2005), 127.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"e_1_3_2_23_2","article-title":"Mining closed relational graphs with con- nectivity constraints","author":"Yan X.","year":"2005","unstructured":"YanX., ZhouX. and HanJ., Mining closed relational graphs with con- nectivity constraints. In Proc. of the 11th ACM SIGKDD Int. Conf. on Knowledge Discovery in Data Mining2005.","journal-title":"Proc. of the 11th ACM SIGKDD Int. Conf. on Knowledge Discovery in Data Mining"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021726221443"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"e_1_3_2_26_2","first-page":"581","article-title":"Spin: mining maximal frequent subgraphs from graph databases","author":"Huan J.","year":"2004","unstructured":"HuanJ., WangW., PrinsJ. and YangJ., Spin: mining maximal frequent subgraphs from graph databases, In Proc. of the 10th ACMSIGKDD Int. Conf. on Knowledge Discovery and Data Mining (2004), 581\u2013586.","journal-title":"In Proc. of the 10th ACMSIGKDD Int. Conf. on Knowledge Discovery and Data Mining"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989534"},{"key":"e_1_3_2_28_2","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"Agrawal R.","unstructured":"AgrawalR. and SrikantR., Fast algorithms for mining association rules, In Proc. the 20th VLDB487\u2013499.","journal-title":"In Proc. the 20th VLDB"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169264","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-169264","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-169264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:39:24Z","timestamp":1777455564000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-169264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,29]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,3,29]]}},"alternative-id":["10.3233\/JIFS-169264"],"URL":"https:\/\/doi.org\/10.3233\/jifs-169264","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,29]]}}}