{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:17:29Z","timestamp":1772846249780,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642159381","type":"print"},{"value":"9783642159398","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15939-8_14","type":"book-chapter","created":{"date-parts":[[2010,8,18]],"date-time":"2010-08-18T07:54:25Z","timestamp":1282118065000},"page":"213-228","source":"Crossref","is-referenced-by-count":14,"title":["Online Structural Graph Clustering Using Frequent Subgraph Mining"],"prefix":"10.1007","author":[{"given":"Madeleine","family":"Seeland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Girschick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Buchwald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An APriori-based algorithm for mining frequent substructures from graph data. In: PKDD \u201900: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, pp. 13\u201323 (2000)","DOI":"10.1007\/3-540-45372-5_2"},{"key":"14_CR2","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining, pp. 721\u2013724 (2002)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1145\/1143844.1143964","volume-title":"ICML 2006","author":"K. Tsuda","year":"2006","unstructured":"Tsuda, K., Kudo, T.: Clustering Graphs by Weighted Substructure Mining. In: Cohen, W.W., Moore, A. (eds.) ICML 2006, pp. 953\u2013960. ACM Press, New York (2006)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1021\/ci050011h","volume":"45","author":"M. Stahl","year":"2005","unstructured":"Stahl, M., Mauser, H.: Database clustering with a combination of fingerprint and maximum common substructure methods. J. Chem. Inf. Model.\u00a045, 542\u2013548 (2005)","journal-title":"J. Chem. Inf. Model."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Tsuda, K., Kurihara, K.: Graph mining with variational Dirichlet process mixture models. In: Proceedings of the 8th SIAM International Conference on Data Mining, pp. 432\u2013442 (2008)","DOI":"10.1137\/1.9781611972788.39"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"4350","DOI":"10.1021\/jm020155c","volume":"45","author":"Y.C. Martin","year":"2002","unstructured":"Martin, Y.C., Kofron, J.L., Traphagen, L.M.: Do structurally similar molecules have similar biological activity? J. Med. Chem.\u00a045, 4350\u20134358 (2002)","journal-title":"J. Med. Chem."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1126\/science.1411538","volume":"258","author":"J. Weinstein","year":"1992","unstructured":"Weinstein, J., Kohn, K., Grever, M., Viswanadhan, V.: Neural computing in cancer drug development: Predicting mechanism of action. Science\u00a0258, 447\u2013451 (1992)","journal-title":"Science"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1002\/sim.4780130532","volume":"13","author":"A.D. Koutsoukos","year":"1994","unstructured":"Koutsoukos, A.D., Rubinstein, L.V., Faraggi, D., Simon, R.M., Kalyandrug, S., Weinstein, J.N., Kohn, K.W., Paull, K.D.: Discrimination techniques applied to the NCI in vitro anti-tumour drug screen: predicting biochemical mechanism of action. Stat. Med.\u00a013, 719\u2013730 (1994)","journal-title":"Stat. Med."},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1016387816342","volume":"16","author":"J.W. Raymond","year":"2002","unstructured":"Raymond, J.W., Willett, P.: Effectiveness of graph-based and fingerprint-based similarity measures for virtual screening of 2D chemical structure databases. J. Comput. Aided. Mol. Des.\u00a016(1), 59\u201371 (2002)","journal-title":"J. Comput. Aided. Mol. Des."},{"issue":"3","key":"14_CR10","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1021\/ci960151e","volume":"37","author":"M.J. McGregor","year":"1997","unstructured":"McGregor, M.J., Pallai, P.V.: Clustering of large databases of compounds: Using the MDL \u201dkeys\u201d as structural descriptors. J. Chem. Inform. Comput. Sci.\u00a037(3), 443\u2013448 (1997)","journal-title":"J. Chem. Inform. Comput. Sci."},{"key":"14_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11605126_6","volume-title":"Federation over the Web","author":"T. Yoshida","year":"2006","unstructured":"Yoshida, T., Shoda, R., Motoda, H.: Graph clustering based on structural similarity of fragments. In: Jantke, K.P., et al. (eds.) Federation over the Web. LNCS (LNAI), vol.\u00a03847, pp. 97\u2013114. Springer, Heidelberg (2006)"},{"issue":"8","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1016\/S0167-8655(02)00257-X","volume":"24","author":"S. G\u00fcnter","year":"2003","unstructured":"G\u00fcnter, S., Bunke, H.: Validation indices for graph clustering. Pattern Recogn. Lett.\u00a024(8), 1107\u20131113 (2003)","journal-title":"Pattern Recogn. Lett."},{"key":"14_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97966-8","volume-title":"Self-organizing maps","author":"T. Kohonen","year":"1997","unstructured":"Kohonen, T.: Self-organizing maps. Springer, Heidelberg (1997)"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1016\/j.ejor.2005.06.056","volume":"173","author":"Y.L. Chen","year":"2006","unstructured":"Chen, Y.L., Hu, H.L.: An overlapping cluster algorithm to provide non-exhaustive clustering. Eur. J. Oper. Res.\u00a0173(3), 762\u2013780 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"14_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S1093-3263(02)00188-2","volume":"21","author":"J.W. Raymond","year":"2003","unstructured":"Raymond, J.W., Blankley, C.J., Willett, P.: Comparison of chemical clustering methods using graph- and fingerprint-based similarity measures. J. Mol. Graph. Model.\u00a021(5), 421\u2013433 (2003)","journal-title":"J. Mol. Graph. Model."},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-70659-3_12","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"H. Bunke","year":"2002","unstructured":"Bunke, H., Foggia, P., Guidobaldi, C., Sansone, C., Vento, M.: A comparison of algorithms for maximum common subgraph on randomly connected graphs. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol.\u00a02396, pp. 123\u2013132. Springer, Heidelberg (2002)"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/1281192.1281201","volume-title":"KDD \u201907: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"C.C. Aggarwal","year":"2007","unstructured":"Aggarwal, C.C., Ta, N., Wang, J., Feng, J., Zaki, M.: XProj: a framework for projected structural clustering of XML documents. In: KDD \u201907: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 46\u201355. ACM, New York (2007)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Wang, K., Han, J.: Bide: Efficient mining of frequent closed sequences. In: International Conference on Data Engineering (2004)","DOI":"10.1109\/ICDE.2004.1319986"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15939-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:43:01Z","timestamp":1606185781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15939-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642159381","9783642159398"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15939-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}