{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T07:10:11Z","timestamp":1789974611727,"version":"4.0.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540231080","type":"print"},{"value":"9783540301165","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30116-5_33","type":"book-chapter","created":{"date-parts":[[2010,9,18]],"date-time":"2010-09-18T03:34:59Z","timestamp":1284780899000},"page":"349-361","source":"Crossref","is-referenced-by-count":6,"title":["Using a Hash-Based Method for Apriori-Based Graph Mining"],"prefix":"10.1007","author":[{"given":"Phu Chien","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takashi","family":"Washio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kouzou","family":"Ohara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB Conference, pp. 487\u2013499 (1994)"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Berthold, M.R.: Mining molecular fragments: Finding relevant substructures of molecules. In: Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM 2002), pp. 51\u201358 (2002)","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"33_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":"33_CR4","volume-title":"Graph Theory","author":"R. Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, New York (2000)"},{"key":"33_CR5","unstructured":"Fortin, S.: The graph isomorphism problem. Technical Report 96-20, University of Alberta, Edmonton, Alberta, Canada (1996)"},{"key":"33_CR6","unstructured":"Inokuchi, A., Washio, T., Nishimura, K., Motoda, H.: A fast algorithm for mining frequent connected subgraphs. IBM Research Report RT0448, Tokyo Research Laboratory, IBM Japan (2002)"},{"key":"33_CR7","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":"33_CR8","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1021\/jm00106a046","volume":"34","author":"A.K. Debnath","year":"1991","unstructured":"Debnath, A.K., et al.: Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity. Journal of Medical Chemistry\u00a034, 786\u2013797 (1991)","journal-title":"Journal of Medical Chemistry"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proceedings of the 1st IEEE International Conference on Data Mining (ICDM 2001), pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"5","key":"33_CR10","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1109\/69.634757","volume":"9","author":"J.S. Park","year":"1997","unstructured":"Park, J.S., Chen, M.-.S., Yu, P.S.: Using a hash-based method with transaction trimming for mining association rules. IEEE Trans. Knowledge and Data Engineering\u00a09(5), 813\u2013825 (1997)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"issue":"1","key":"33_CR11","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. SIGKDD Explorations\u00a05(1), 59\u201368 (2003)","journal-title":"SIGKDD Explorations"},{"key":"33_CR12","unstructured":"Yan, X., Han, J.: gSpan: Graph-based structure pattern mining. In: Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM 2002), pp. 721\u2013724 (2002)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Yoshida, K., Motoda, H.: CLIP: Concept learning from inference patterns. Artificial Intelligence\u00a075(1), 63\u201392","DOI":"10.1016\/0004-3702(94)00066-A"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30116-5_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:41:02Z","timestamp":1605760862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30116-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231080","9783540301165"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30116-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}