{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:04:00Z","timestamp":1725552240794},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310181"},{"type":"electronic","value":"9783540325871"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605126_6","type":"book-chapter","created":{"date-parts":[[2005,12,22]],"date-time":"2005-12-22T06:27:52Z","timestamp":1135232872000},"page":"97-114","source":"Crossref","is-referenced-by-count":5,"title":["Graph Clustering Based on Structural Similarity of Fragments"],"prefix":"10.1007","author":[{"given":"Tetsuya","family":"Yoshida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryosuke","family":"Shoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Motoda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"21","key":"6_CR1","doi-asserted-by":"publisher","first-page":"11149","DOI":"10.1073\/pnas.200327197","volume":"97","author":"L.A.N. Amaral","year":"2000","unstructured":"Amaral, L.A.N., Scala, A., Barth\u00e9l\u00e9my, M., Stanley, H.E.: Classes of small-world networks. Proceedings of the National Academy of Sciences\u00a097(21), 11149\u201311152 (2000)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"6_CR2","volume-title":"Mining the Web: Discovering Knowledge from Hypertext Data","author":"S. Chakrabarti","year":"2002","unstructured":"Chakrabarti, S.: Mining the Web: Discovering Knowledge from Hypertext Data. Morgan Kaufmann, San Francisco (2002)"},{"key":"6_CR3","first-page":"261","volume":"3","author":"P. Clark","year":"1989","unstructured":"Clark, P., Niblett, T.: The cn2 induction algorithm. Machine Learning\u00a03, 261\u2013283 (1989)","journal-title":"Machine Learning"},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D.J. Cook","year":"2000","unstructured":"Cook, D.J., Holder, L.B.: Graph-based data mining. IEEE Intelligent Systems\u00a015(2), 32\u201341 (2000)","journal-title":"IEEE Intelligent Systems"},{"key":"6_CR5","unstructured":"Dehaspe, L., Toivonen, H., King, R.D.: Finding frequent substructures in chemical compound. In: Proc. the 4th International conference on Knowledge Discovery and Data Mining, pp. 30\u201336 (1998)"},{"issue":"3","key":"6_CR6","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":"6_CR7","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. of the 1st IEEE ICDM, pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/3-540-36182-0_44","volume-title":"Discovery Science","author":"T. Matsuda","year":"2002","unstructured":"Matsuda, T., Motoda, H., Yoshida, T., Washio, T.: Mining patterns from structured data by beam-wise graph-based induction. In: Lange, S., Satoh, K., Smith, C.H. (eds.) DS 2002. LNCS, vol.\u00a02534, pp. 422\u2013429. Springer, Heidelberg (2002)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Matsuda, T., Yoshida, T., Motoda, H., Washio, T.: Beam-wise graph-based induction for structured data mining. In: International Workshop on Active Mining (AM 2002): working notes, pp. 23\u201330 (2002)","DOI":"10.1007\/3-540-36182-0_44"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/B978-0-08-051055-2.50007-9","volume":"3","author":"R.S. Michalski","year":"1990","unstructured":"Michalski, R.S.: Learning flexible concepts: Fundamental ideas and a method based on two-tiered representaion. Machine Learning: An Artificial Intelligence Approach\u00a03, 63\u2013102 (1990)","journal-title":"Machine Learning: An Artificial Intelligence Approach"},{"issue":"20","key":"6_CR11","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S. Muggleton","year":"1994","unstructured":"Muggleton, S., de Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming\u00a019(20), 629\u2013679 (1994)","journal-title":"Journal of Logic Programming"},{"key":"6_CR12","unstructured":"Nomura, S., Miki, T., Ishida, T.: Comparative Study of Web Citation Analysis and Bibliographical Citation Analysis in Community Mining. IEICE Transaction\u00a0J87-D-I(3), 382\u2013389 (2004) (in Japanese)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Palmer, C.R., Gibbons, P.B., Faloutsos, C.: ANF: A fast and scalable tool for data mining in massive graphs. In: Proc. of the KDD 2002 (2002)","DOI":"10.1145\/775047.775059"},{"key":"6_CR14","first-page":"81","volume":"1","author":"J.R. Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Machine Learning\u00a01, 81\u2013106 (1986)","journal-title":"Machine Learning"},{"key":"6_CR15","volume-title":"C4.5:Programs For Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5:Programs For Machine Learning. Morgan Kaufmann Publishers, San Francisco (1993)"},{"issue":"5","key":"6_CR16","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. Molecular Graphics and Modelling\u00a021(5), 421\u2013433 (2003)","journal-title":"Molecular Graphics and Modelling"},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S1873-9776(98)80011-4","volume":"2","author":"Y. Takahashi","year":"1998","unstructured":"Takahashi, Y., Ohoka, H., Ishiyama, Y.: Structural similarity analysis based on topological fragement spectra. Adavances in Molecular Similarity\u00a02, 93\u2013104 (1998)","journal-title":"Adavances in Molecular Similarity"},{"key":"6_CR18","volume-title":"Small Worlds: The Dynamics of Networks Between Order and Randomness","author":"D.J. Watts","year":"2004","unstructured":"Watts, D.J.: Small Worlds: The Dynamics of Networks Between Order and Randomness. Princeton University Press, Princeton (2004)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D.J. Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature\u00a0393, 440\u2013442 (1998)","journal-title":"Nature"},{"key":"6_CR20","unstructured":"Yoshida, T., Warodom, G., Mogi, A., Ohara, K., Motoda, H., Washio, T., Yokoi, H., Takabayashi, K.: Preliminary analysis of interferon therapy by graph-based induction. In: Working note of International Workshop on Active Mining (AM 2004), pp. 31\u201340 (2004)"}],"container-title":["Lecture Notes in Computer Science","Federation over the Web"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605126_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:05:09Z","timestamp":1619492709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605126_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310181","9783540325871"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11605126_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}