{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:57:27Z","timestamp":1760709447052,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T00:00:00Z","timestamp":1510099200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10115-017-1129-y","type":"journal-article","created":{"date-parts":[[2017,11,8]],"date-time":"2017-11-08T03:21:42Z","timestamp":1510111302000},"page":"123-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Resling: a scalable and generic framework to mine top-k representative subgraph patterns"],"prefix":"10.1007","volume":"54","author":[{"given":"Dheepikaa","family":"Natarajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4147-9372","authenticated-orcid":false,"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,8]]},"reference":[{"key":"1129_CR1","doi-asserted-by":"crossref","unstructured":"Ranu S, Singh AK (2012) Indexing and mining topological patterns for drug discovery. In: EDBT, pp 562\u2013565","DOI":"10.1145\/2247596.2247666"},{"key":"1129_CR2","doi-asserted-by":"crossref","unstructured":"Ranu S, Hoang M, Singh A (2013) Mining discriminative subgraphs from global-state networks. In: KDD, pp 509\u2013517","DOI":"10.1145\/2487575.2487692"},{"key":"1129_CR3","doi-asserted-by":"crossref","unstructured":"Chaoji V, Ranu S, Rastogi R, Bhatt R (2012) Recommendations to boost content spread in social networks. In: WWW, pp 529\u2013538","DOI":"10.1145\/2187836.2187908"},{"key":"1129_CR4","doi-asserted-by":"crossref","unstructured":"Banerjee P, Ranu S, Raghavan S (2014) Inferring uncertain trajectories from partial observations. In: ICDM, pp 30\u201339","DOI":"10.1109\/ICDM.2014.41"},{"key":"1129_CR5","doi-asserted-by":"crossref","unstructured":"Banerjee P, Yawalkar P, Ranu S (2016) Mantra: a scalable approach to mining temporally anomalous sub-trajectories. In: KDD, pp 1415\u20131424","DOI":"10.1145\/2939672.2939846"},{"key":"1129_CR6","unstructured":"Yan X, Han J (2002) Gspan: graph-based substructure pattern mining. In: ICDM, p 721. ISBN: 0-7695-1754-4"},{"issue":"3","key":"1129_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi M, Karypis G (2005) Finding frequent patterns in a large sparse graph*. Data Min Knowl Discov 11(3):243\u2013271","journal-title":"Data Min Knowl Discov"},{"issue":"7","key":"1129_CR8","first-page":"517","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy M, Abdelhamid E, Skiadopoulos S, Kalnis P (2014) Grami: frequent subgraph and pattern mining in a single large graph. PVLDB 7(7):517\u2013528","journal-title":"PVLDB"},{"key":"1129_CR9","doi-asserted-by":"crossref","unstructured":"Gurukar S, Ranu S, Ravindran B (2015) Commit: A scalable approach to mining communication motifs from dynamic networks. In: SIGMOD, pp 475\u2013489","DOI":"10.1145\/2723372.2737791"},{"key":"1129_CR10","doi-asserted-by":"crossref","unstructured":"Thoma M, Cheng H, Gretton A, Han J, Kriegel H-P, Smola A, Song L, Yu PS, Yan X, Borgwardt K (2009) Near-optimal supervised feature selection among frequent subgraphs. In: SDM 2009, pp 1076\u20131087","DOI":"10.1137\/1.9781611972795.92"},{"issue":"1","key":"1129_CR11","first-page":"730","volume":"2","author":"MA Hasan","year":"2009","unstructured":"Hasan MA, Zaki MJ (2009) Output space sampling for graph patterns. PVLDB 2(1):730\u2013741","journal-title":"PVLDB"},{"key":"1129_CR12","doi-asserted-by":"crossref","unstructured":"Ranu S, Singh AK (2009) Graphsig: a scalable approach to mining significant subgraphs in large graph databases. In: ICDE","DOI":"10.1109\/ICDE.2009.133"},{"issue":"9","key":"1129_CR13","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1002\/minf.201100058","volume":"30","author":"S Ranu","year":"2011","unstructured":"Ranu S, Calhoun BT, Singh AK, Swamidass SJ (2011) Probabilistic substructure mining from small-molecule screens. Mol Inf 30(9):809\u2013815","journal-title":"Mol Inf"},{"key":"1129_CR14","doi-asserted-by":"crossref","first-page":"2537","DOI":"10.1021\/ci900035z","volume":"49","author":"S Ranu","year":"2009","unstructured":"Ranu S, Singh AK (2009) Mining statistically significant molecular substructures for efficient molecular classification. J Chem Inf Model 49:2537\u20132550","journal-title":"J Chem Inf Model"},{"key":"1129_CR15","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: ICDM","DOI":"10.1109\/ICDM.2001.989534"},{"key":"1129_CR16","unstructured":"Nijssen S, Kok JN (2004) The Gaston tool for frequent subgraph mining. In: Proceedings of the international workshop on graph-based tools"},{"key":"1129_CR17","doi-asserted-by":"crossref","unstructured":"Yan X, Cheng H, Han J, Yu PS (2008) Mining significant graph patterns by scalable leap search. In: SIGMOD","DOI":"10.1145\/1376616.1376662"},{"key":"1129_CR18","doi-asserted-by":"crossref","unstructured":"Jin N, Young C, Wang W (2010) Gaia: graph classification using evolutionary computation. In: SIGMOD","DOI":"10.1145\/1807167.1807262"},{"key":"1129_CR19","doi-asserted-by":"crossref","unstructured":"Cheng H, Lo D, Zhou Y, Wang X, Yan X (2009) Identifying bug signatures using discriminative graph mining, In: Proceedings of the eighteenth international symposium on software testing and analysis, pp 141\u2013152","DOI":"10.1145\/1572272.1572290"},{"key":"1129_CR20","doi-asserted-by":"crossref","first-page":"e1002180","DOI":"10.1371\/journal.pcbi.1002180","volume":"7","author":"J Dutkowski","year":"2011","unstructured":"Dutkowski J, Ideker T (2011) Protein networks as logic functions in development and cancer. PLoS Comput Biol 7:e1002180","journal-title":"PLoS Comput Biol"},{"key":"1129_CR21","doi-asserted-by":"crossref","unstructured":"Hasan MA, Chaoji V, Salem S, Besson J, Zaki MJ (2007) Origami: mining representative orthogonal graph patterns. In: ICDM, pp 153\u2013162","DOI":"10.1109\/ICDM.2007.45"},{"key":"1129_CR22","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) Closegraph: mining closed frequent graph patterns. In: KDD, pp 286\u2013295","DOI":"10.1145\/956750.956784"},{"issue":"1","key":"1129_CR23","first-page":"25","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng Z, Tung AKH, Wang J, Feng J, Zhou L (2009) Comparing stars: on approximating graph edit distance. PVLDB 2(1):25\u201336","journal-title":"PVLDB"},{"key":"1129_CR24","doi-asserted-by":"crossref","unstructured":"Zhang S, Yang J, Li S (2009) Ring: an integrated method for frequent representative subgraph mining, In: ICDM, pp 1082\u20131087","DOI":"10.1109\/ICDM.2009.96"},{"key":"1129_CR25","doi-asserted-by":"crossref","unstructured":"Natarajan D, Ranu S (2016) A scalable and generic framework to mine top-k representative subgraph patterns. In: 2016 IEEE 16th international conference on data mining (ICDM). IEEE, pp 370\u2013379","DOI":"10.1109\/ICDM.2016.0048"},{"key":"1129_CR26","unstructured":"Metwally A, Agrawal D, El\u00a0Abbadi A (2005) Efficient computation of frequent and top-k elements in data streams. In: ICDT, pp 398\u2013412"},{"key":"1129_CR27","doi-asserted-by":"crossref","unstructured":"Ranu S, Hoang M, Singh A (2014) Answering top-k representative queries on graph databases. In: SIGMOD, pp 1163\u20131174","DOI":"10.1145\/2588555.2610524"},{"issue":"1","key":"1129_CR28","first-page":"13","volume":"6","author":"M Drosou","year":"2012","unstructured":"Drosou M, Pitoura E (2012) Disc diversity: result diversification based on dissimilarity and coverage. PVLDB 6(1):13\u201324","journal-title":"PVLDB"},{"issue":"8","key":"1129_CR29","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","volume":"23","author":"G Cornuejols","year":"1977","unstructured":"Cornuejols G, Fisher ML, Nemhauser GL (1977) Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Manag Sci 23(8):789\u2013810","journal-title":"Manag Sci"},{"key":"1129_CR30","unstructured":"He H, Singh AK (2006) Closure-tree: an index structure for graph queries. In: ICDE"},{"key":"1129_CR31","unstructured":"Page L, Brin S, Motwani R, Winograd T (1998) The pagerank citation ranking: bringing order to the web. In: WWW, pp 161\u2013172"},{"issue":"1","key":"1129_CR32","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01205239","volume":"92","author":"R Pemantle","year":"1992","unstructured":"Pemantle R (1992) Vertex-reinforced random walk. Probab Theory Relat Fields 92(1):117\u2013136","journal-title":"Probab Theory Relat Fields"},{"key":"1129_CR33","doi-asserted-by":"crossref","unstructured":"Badrinath R, Madhavan CEV (2012) Diversity in ranking using negative reinforcement. In: Proceedings of the ACM SIGKDD workshop on mining data semantics, vol 11, no 1\u201311, p 6","DOI":"10.1145\/2350190.2350201"},{"key":"1129_CR34","doi-asserted-by":"crossref","unstructured":"Mei Q, Guo J, Radev D (2010) Divrank: the interplay of prestige and diversity in information networks. In: KDD","DOI":"10.1145\/1835804.1835931"},{"key":"1129_CR35","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J, Yang J (2004) Spin: mining maximal frequent subgraphs from graph databases. In: KDD, pp 581\u2013586","DOI":"10.1145\/1014052.1014123"},{"key":"1129_CR36","doi-asserted-by":"crossref","unstructured":"Thomas L, Valluri S, Karlapalem K (2006) Margin: maximal frequent subgraph mining. In: ICDM, pp 1097\u20131101","DOI":"10.1109\/ICDM.2006.102"},{"key":"1129_CR37","doi-asserted-by":"crossref","unstructured":"Krishnan A, Padmanabhan D, Ranu S, Mehta S (2016) Select, link and rank: diversified query expansion and entity ranking using wikipedia. In: International conference on web information systems engineering, pp 157\u2013173","DOI":"10.1007\/978-3-319-48740-3_11"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1129-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1129-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1129-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T16:08:16Z","timestamp":1570291696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1129-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,8]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["1129"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1129-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2017,11,8]]}}}