{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:31:17Z","timestamp":1760596277356,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,5,2]],"date-time":"2016-05-02T00:00:00Z","timestamp":1462147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-2010-COSI-012-01"],"award-info":[{"award-number":["ANR-2010-COSI-012-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10115-016-0953-9","type":"journal-article","created":{"date-parts":[[2016,5,2]],"date-time":"2016-05-02T06:56:14Z","timestamp":1462172174000},"page":"569-584","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Attributed graph mining in the presence of automorphism"],"prefix":"10.1007","volume":"50","author":[{"given":"Claude","family":"Pasquier","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Flouvat","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00e9my","family":"Sanhes","sequence":"additional","affiliation":[]},{"given":"Nazha","family":"Selmaoui-Folcher","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,2]]},"reference":[{"issue":"2","key":"953_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. SIGMOD Rec 22(2):207\u2013216","journal-title":"SIGMOD Rec"},{"key":"953_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: ICDE\u201995, pp\u00a03\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"953_CR3","doi-asserted-by":"crossref","unstructured":"Ayres J, Flannick J, Gehrke J, Yiu T (2002) Sequential pattern mining using a bitmap representation. In: KDD\u201902, pp\u00a0429\u2013435","DOI":"10.1145\/775047.775109"},{"key":"953_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/978-3-540-70981-7_38","volume-title":"Advances in data analysis","author":"C Borgelt","year":"2007","unstructured":"Borgelt C (2007) Canonical forms for frequent graph mining. In: Decker R, Lenz H-J (eds) Advances in data analysis. Springer, Berlin, pp 337\u2013349"},{"key":"953_CR5","doi-asserted-by":"crossref","unstructured":"Borgelt C, Berthold M (2002) Mining molecular fragments: finding relevant substructures of molecules. In: ICDM\u201902, pp\u00a051\u201358","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"953_CR6","doi-asserted-by":"crossref","unstructured":"Bringmann B, Nijssen S (2008) What is frequent in a single graph?. In: PAKDD\u201908, pp\u00a0858\u2013863","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"953_CR7","doi-asserted-by":"crossref","unstructured":"Chi Y, Yang Y, Xia Y, Muntz RR (2004) Cmtreeminer: mining both closed and maximal frequent subtrees. In: PAKDD\u201904, pp\u00a063\u201373","DOI":"10.1007\/978-3-540-24775-3_9"},{"key":"953_CR8","doi-asserted-by":"crossref","unstructured":"Fukuzaki M, Seki M, Kashima H, Sese J (2010) Finding itemset-sharing patterns in a large itemset-associated graph. In: PAKDD\u201910, pp\u00a0147\u2013159","DOI":"10.1007\/978-3-642-13672-6_15"},{"key":"953_CR9","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraphs in the presence of isomorphism. In: ICDM\u201905, pp\u00a0549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"953_CR10","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: PKDD\u201900, pp\u00a013\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"issue":"3","key":"953_CR11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A Inokuchi","year":"2003","unstructured":"Inokuchi A, Washio T, Motoda H (2003) Complete mining of frequent patterns from graphs: mining graph data. Mach Learn 50(3):321\u2013354","journal-title":"Mach Learn"},{"key":"953_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang C, Coenen F, Zito M (2013) A survey of frequent subgraph mining algorithms. Knowl Eng Rev 28:75\u2013105","journal-title":"Knowl Eng Rev"},{"issue":"1","key":"953_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/107005.107032","volume":"23","author":"R Johnsonbaugh","year":"1991","unstructured":"Johnsonbaugh R, Kalin M (1991) A graph generation software package. SIGCSE Bull 23(1):151\u2013154","journal-title":"SIGCSE Bull"},{"key":"953_CR14","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: ICDM\u201901, pp\u00a0313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"9","key":"953_CR15","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M Kuramochi","year":"2004","unstructured":"Kuramochi M, Karypis G (2004) An efficient algorithm for discovering frequent subgraphs. IEEE Trans Knowl Data Eng 16(9):1038\u20131051","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"953_CR16","unstructured":"Mannila H, Toivonen H (2005) Multiple uses of frequent sets and condensed representations. In: KDD\u201905, pp\u00a0189\u2013194"},{"key":"953_CR17","first-page":"548","volume":"25","author":"J McAuley","year":"2012","unstructured":"McAuley J, Leskovec J (2012) Learning to discover social circles in ego networks. Neural Inf Process Syst 25:548\u2013556","journal-title":"Neural Inf Process Syst"},{"key":"953_CR18","doi-asserted-by":"crossref","unstructured":"Miyoshi Y, Ozaki T, Ohkawa T (2009) Frequent pattern discovery from a single graph with quantitative itemsets. In: ICDMW\u201909, pp\u00a0527\u2013532","DOI":"10.1109\/ICDMW.2009.11"},{"issue":"3","key":"953_CR19","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10115-015-0831-x","volume":"46","author":"C Pasquier","year":"2015","unstructured":"Pasquier C, Sanhes J, Flouvat F, Selmaoui-Folcher N (2015) Frequent pattern mining in attributed trees: algorithms and applications. Knowl Inf Syst 46(3):491\u2013514","journal-title":"Knowl Inf Syst"},{"key":"953_CR20","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: ICDT\u201999, pp\u00a0398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"953_CR21","doi-asserted-by":"crossref","unstructured":"W\u00f6rlein M, Meinl T, Fischer I, Philippsen M (2005) A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston. In: PKDD\u201905, pp\u00a0392\u2013403","DOI":"10.1007\/11564126_39"},{"key":"953_CR22","unstructured":"Yan X, Han J (2002) gspan: graph-based substructure pattern mining. In: ICDM\u201902, pp\u00a0721\u2013724"},{"key":"953_CR23","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph: mining closed frequent graph patterns. In: KDD\u201903, pp\u00a0286\u2013295","DOI":"10.1145\/956750.956784"},{"key":"953_CR24","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: SIGMOD conference, pp\u00a0335\u2013346","DOI":"10.1145\/1007568.1007607"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0953-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-016-0953-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0953-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-016-0953-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:11:20Z","timestamp":1559110280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-016-0953-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,2]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["953"],"URL":"https:\/\/doi.org\/10.1007\/s10115-016-0953-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2016,5,2]]}}}