{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:24:53Z","timestamp":1745987093680,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642374005"},{"type":"electronic","value":"9783642374012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37401-2_9","type":"book-chapter","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T04:03:25Z","timestamp":1363925005000},"page":"63-74","source":"Crossref","is-referenced-by-count":0,"title":["K Hops Frequent Subgraphs Mining for Large Attribute Graph"],"prefix":"10.1007","author":[{"given":"Haiwei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simeng","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanlong","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojie","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Yang, J., Zhang, S., Jin, W.: DELTA: Indexing and Querying Multi-labeled Graphs. In: The 20th ACM International Conference on Information and Knowledge Management (CIKM), pp. 1765\u20131774 (2011)","DOI":"10.1145\/2063576.2063832"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"220","DOI":"10.4304\/jsw.7.1.220-227","volume":"7","author":"M.R. Keyvanpour","year":"2012","unstructured":"Keyvanpour, M.R., Azizani, F.: Classification and Analysis of Frequent Subgraphs Mining Algorithms. Journal of Software\u00a07(1), 220\u2013227 (2012)","journal-title":"Journal of Software"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00778-010-0212-8","volume":"20","author":"C. James","year":"2011","unstructured":"James, C., Yiping, K., Ada, W.C.F., Jeffrey, X.Y.: Fast graph query processing with a low-cost index. The International Journal on Very Large Data Bases\u00a020(4), 521\u2013539 (2011)","journal-title":"The International Journal on Very Large Data Bases"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Koren, Y., North, S.C., Volinsky, C.: Measuring and extracting proximity in networks. In: The 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 245\u2013255 (2006)","DOI":"10.1145\/1150402.1150432"},{"key":"9_CR5","unstructured":"Meinl, T., Borgelt, C., Berthold, M.R.: Discriminative Closed Fragment Mining and Perfect Extensions in MoFa. In: The 2nd Starting AI Researchers\u2019 Symposium (STAIRS), pp. 3\u201314 (2004)"},{"issue":"10","key":"9_CR6","doi-asserted-by":"publisher","first-page":"2469","DOI":"10.1360\/jos182469","volume":"18","author":"X.T. Li","year":"2007","unstructured":"Li, X.T., Li, J.Z., Gao, H.: An Efficient Frequent Subgraph Mining Algorithm. Journal of Software\u00a018(10), 2469\u20132480 (2007)","journal-title":"Journal of Software"},{"issue":"3","key":"9_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(3), 321\u2013354 (2003)","journal-title":"Machine Learning"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent Subgraph Discovery. In: The 1st IEEE International Conference on Data Mining (ICDM), pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"9_CR9","unstructured":"Yan, X., Han, J.: GSpan: Graph-Based Substructure Pattern Mining. In: The 2nd IEEE International Conference on Data Mining (ICDM), pp. 721\u2013724 (2002)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Huan, J., Wang, W., Prins, J.: Efficient mining of frequent subgraph in the presence of isomorphism. In: The 3rd IEEE International Conference on Data Mining (ICDM), pp. 549\u2013552 (2003)","DOI":"10.1109\/ICDM.2003.1250974"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K. Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing\u00a027(4), 950\u2013959 (2009)","journal-title":"Image and Vision Computing"}],"container-title":["Lecture Notes in Computer Science","Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37401-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:26:57Z","timestamp":1745976417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37401-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374005","9783642374012"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37401-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}