{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T19:54:41Z","timestamp":1771012481685,"version":"3.50.1"},"reference-count":25,"publisher":"SAGE Publications","issue":"3-4","license":[{"start":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T00:00:00Z","timestamp":1220227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Visualization"],"published-print":{"date-parts":[[2008,9]]},"abstract":"<jats:p> The paper investigates the possibilities of using clustering techniques in visual exploration and analysis of large numbers of trajectories, that is, sequences of time-stamped locations of some moving entities. Trajectories are complex spatio-temporal constructs characterized by diverse non-trivial properties. To assess the degree of (dis)similarity between trajectories, specific methods (distance functions) are required. A single distance function accounting for all properties of trajectories, (1) is difficult to build, (2) would require much time to compute, and (3) might be difficult to understand and to use. We suggest the procedure of progressive clustering where a simple distance function with a clear meaning is applied on each step, which leads to easily interpretable outcomes. Successive application of several different functions enables sophisticated analyses through gradual refinement of earlier obtained results. Besides the advantages from the sense-making perspective, progressive clustering enables a rational work organization where time-consuming computations are applied to relatively small potentially interesting subsets obtained by means of \u2018cheap\u2019 distance functions producing quick results. We introduce the concept of progressive clustering by an example of analyzing a large real data set. We also review the existing clustering methods, describe the method OPTICS suitable for progressive clustering of trajectories, and briefly present several distance functions for trajectories. <\/jats:p>","DOI":"10.1057\/palgrave.ivs.9500183","type":"journal-article","created":{"date-parts":[[2008,7,24]],"date-time":"2008-07-24T10:22:37Z","timestamp":1216894957000},"page":"225-239","source":"Crossref","is-referenced-by-count":148,"title":["Visually driven analysis of movement data by progressive clustering"],"prefix":"10.1177","volume":"7","author":[{"given":"Salvatore","family":"Rinzivillo","sequence":"first","affiliation":[{"name":"KDD Laboratory, University of Pisa, Pisa, Italy"}]},{"given":"Dino","family":"Pedreschi","sequence":"additional","affiliation":[{"name":"KDD Laboratory, University of Pisa, Pisa, Italy"}]},{"given":"Mirco","family":"Nanni","sequence":"additional","affiliation":[{"name":"KDD Laboratory, ISTI \u2013 CNR, Pisa, Italy"}]},{"given":"Fosca","family":"Giannotti","sequence":"additional","affiliation":[{"name":"KDD Laboratory, ISTI \u2013 CNR, Pisa, Italy"}]},{"given":"Natalia","family":"Andrienko","sequence":"additional","affiliation":[{"name":"Fraunhofer Institute IAIS, Sankt Augustin, Germany"}]},{"given":"Gennady","family":"Andrienko","sequence":"additional","affiliation":[{"name":"Fraunhofer Institute IAIS, Sankt Augustin, Germany"}]}],"member":"179","published-online":{"date-parts":[[2008,9,1]]},"reference":[{"key":"bibr1-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015812206586"},{"key":"bibr2-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1111\/j.1538-4632.2005.00575.x"},{"key":"bibr3-PALGRAVE.IVS.9500183","volume-title":"Moving Objects Databases.","author":"G\u00fcting R","year":"2005"},{"key":"bibr4-PALGRAVE.IVS.9500183","volume-title":"Mobility, Data Mining and Privacy - Geographic Knowledge Discovery.","author":"Giannotti F","year":"2007"},{"key":"bibr5-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345455"},{"key":"bibr6-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2002.1016905"},{"key":"bibr7-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.84"},{"key":"bibr8-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1080\/13658810701362147"},{"key":"bibr9-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345454"},{"key":"bibr10-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801"},{"key":"bibr11-PALGRAVE.IVS.9500183","volume-title":"Proceedings of the 20th International Conference on Very Large Data Bases 1994","author":"Ng R","year":"1994"},{"key":"bibr12-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56927-2"},{"key":"bibr13-PALGRAVE.IVS.9500183","unstructured":"Ester M, Kriegel H-P, Sander J, Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. Second International Conference on Knowledge Discovery and Data Mining 1996 (Portland, Oregon), AAAI Press: Menlo Park, California, 1996; 226\u2013231."},{"key":"bibr14-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-006-9953-7"},{"key":"bibr15-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"key":"bibr16-PALGRAVE.IVS.9500183","first-page":"587","volume-title":"SIGMOD Conference","author":"Kriegel H","year":"2001"},{"key":"bibr17-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2007.59"},{"key":"bibr18-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1145\/1341012.1341027"},{"key":"bibr19-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-005-0217-6"},{"key":"bibr20-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375672"},{"key":"bibr21-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345451"},{"key":"bibr22-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1109\/VAST.2007.4388999"},{"key":"bibr23-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1109\/IV.2006.33"},{"key":"bibr24-PALGRAVE.IVS.9500183","doi-asserted-by":"publisher","DOI":"10.1109\/IV.2007.61"},{"key":"bibr25-PALGRAVE.IVS.9500183","volume-title":"Introduction to Data Mining.","author":"Tan P-N","year":"2005"}],"container-title":["Information Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1057\/PALGRAVE.IVS.9500183","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1057\/PALGRAVE.IVS.9500183","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T17:53:30Z","timestamp":1741629210000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1057\/PALGRAVE.IVS.9500183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":25,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["10.1057\/PALGRAVE.IVS.9500183"],"URL":"https:\/\/doi.org\/10.1057\/palgrave.ivs.9500183","relation":{},"ISSN":["1473-8716","1473-8724"],"issn-type":[{"value":"1473-8716","type":"print"},{"value":"1473-8724","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9]]}}}