{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T10:40:22Z","timestamp":1743417622651,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312342"},{"type":"electronic","value":"9783642312359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31235-9_19","type":"book-chapter","created":{"date-parts":[[2012,6,14]],"date-time":"2012-06-14T12:12:45Z","timestamp":1339675965000},"page":"280-297","source":"Crossref","is-referenced-by-count":1,"title":["Substructure Clustering: A Novel Mining Paradigm for Arbitrary Data Types"],"prefix":"10.1007","author":[{"given":"Stephan","family":"G\u00fcnnemann","sequence":"first","affiliation":[]},{"given":"Brigitte","family":"Boden","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0","volume-title":"Managing and Mining Graph Data","author":"C. Aggarwal","year":"2010","unstructured":"Aggarwal, C., Wang, H.: Managing and Mining Graph Data. Springer, New York (2010)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K. Beyer","year":"1998","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When Is \u201dNearest Neighbor\u201d Meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Chen, J.: Making subsequence time series clustering meaningful. In: ICDM, pp. 114\u2013121 (2005)","DOI":"10.1109\/ICDM.2005.91"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Fern\u00e1ndez, M.F., Suciu, D.: Storing semistructured data with stored. In: SIGMOD, pp. 431\u2013442 (1999)","DOI":"10.1145\/304181.304220"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K. Gouda","year":"2005","unstructured":"Gouda, K., Zaki, M.J.: Genmax: An efficient algorithm for mining maximal frequent itemsets. DMKD\u00a011(3), 223\u2013242 (2005)","journal-title":"DMKD"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., F\u00e4rber, I., Boden, B., Seidl, T.: Subspace clustering meets dense subgraph mining: A synthesis of two paradigms. In: ICDM, pp. 845\u2013850 (2010)","DOI":"10.1109\/ICDM.2010.95"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., Kremer, H., Seidl, T.: Subspace clustering for uncertain data. In: SDM, pp. 385\u2013396 (2010)","DOI":"10.1137\/1.9781611972801.34"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"G\u00fcnnemann, S., M\u00fcller, E., F\u00e4rber, I., Seidl, T.: Detection of orthogonal concepts in subspaces of high dimensional data. In: CIKM, pp. 1317\u20131326 (2009)","DOI":"10.1145\/1645953.1646120"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A frequent-pattern tree approach. DMKD\u00a08(1), 53\u201387 (2004)","journal-title":"DMKD"},{"key":"19_CR10","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Categorical Logic and Type Theory","author":"B. Jacobs","year":"1999","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0141. North Holland, Amsterdam (1999)"},{"key":"19_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-47887-6_47","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"X. Jin","year":"2002","unstructured":"Jin, X., Lu, Y., Shi, C.: Distribution Discovery: Local Analysis of Temporal Rules. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol.\u00a02336, pp. 469\u2013480. Springer, Heidelberg (2002)"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"33","author":"H.-P. Kriegel","year":"2009","unstructured":"Kriegel, H.-P., Kr\u00f6ger, P., Zimek, A.: Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. TKDD\u00a033(1), 1\u201358 (2009)","journal-title":"TKDD"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: KDD, pp. 631\u2013636 (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Lin, J., Keogh, E., Truppel, W.: Clustering of streaming time series is meaningless. In: SIGMOD, pp. 56\u201365 (2003)","DOI":"10.1145\/882095.882096"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"M\u00fcller, E., Assent, I., G\u00fcnnemann, S., Krieger, R., Seidl, T.: Relevant subspace clustering: Mining the most interesting non-redundant concepts in high dimensional data. In: ICDM, pp. 377\u2013386 (2009)","DOI":"10.1109\/ICDM.2009.10"},{"issue":"7","key":"19_CR16","first-page":"902","volume":"18","author":"A. Patrikainen","year":"2006","unstructured":"Patrikainen, A., Meila, M.: Comparing subspace clusterings. TKDE\u00a018(7), 902\u2013916 (2006)","journal-title":"TKDE"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Poernomo, A.K., Gopalkrishnan, V.: Towards efficient mining of proportional fault-tolerant frequent itemsets. In: KDD, pp. 697\u2013706 (2009)","DOI":"10.1145\/1557019.1557097"},{"key":"19_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-25957-2_8","volume-title":"Flexible Query Answering Systems","author":"S.E. Rombo","year":"2004","unstructured":"Rombo, S.E., Terracina, G.: Discovering Representative Models in Large Time Series Databases. In: Christiansen, H., Hacid, M.-S., Andreasen, T., Larsen, H.L. (eds.) FQAS 2004. LNCS (LNAI), vol.\u00a03055, pp. 84\u201397. Springer, Heidelberg (2004)"},{"key":"19_CR19","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics\u00a013, 353\u2013362 (1983)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"8","key":"19_CR20","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. PAMI\u00a022(8), 888\u2013905 (2000)","journal-title":"PAMI"},{"key":"19_CR21","unstructured":"Tan, Z., Tung, A.: Substructure clustering on sequential 3D object datasets. In: ICDE, pp. 634\u2013645 (2004)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Thomas, L., Valluri, S., Karlapalem, K.: Margin: Maximal frequent subgraph mining. In: ICDM, pp. 1097\u20131101 (2006)","DOI":"10.1109\/ICDM.2006.102"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Tsuda, K., Kudo, T.: Clustering graphs by weighted substructure mining. In: ICML, pp. 953\u2013960 (2006)","DOI":"10.1145\/1143844.1143964"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Wang, C., Parthasarathy, S.: Summarizing itemset patterns using probabilistic models. In: KDD, pp. 730\u2013735 (2006)","DOI":"10.1145\/1150402.1150495"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: KDD, pp. 286\u2013295 (2003)","DOI":"10.1145\/956755.956784"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Yankov, D., Keogh, E.J., Medina, J., Chiu, B.Y., Zordan, V.B.: Detecting time series motifs under uniform scaling. In: KDD, pp. 844\u2013853 (2007)","DOI":"10.1145\/1281192.1281282"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yang, J., Li, S.: RING: An Integrated Method for Frequent Representative Subgraph Mining. In: ICDM, pp. 1082\u20131087 (2009)","DOI":"10.1109\/ICDM.2009.96"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31235-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T10:19:27Z","timestamp":1743416367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31235-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312342","9783642312359"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31235-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}