{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:09:11Z","timestamp":1763809751962,"version":"3.41.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319691787"},{"type":"electronic","value":"9783319691794"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69179-4_24","type":"book-chapter","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T00:48:52Z","timestamp":1507855732000},"page":"343-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["StruClus: Scalable Structural Graph Set Clustering with Representative Sampling"],"prefix":"10.1007","author":[{"given":"Till","family":"Sch\u00e4fer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"unstructured":"Ackerman, M., Ben-David, S.: Clusterability: a theoretical study. In: Proceedings of AISTATS, pp. 1\u20138 (2009)","key":"24_CR1"},{"doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Procopiuc, C.M., Wolf, J.L., Yu, P.S., Park, J.S.: Fast algorithms for projected clustering. In: Proceedings of SIGMOD, pp. 61\u201372 (1999)","key":"24_CR2","DOI":"10.1145\/304181.304188"},{"doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C., Ta, N., Wang, J., Feng, J., Zaki, M.J.: XProj: a framework for projected structural clustering of XML documents. In: Proceedings of KDD, pp. 46\u201355 (2007)","key":"24_CR3","DOI":"10.1145\/1281192.1281201"},{"doi-asserted-by":"crossref","unstructured":"Anchuri, P., Zaki, M.J., Barkol, O., Golan, S., Shamy, M.: Approximate graph mining with label costs. In: Proceedings of KDD, pp. 518\u2013526, Chicago, Illinois, USA (2013)","key":"24_CR4","DOI":"10.1145\/2487575.2487602"},{"doi-asserted-by":"crossref","unstructured":"Beyer, K.S., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cNearest Neighbor\u201d meaningful? In: Proceedings of ICDT, pp. 217\u2013235 (1999)","key":"24_CR5","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"8","key":"24_CR6","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognit. Lett. 18(8), 689\u2013694 (1997)","journal-title":"Pattern Recognit. Lett."},{"issue":"3\u20134","key":"24_CR7","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognit. Lett. 19(3\u20134), 255\u2013259 (1998)","journal-title":"Pattern Recognit. Lett."},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-44808-X_12","volume-title":"Algorithm Engineering and Experimentation","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G.: A probabilistic spell for the curse of dimensionality. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 147\u2013160. Springer, Heidelberg (2001). doi:10.1007\/3-540-44808-X_12"},{"issue":"6\u20137","key":"24_CR9","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/S0167-8655(01)00017-4","volume":"22","author":"M-L Fern\u00e1ndez","year":"2001","unstructured":"Fern\u00e1ndez, M.-L., Valiente, G.: A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognit. Lett. 22(6\u20137), 753\u2013758 (2001)","journal-title":"Pattern Recognit. Lett."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-642-03767-2_42","volume-title":"Computer Analysis of Images and Patterns","author":"M Ferrer","year":"2009","unstructured":"Ferrer, M., Valveny, E., Serratosa, F., Bardaj\u00ed, I., Bunke, H.: Graph-based k-means clustering: a comparison of the set median versus the generalized median graph. In: Jiang, X., Petkov, N. (eds.) CAIP 2009. LNCS, vol. 5702, pp. 342\u2013350. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-03767-2_42"},{"doi-asserted-by":"crossref","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. IJPRAI 28(1) (2014)","key":"24_CR11","DOI":"10.1142\/S0218001414500013"},{"issue":"383","key":"24_CR12","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","volume":"78","author":"EB Fowlkes","year":"1983","unstructured":"Fowlkes, E.B., Mallows, C.L.: A method for comparing two hierarchical clusterings. J. Am. Stat. Assoc. 78(383), 553\u2013569 (1983)","journal-title":"J. Am. Stat. Assoc."},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1109\/TNN.2002.1000150","volume":"13","author":"MA Girolami","year":"2002","unstructured":"Girolami, M.A.: Mercer kernel-based clustering in feature space. IEEE Trans. Neural Netw. 13(3), 780\u2013784 (2002)","journal-title":"IEEE Trans. Neural Netw."},{"doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: Proceedings of FOCS, pp. 534\u2013543 (2003)","key":"24_CR14","DOI":"10.1109\/SFCS.2003.1238226"},{"doi-asserted-by":"crossref","unstructured":"Hasan, M.A., Chaoji, V., Salem, S., Besson, J., Zaki, M.J.: ORIGAMI: mining representative orthogonal graph patterns. In: Proceedings of ICDM, pp. 153\u2013162 (2007)","key":"24_CR15","DOI":"10.1109\/ICDM.2007.45"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-29038-1_16","volume-title":"Database Systems for Advanced Applications","author":"X Huang","year":"2012","unstructured":"Huang, X., Cheng, H., Yang, J., Yu, J.X., Fei, H., Huan, J.: Semi-supervised clustering of graph objects: a subgraph mining approach. In: Lee, S., Peng, Z., Zhou, X., Moon, Y.-S., Unland, R., Yoo, J. (eds.) DASFAA 2012. LNCS, vol. 7238, pp. 197\u2013212. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-29038-1_16"},{"unstructured":"Hui, X., Zhongmon, L.: Clustering validation measures. In: Data Clustering: Algorithms and Applications, pp. 571\u2013605 (2013)","key":"24_CR17"},{"doi-asserted-by":"crossref","unstructured":"Jouili, S., Tabbone, S., Lacroix, V.: Median graph shift: a new clustering algorithm for graph domain. In: Proceedings of ICPR, pp. 950\u2013953 (2010)","key":"24_CR18","DOI":"10.1109\/ICPR.2010.238"},{"issue":"3","key":"24_CR19","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s11030-010-9225-x","volume":"14","author":"C Kalinski","year":"2010","unstructured":"Kalinski, C., Umkehrer, M., Weber, L., Kolb, J., Burdack, C., Ross, G.: On the industrial applications of MCRs: molecular diversity in drug discovery and generic drug synthesis. Mol. Divers. 14(3), 513\u2013522 (2010)","journal-title":"Mol. Divers."},{"issue":"4","key":"24_CR20","doi-asserted-by":"publisher","first-page":"577","DOI":"10.7155\/jgaa.00338","volume":"18","author":"N Kriege","year":"2014","unstructured":"Kriege, N., Mutzel, P., Sch\u00e4fer, T.: Practical SAHN clustering for very large data sets and expensive distance metrics. JGAA 18(4), 577\u2013602 (2014)","journal-title":"JGAA"},{"issue":"5","key":"24_CR21","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.jmva.2006.11.013","volume":"98","author":"M Meil\u0103","year":"2007","unstructured":"Meil\u0103, M.: Comparing clusterings\u2013an information based distance. J. Multivar. Anal. 98(5), 873\u2013895 (2007)","journal-title":"J. Multivar. Anal."},{"doi-asserted-by":"crossref","unstructured":"M\u00fcller, E., G\u00fcnnemann, S., Assent, I., Seidl, T.: Evaluating clustering in subspace projections of high dimensional data. In: Proceedings of VLDB, pp. 1270\u20131281 (2009)","key":"24_CR22","DOI":"10.14778\/1687627.1687770"},{"issue":"7","key":"24_CR23","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1109\/TKDE.2006.106","volume":"18","author":"A Patrikainen","year":"2006","unstructured":"Patrikainen, A., Meila, M.: Comparing subspace clusterings. IEEE Trans. Knowl. Data Eng. 18(7), 902\u2013916 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Ranu, S., Hoang, M., Singh, A.: Answering top-k representative queries on graph databases. In: Proceedings of SIGMOD, pp. 1163\u20131174, Snowbird, Utah, USA (2014)","key":"24_CR24","DOI":"10.1145\/2588555.2610524"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-23808-6_17","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Seeland","year":"2011","unstructured":"Seeland, M., Berger, S.A., Stamatakis, A., Kramer, S.: Parallel structural graph clustering. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011. LNCS (LNAI), vol. 6913, pp. 256\u2013272. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-23808-6_17"},{"doi-asserted-by":"crossref","unstructured":"Seeland, M., Karwath, A., Kramer, S.: Structural clustering of millions of molecular graphs. In: Symposium on Applied Computing, pp. 121\u2013128 (2014)","key":"24_CR26","DOI":"10.1145\/2554850.2555063"},{"key":"24_CR27","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"unstructured":"Shervashidze, N., Vishwanathan, S.V.N., Petri, T., Mehlhorn, K., Borgwardt, K.M.: Efficient graphlet kernels for large graph comparison. In: Proceedings of AISTATS, pp. 488\u2013495 (2009)","key":"24_CR28"},{"issue":"5","key":"24_CR29","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1002\/sam.10084","volume":"3","author":"M Thoma","year":"2010","unstructured":"Thoma, M., Cheng, H., Gretton, A., Han, J., Kriegel, H., Smola, A.J., Song, L., Yu, P.S., Yan, X., Borgwardt, K.M.: Discriminative frequent subgraph mining with optimality guarantees. Stat. Anal. Data Min. 3(5), 302\u2013318 (2010)","journal-title":"Stat. Anal. Data Min."},{"doi-asserted-by":"crossref","unstructured":"Tsuda, K., Kudo, T.: Clustering graphs by weighted substructure mining. In: Proceedings of ICML, pp. 953\u2013960 (2006)","key":"24_CR30","DOI":"10.1145\/1143844.1143964"},{"doi-asserted-by":"crossref","unstructured":"Tsuda, K., Kurihara, K.: Graph mining with variational dirichlet process mixture models. In: Proceedings of the International Conference on Data Mining, pp. 432\u2013442 (2008)","key":"24_CR31","DOI":"10.1137\/1.9781611972788.39"},{"key":"24_CR32","first-page":"1201","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan, S.V.N., Schraudolph, N.N., Kondor, R.I., Borgwardt, K.M.: Graph kernels. J. Mach. Learn. Res. 11, 1201\u20131242 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"24_CR33","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10115-007-0103-5","volume":"14","author":"N Wale","year":"2008","unstructured":"Wale, N., Watson, I.A., Karypis, G.: Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl. Inf. Syst. 14(3), 347\u2013375 (2008)","journal-title":"Knowl. Inf. Syst."},{"issue":"6\/7","key":"24_CR34","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0167-8655(01)00022-8","volume":"22","author":"WD Wallis","year":"2001","unstructured":"Wallis, W.D., Shoubridge, P., Kraetzl, M., Ray, D.: Graph distances using graph union. Pattern Recognit. Lett. 22(6\/7), 701\u2013704 (2001)","journal-title":"Pattern Recognit. Lett."},{"doi-asserted-by":"crossref","unstructured":"Yan, X., Cheng, H., Han, J., Yu, P.S.: Mining significant graph patterns by leap search. In: Proceedings of SIGMOD, pp. 433\u2013444 (2008)","key":"24_CR35","DOI":"10.1145\/1376616.1376662"},{"unstructured":"Yiu, M.L., Mamoulis, N.: Frequent-pattern based iterative projected clustering. In: Proceedings of ICDM, pp. 689\u2013692 (2003)","key":"24_CR36"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69179-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T13:02:20Z","timestamp":1750942940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-69179-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319691787","9783319691794"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69179-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}