{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T20:00:09Z","timestamp":1769284809286,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319320243","type":"print"},{"value":"9783319320250","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32025-0_11","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T12:47:38Z","timestamp":1458823658000},"page":"164-179","source":"Crossref","is-referenced-by-count":13,"title":["Anytime OPTICS: An Efficient Approach for Hierarchical Density-Based Clustering"],"prefix":"10.1007","author":[{"given":"Son T.","family":"Mai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ira","family":"Assent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anh","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"11_CR1","unstructured":"Achtert, E., B\u00f6hm, C., Kriegel, H.-P., Kr\u00f6ger, P.: Online hierarchical clustering in a data warehouse environment. In: ICDM, pp. 10\u201317 (2005)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.-P., Sander, J.: OPTICS: ordering points to identify the clustering structure. In: SIGMOD, pp. 49\u201360 (1999)","DOI":"10.1145\/304181.304187"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Brecheisen, S., Kriegel, H., Pfeifle, M.: Efficient density-based clustering of complex objects. In: ICDM, pp. 43\u201350 (2004)","DOI":"10.1109\/ICDM.2004.10082"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.-P., Kr\u00f6ger, P., Sander, J., Bubbles, D.: Quality preserving performance boosting for hierarchical clustering. In: SIGMOD Conference, pp. 79\u201390 (2001)","DOI":"10.1145\/376284.375672"},{"issue":"2","key":"11_CR5","first-page":"1542","volume":"1","author":"H Ding","year":"2008","unstructured":"Ding, H., Trajcevski, G., Scheuermann, P., Wang, X., Keogh, E.J.: Querying and mining of time series data: experimental comparison of representations and distance measures. PVLDB 1(2), 1542\u20131552 (2008)","journal-title":"PVLDB"},{"key":"11_CR6","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: Adensity-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, pp. 226\u2013231 (1996)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Kobayashi, T., Iwamura, M., Matsuda, T., Kise, K.: An anytime algorithm for camera-based character recognition. In: ICDAR, pp. 1140\u20131144 (2013)","DOI":"10.1109\/ICDAR.2013.231"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Kranen, P., Assent, I., Baldauf, C., Seidl, T.: Self-adaptive anytime stream clustering. In: ICDM, pp. 249\u2013258 (2009)","DOI":"10.1109\/ICDM.2009.47"},{"key":"11_CR9","unstructured":"Kr\u00f6ger, P., Kriegel, H.-P., Kailing, K.: Density-connected subspace clustering for high-dimensional data. In: SDM, pp. 246\u2013256 (2004)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-540-24741-8_8","volume-title":"Advances in Database Technology - EDBT 2004","author":"J Lin","year":"2004","unstructured":"Lin, J., Vlachos, M., Keogh, E.J., Gunopulos, D.: Iterative incremental clustering of time series. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 106\u2013122. Springer, Heidelberg (2004)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Mai, S.T., Goebl, S., Plant, C.: A similarity model and segmentation algorithm for white matter fiber tracts. In: ICDM, pp. 1014\u20131019 (2012)","DOI":"10.1109\/ICDM.2012.95"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Mai, S.T., He, X., Feng, J., B\u00f6hm, C.: Efficient anytime density-based clustering. In: SDM, pp. 112\u2013120 (2013)","DOI":"10.1137\/1.9781611972832.13"},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10115-014-0797-0","volume":"45","author":"ST Mai","year":"2015","unstructured":"Mai, S.T., He, X., Feng, J., Plant, C., B\u00f6hm, C.: Anytime density-based clustering of complex data. Knowl. Inf. Syst. 45(2), 319\u2013355 (2015)","journal-title":"Knowl. Inf. Syst."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Mai, S.T., He, X., Hubig, N., Plant, C., B\u00f6hm, C.: Active density-based clustering. In: ICDM, pp. 508\u2013517 (2013)","DOI":"10.1109\/ICDM.2013.39"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Chan, K.-P., Fu, A.W.-C.: Efficient time series matching by wavelets. In: ICDE, pp. 126\u2013133 (1999)","DOI":"10.1109\/ICDE.1999.754915"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Sakurai, Y., Yoshikawa, M., Faloutsos, C.: FTW: fast similarity search under the time warping distance. In: PODS, pp. 326\u2013337 (2005)","DOI":"10.1145\/1065167.1065210"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Sofman, B., Bagnell, J., Stentz, A.: Anytime online novelty detection for vehicle safeguarding. In: ICRA, pp. 1247\u20131254, May 2010","DOI":"10.21236\/ADA501778"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Ueno, K., Xi, X., Keogh, E.J., Lee, D.-J.: Anytime classification using the nearest neighbor algorithm with applications to stream mining. In: ICDM, pp. 623\u2013632 (2006)","DOI":"10.1109\/ICDM.2006.21"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: is a correction for chance necessary? In: ICML, pp. 1073\u20131080 (2009)","DOI":"10.1145\/1553374.1553511"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Zhu, Q., Batista, G.E.A.P.A., Rakthanmanon, T., Keogh, E.J.: A novel approximation to dynamic time warping allows anytime clustering of massive time series datasets. In: SDM, pp. 999\u20131010 (2012)","DOI":"10.1137\/1.9781611972825.86"},{"issue":"3","key":"11_CR21","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Mag. 17(3), 73\u201383 (1996)","journal-title":"AI Mag."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32025-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T23:20:11Z","timestamp":1748820011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32025-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320243","9783319320250"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32025-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}