{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T18:55:55Z","timestamp":1778871355412,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540281276","type":"print"},{"value":"9783540319047","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535331_21","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T20:51:20Z","timestamp":1279745480000},"page":"364-381","source":"Crossref","is-referenced-by-count":275,"title":["On Discovering Moving Clusters in Spatio-temporal Data"],"prefix":"10.1007","author":[{"given":"Panos","family":"Kalnis","sequence":"first","affiliation":[]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[]},{"given":"Spiridon","family":"Bakiras","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45072-6_18","volume-title":"Advances in Spatial and Temporal Databases","author":"M. Hadjieleftheriou","year":"2003","unstructured":"Hadjieleftheriou, M., Kollios, G., Gunopulos, D., Tsotras, V.J.: On-line discovery of dense areas in spatio-temporal databases. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol.\u00a02750. Springer, Heidelberg (2003)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Gaffney, S., Smyth, P.: Trajectory clustering with mixtures of regression models. In: Proc. of ICDM, pp. 63\u201372 (1999)","DOI":"10.1145\/312129.312198"},{"key":"21_CR3","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Wimmer, M., Xu, X.: Incremental clustering for mining in a data warehousing environment. In: Proc. of VLDB, pp. 323\u2013333 (1998)"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Nassar, S., Sander, J., Cheng, C.: Incremental and effective data summarization for dynamic hierarchical clustering. In: Proc. of ACM SIGMOD, pp. 467\u2013478 (2004)","DOI":"10.1145\/1007568.1007621"},{"key":"21_CR5","unstructured":"Martin, E., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. of KDD (1996)"},{"key":"21_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: an Introduction to Cluster Analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman, L., Rousueeuw, P.: Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley and Sons, Chichester (1990)"},{"key":"21_CR7","unstructured":"Ng, R.T., Han, J.: Efficient and effective clustering methods for spatial data mining. In: Proc. of VLDB (1994)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An efficient data clustering method for very large databases. In: Proc. of ACM SIGMOD (1996)","DOI":"10.1145\/233269.233324"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: CURE: An efficient clustering algorithm for large databases. In: Proc. of ACM SIGMOD (1998)","DOI":"10.1145\/276304.276312"},{"key":"21_CR10","unstructured":"Nanopoulos, A., Theodoridis, Y., Manolopoulos, Y.: C2P: Clustering based on closest pairs. In: Proc. of VLDB (2001)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Ankerst, M., Breunig, M., Kriegel, H.P., Sander, J.: OPTICS: Ordering points to identify the clustering structure. In: Proc. of ACM SIGMOD, pp. 49\u201360 (1999)","DOI":"10.1145\/304182.304187"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Vlachos, M., Kollios, G., Gunopulos, D.: Discovering similar multidimensional trajectories. In: Proc. of ICDE, pp. 673\u2013684 (2002)","DOI":"10.1109\/ICDE.2002.994784"},{"key":"21_CR13","unstructured":"Das, G., Lin, K.I., Mannila, H., Renganathan, G., Smyth, P.: Rule discovery from time series. In: Proc. of KDD, pp. 16\u201322 (1998)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Li, C.S., Yu, P.S., Castelli, V.: Malm: A framework for mining sequence database at multiple abstraction levels. In: Proc. of CIKM, pp. 267\u2013272 (1998)","DOI":"10.1145\/288627.288666"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Kr\u00f6oger, P., Gotlibovich, I.: Incremental OPTICS: Efficient computation of updates in a hierarchical cluster ordering. In: Proc. of DaWaK, pp. 224\u2013233 (2003)","DOI":"10.1007\/978-3-540-45228-7_23"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Breunig, M.M., Kriegel, H.P., Kr\u00f6ger, P., Sander, J.: Data bubbles: Quality preserving performance boosting for hierarchical clustering. In: Proc. of ACM SIGMOD (2001)","DOI":"10.1145\/375663.375672"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Larsen, B., Aone, C.: Fast and effective text mining using linear-time document clustering. In: Proc. of KDD, pp. 16\u201322 (1999)","DOI":"10.1145\/312129.312186"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535331_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:11:12Z","timestamp":1605643872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535331_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281276","9783540319047"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11535331_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}