{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:32:45Z","timestamp":1754109165039,"version":"3.40.3"},"publisher-location":"London","reference-count":20,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9780857291295"},{"type":"electronic","value":"9780857291301"}],"license":[{"start":{"date-parts":[[2010,10,29]],"date-time":"2010-10-29T00:00:00Z","timestamp":1288310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,10,29]],"date-time":"2010-10-29T00:00:00Z","timestamp":1288310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-85729-130-1_5","type":"book-chapter","created":{"date-parts":[[2010,11,11]],"date-time":"2010-11-11T19:14:28Z","timestamp":1289502868000},"page":"65-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the Usefulness of Weight-Based Constraints in Frequent Subgraph Mining"],"prefix":"10.1007","author":[{"given":"Frank","family":"Eichinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Huber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klemens","family":"B\u00f6hm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,29]]},"reference":[{"unstructured":"Eichinger, F., B\u00f6hm, K., Huber, M.: Mining Edge-Weighted Call Graphs to Localise Software Bugs. In: ECML PKDD (2008)","key":"5_CR1"},{"doi-asserted-by":"crossref","unstructured":"Eichinger, F., Huber, M., B\u00f6hm, K.: On the Usefulness of Weight-Based Constraints in Frequent Subgraph Mining. Tech. Rep. 2010-10, Faculty of Informatics, Karlsruhe Institute of Technology. digbib.ubka.uni-karlsruhe.de\/volltexte\/1000017769","key":"5_CR2","DOI":"10.1007\/978-0-85729-130-1_5"},{"doi-asserted-by":"crossref","unstructured":"Hasan, M.A., Chaoji, V., Salem, S., Besson, J., Zaki, M.J.: ORIGAMI: Mining Representative Orthogonal Graph Patterns. In: ICDM (2007)","key":"5_CR3","DOI":"10.1109\/ICDM.2007.45"},{"issue":"3","key":"5_CR4","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. Mach. Learn. 50(3), 321\u2013354 (2003)","journal-title":"Mach. Learn."},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.knosys.2009.11.010","volume":"23","author":"C. Jiang","year":"2010","unstructured":"Jiang, C., Coenen, F., Sanderson, R., Zito, M.: Text Classification using Graph Mining-based Feature Extraction. Knowl.-Based Syst. 23(4), 302\u2013308 (2010)","journal-title":"Knowl.-Based Syst."},{"unstructured":"Jiang,W., Vaidya, J., Balaporia, Z., Clifton, C., Banich, B.: Knowledge Discovery from Transportation Network Data. In: ICDE (2005)","key":"5_CR6"},{"unstructured":"Kudo, T., Maeda, E., Matsumoto, Y.: An Application of Boosting to Graph Classification. In: NIPS (2004)","key":"5_CR7"},{"doi-asserted-by":"crossref","unstructured":"Ng, R.T., Lakshmanan, L.V.S., Han, J., Pang, A.: Exploratory Mining and Pruning Optimizations of Constrained Associations Rules. In: SIGMOD (1998)","key":"5_CR8","DOI":"10.1145\/276304.276307"},{"doi-asserted-by":"crossref","unstructured":"Nowozin, S., Tsuda, K., Uno, T., Kudo, T., Bakir, G.: Weighted Substructure Mining for Image Analysis. In: Conf. on Computer Vision and Pattern Recognition (CVPR) (2007)","key":"5_CR9","DOI":"10.1109\/CVPR.2007.383171"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/B:DAMI.0000023674.74932.4c","volume":"8","author":"J. Pei","year":"2004","unstructured":"Pei, J., Han, J., Lakshmanan, L.V.S.: Pushing Convertible Constraints in Frequent Itemset Mining. Data Min. Knowl. Discov. 8(3), 227\u2013252 (2004)","journal-title":"Knowl. Discov."},{"unstructured":"Philippsen, M., et al.: ParSeMiS: The Parallel and Sequential Mining Suite. Available at www2.informatik.uni-erlangen.de\/EN\/research\/ParSeMiS\/","key":"5_CR11"},{"unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann (1993)","key":"5_CR12"},{"doi-asserted-by":"crossref","unstructured":"Saigo, H., Kr\u00e4mer, N., Tsuda, K.: Partial Least Squares Regression for Graph Mining. In: KDD (2008)","key":"5_CR13","DOI":"10.1145\/1401890.1401961"},{"doi-asserted-by":"crossref","unstructured":"Wang, C., Zhu, Y., Wu, T., Wang, W., Shi, B.: Constraint-Based Graph Mining in Large Database. In: Asia-Pacific Web Conf. (APWeb) (2005)","key":"5_CR14","DOI":"10.1007\/978-3-540-31849-1_14"},{"unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann (2005)","key":"5_CR15"},{"doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining Significant Graph Patterns by Leap Search. In: SIGMOD (2008)","key":"5_CR16","DOI":"10.1145\/1376616.1376662"},{"unstructured":"Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: ICDM (2002)","key":"5_CR17"},{"doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: Mining Closed Frequent Graph Patterns. In: KDD (2003)","key":"5_CR18","DOI":"10.1145\/956750.956784"},{"doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: Discovery of Frequent Substructures. In: D.J. Cook, L.B. Holder (eds.) Mining Graph Data, chap. 5, pp. 99\u2013115. Wiley (2006)","key":"5_CR19","DOI":"10.1002\/9780470073049.ch5"},{"unstructured":"Zhu, F., Yan, X., Han, J., Yu, P.S.: gPrune: A Constraint Pushing Framework for Graph Pattern Mining. In: PAKDD (2007)","key":"5_CR20"}],"container-title":["Research and Development in Intelligent Systems XXVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-85729-130-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T22:21:48Z","timestamp":1674080508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-85729-130-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,29]]},"ISBN":["9780857291295","9780857291301"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-0-85729-130-1_5","relation":{},"subject":[],"published":{"date-parts":[[2010,10,29]]},"assertion":[{"value":"29 October 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}