{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:05:36Z","timestamp":1746072336633,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374524"},{"type":"electronic","value":"9783642374531"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37453-1_20","type":"book-chapter","created":{"date-parts":[[2013,4,6]],"date-time":"2013-04-06T12:58:56Z","timestamp":1365253136000},"page":"237-248","source":"Crossref","is-referenced-by-count":2,"title":["Mining Interesting Itemsets in Graph Datasets"],"prefix":"10.1007","author":[{"given":"Boris","family":"Cule","sequence":"first","affiliation":[]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[]},{"given":"Tayena","family":"Hendrickx","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. of the 20th Int. Conf. on Very Large Data Bases, pp. 487\u2013499 (1994)"},{"key":"20_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1007\/978-3-540-68125-0_84","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B. Bringmann","year":"2008","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 858\u2013863. Springer, Heidelberg (2008)"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D.J. Cook","year":"1994","unstructured":"Cook, D.J., Holder, L.B.: Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research\u00a01, 231\u2013255 (1994)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"20_CR4","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-13657-3_33","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B. Cule","year":"2010","unstructured":"Cule, B., Goethals, B.: Mining association rules in long sequences. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part I. LNCS (LNAI), vol.\u00a06118, pp. 300\u2013309. Springer, Heidelberg (2010)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Cule, B., Goethals, B., Robardet, C.: A new constraint for mining sets in sequences. In: Proc. of the 9th SIAM Int. Conf. on Data Mining, pp. 317\u2013328 (2009)","DOI":"10.1137\/1.9781611972795.28"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Guan, Z., Wu, J., Zhang, Q., Singh, A., Yan, X.: Assessing and ranking structural correlations in graphs. In: Proc. of the 2011 ACM SIGMOD Int. Conf. on Management of Data, pp. 937\u2013948. ACM (2011)","DOI":"10.1145\/1989323.1989421"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of the 2000 ACM SIGMOD Int. Conf. on Management of Data, vol.\u00a029, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: Proc. of the 10th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 581\u2013586 (2004)","DOI":"10.1145\/1014052.1014123"},{"key":"20_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1021726221443","volume":"50","author":"A. Inokuchi","year":"2003","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning\u00a050, 321\u2013354 (2003)","journal-title":"Machine Learning"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Khan, A., Li, N., Yan, X., Guan, Z., Chakraborty, S., Tao, S.: Neighborhood based fast graph search in large networks. In: Proc. of the 2011 ACM SIGMOD Int. Conf. on Management of Data, pp. 901\u2013912. ACM (2011)","DOI":"10.1145\/1989323.1989418"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Khan, A., Yan, X., Wu, K.-L.: Towards proximity pattern mining in large graphs. In: Proc. of the 2010 ACM SIGMOD Int. Conf. on Management of Data, pp. 867\u2013878. ACM (2010)","DOI":"10.1145\/1807167.1807261"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. of the 2001 IEEE Int. Conf. on Data Mining, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M. Kuramochi","year":"2005","unstructured":"Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Mining and Knowledge Discovery\u00a011, 243\u2013271 (2005)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","volume":"127","author":"S. Nijssen","year":"2005","unstructured":"Nijssen, S., Kok, J.N.: The gaston tool for frequent subgraph mining. Electronic Notes in Theoretical Computer Science\u00a0127, 77\u201387 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Silva Jr., A., Meira, W., Zaki, M.J.: Structural correlation pattern mining for large graphs. In: Proc. of the 8th Workshop on Mining and Learning with Graphs, pp. 119\u2013126. ACM (2010)","DOI":"10.1145\/1830252.1830268"},{"issue":"5","key":"20_CR17","doi-asserted-by":"crossref","first-page":"466","DOI":"10.14778\/2140436.2140443","volume":"5","author":"A. Silva Jr.","year":"2012","unstructured":"Silva Jr., A., Meira, W., Zaki, M.J.: Mining attribute-structure correlated patterns in large attributed graphs. Proc. of the VLDB Endowment\u00a05(5), 466\u2013477 (2012)","journal-title":"Proc. of the VLDB Endowment"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T. Washio","year":"2003","unstructured":"Washio, T., Motoda, H.: State of the art of graph-based data mining. ACM SIGKDD Explorations Newsletter\u00a05, 59\u201368 (2003)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"20_CR19","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: Proc. of the 2002 IEEE Int. Conf. on Data Mining, pp. 721\u2013724 (2002)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Yan, X., Zhou, X., Han, J.: Mining closed relational graphs with connectivity constraints. In: Proc. of the 11th ACM SIGKDD Int. Conf. on Knowledge Discovery in Data Mining, pp. 324\u2013333 (2005)","DOI":"10.1145\/1081870.1081908"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00872095","volume":"4","author":"K. Yoshida","year":"1994","unstructured":"Yoshida, K., Motoda, H., Indurkhya, N.: Graph-based induction as a unified learning framework. Journal of Applied Intelligence\u00a04, 297\u2013316 (1994)","journal-title":"Journal of Applied Intelligence"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37453-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T03:28:26Z","timestamp":1745983706000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37453-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374524","9783642374531"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37453-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}