{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T15:42:47Z","timestamp":1780760567617,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319118116","type":"print"},{"value":"9783319118123","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11812-3_10","type":"book-chapter","created":{"date-parts":[[2014,9,27]],"date-time":"2014-09-27T03:03:16Z","timestamp":1411786996000},"page":"111-122","source":"Crossref","is-referenced-by-count":4,"title":["Mining Cohesive Itemsets in Graphs"],"prefix":"10.1007","author":[{"given":"Tayena","family":"Hendrickx","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boris","family":"Cule","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abdulrehman, D., Monteiro, P.T., Teixeira, M.C., Mira, N.P., Louren\u00e7o, A.B., dos Santos, S.C., Cabrito, T.R., Francisco, A.P., Madeira, S.C., Aires, R.S., Oliveira, A.L., S\u00e1-Correia, I., Freitas, A.T.: YEASTRACT: providing a programmatic access to curated transcriptional regulatory associations in Saccharomyces cerevisiae through a web services interface. Nucleic Acids Research\u00a039 (2011)","DOI":"10.1093\/nar\/gkq964"},{"key":"10_CR2","series-title":"LNAI","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)"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1093\/nar\/26.1.73","volume":"26","author":"J. Cherry","year":"1998","unstructured":"Cherry, J.: SGD: Saccharomyces Genome Database. Nucleic Acids Research\u00a026(1), 73\u201379 (1998)","journal-title":"Nucleic Acids Research"},{"key":"10_CR4","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":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-37453-1_20","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B. Cule","year":"2013","unstructured":"Cule, B., Goethals, B., Hendrickx, T.: Mining interesting itemsets in graph datasets. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS, vol.\u00a07818, pp. 237\u2013248. Springer, Heidelberg (2013)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"Dehaspe, L., Toivonen, H.: Discovery of frequent datalog patterns. Data Mining and Knowledge Discovery\u00a03, 7\u201336 (1999)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10_CR7","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 (2011)","DOI":"10.1145\/1989323.1989421"},{"key":"10_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":"10_CR9","series-title":"LNAI","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":"10_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":"10_CR11","doi-asserted-by":"crossref","unstructured":"Karunaratne, T., Bostr\u00f6m, H.: Can frequent itemset mining be efficiently and effectively used for learning from graph data? In: Proc. of the 11th Int. Conf. on Machine Learning and Applications (ICMLA), pp. 409\u2013414 (2012)","DOI":"10.1109\/ICMLA.2012.74"},{"key":"10_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 (2010)","DOI":"10.1145\/1807167.1807261"},{"key":"10_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":"10_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":"10_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.: 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":"10_CR16","doi-asserted-by":"crossref","unstructured":"Silva, A., Meira, J.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 (2010)","DOI":"10.1145\/1830252.1830268"},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"466","DOI":"10.14778\/2140436.2140443","volume":"5","author":"A. Silva","year":"2012","unstructured":"Silva, A., Meira, J.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":"10_CR18","doi-asserted-by":"crossref","unstructured":"The Gene Ontology Consortium: Gene Ontology annotations and resources. Nucleic Acids Research 41(Database issue), D530\u2013D535 (2013)","DOI":"10.1093\/nar\/gks1050"},{"key":"10_CR19","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":"10_CR20","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":"10_CR21","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: Closegraph: Mining closed frequent graph patterns. In: Proc. of the 9th ACM SIGKDD Int. Conf. on Knowledge Discovery in Data Mining, pp. 286\u2013295 (2003)","DOI":"10.1145\/956755.956784"},{"key":"10_CR22","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":"10_CR23","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","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11812-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T21:49:06Z","timestamp":1746395346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11812-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319118116","9783319118123"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11812-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}