{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T22:24:38Z","timestamp":1791239078856,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642136719","type":"print"},{"value":"9783642136726","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13672-6_15","type":"book-chapter","created":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T14:38:17Z","timestamp":1274193497000},"page":"147-159","source":"Crossref","is-referenced-by-count":13,"title":["Finding Itemset-Sharing Patterns in a Large Itemset-Associated Graph"],"prefix":"10.1007","author":[{"given":"Mutsumi","family":"Fukuzaki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mio","family":"Seki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hisashi","family":"Kashima","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Sese","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. Very Large Data Bases, VLDB, pp. 487\u2013499 (1994)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD \u201900, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H. Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov.\u00a01(3), 259\u2013289 (1997)","journal-title":"Data Min. Knowl. Discov."},{"key":"15_CR4","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":"15_CR5","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM 2001, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"15_CR6","unstructured":"Yan, X., Han, J.: gspan: Graph-based substructure pattern mining. In: ICDM \u201902, pp. 721 (2002)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Basu, S., Bilenko, M., Mooney, R.J.: A probabilistic framework for semi-supervised clustering. In: KDD \u201904, pp. 59\u201368 (2004)","DOI":"10.1145\/1014052.1014062"},{"issue":"16","key":"15_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1093\/bioinformatics\/btn293","volume":"24","author":"K. Hashimoto","year":"2008","unstructured":"Hashimoto, K., Takigawa, I., Shiga, M., Kanehisa, M., Mamitsuka, H.: Incorporating gene functions as priors in model-based clustering of microarray gene expression data. Bioinformatics\u00a024(16), i167\u2013i173 (2008)","journal-title":"Bioinformatics"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Shiga, M., Takigawa, I., Mamitsuka, H.: A spectral clustering approach to optimally combining numerical vectors with a modular network. In: KDD \u201907, pp. 647\u2013656 (2007)","DOI":"10.1145\/1281192.1281262"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Bayardo, R.: Efficiently mining long patterns from databases. In: SIGMOD \u201998, pp. 85\u201393 (1998)","DOI":"10.1145\/276304.276313"},{"issue":"12","key":"15_CR11","doi-asserted-by":"crossref","first-page":"4241","DOI":"10.1091\/mbc.11.12.4241","volume":"11","author":"A.P. Gasch","year":"2000","unstructured":"Gasch, A.P., et al.: Genomic expression programs in the response of yeast cells to environmental changes. Mol. Biol. Cell\u00a011(12), 4241\u20134257 (2000)","journal-title":"Mol. Biol. Cell"},{"key":"15_CR12","unstructured":"Knowledge Discovery Laboratory, University of Massachusetts Amherst: The Proximity DBLP database, http:\/\/kdl.cs.umass.edu\/data\/dblp\/dblp-info.html"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: KDD \u201904, pp. 581\u2013586 (2004)","DOI":"10.1145\/1014052.1014123"},{"key":"15_CR14","unstructured":"Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in knowledge discovery and data mining, pp. 307\u2013328 (1996)"},{"issue":"4","key":"15_CR15","first-page":"462","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE TKDE\u00a017(4), 462\u2013478 (2005)","journal-title":"IEEE TKDE"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Ulitsky, I., Shamir, R.: Identification of functional modules using network topology and high throughput data. BMC Systems Biology\u00a01 (2007)","DOI":"10.1186\/1752-0509-1-8"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Moser, F., Colak, R., Rafiey, A., Ester, M.: Mining cohesive patterns from graphs with feature vectors. In: SDM \u201909 (2009)","DOI":"10.1137\/1.9781611972795.51"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Seki, M., Sese, J.: Identification of active biological networks and common expression conditions. In: BIBE \u201908 (2008)","DOI":"10.1109\/BIBE.2008.4696746"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13672-6_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:41:36Z","timestamp":1606185696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13672-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642136719","9783642136726"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13672-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}