NNCluster: An efficient clustering algorithm for road network trajectories

Gook Pil Roh, Seung Won Hwang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Citations (Scopus)

Abstract

With the advent of ubiquitous computing, we can easily acquire the locations of moving objects. This paper studies clustering problems for trajectory data that is constrained by the road network. While many trajectory clustering algorithms have been proposed, they do not consider the spatial proximity of objects across the road network. For this kind of data, we propose a new distance measure that reflects the spatial proximity of vehicle trajectories on the road network, and an efficient clustering method that reduces the number of distance computations during the clustering process. Experimental results demonstrate that our proposed method correctly identifies clusters using real-life trajectory data yet reduces the distance computations by up to 80% against the baseline algorithm.

Original languageEnglish
Title of host publicationDatabase Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings
Pages47-61
Number of pages15
EditionPART 2
DOIs
Publication statusPublished - 2010 Dec 28
Event15th International Conference on Database Systems for Advanced Applications, DASFAA 2010 - Tsukuba, Japan
Duration: 2010 Apr 12010 Apr 4

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume5982 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th International Conference on Database Systems for Advanced Applications, DASFAA 2010
CountryJapan
CityTsukuba
Period10/4/110/4/4

Fingerprint

Road Network
Clustering algorithms
Clustering Algorithm
Efficient Algorithms
Trajectories
Trajectory
Proximity
Clustering
Ubiquitous Computing
Ubiquitous computing
Distance Measure
Moving Objects
Clustering Methods
Baseline
Experimental Results
Demonstrate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Roh, G. P., & Hwang, S. W. (2010). NNCluster: An efficient clustering algorithm for road network trajectories. In Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings (PART 2 ed., pp. 47-61). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5982 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-12098-5_4
Roh, Gook Pil ; Hwang, Seung Won. / NNCluster : An efficient clustering algorithm for road network trajectories. Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings. PART 2. ed. 2010. pp. 47-61 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{d627dd595a8a461e927118923710a178,
title = "NNCluster: An efficient clustering algorithm for road network trajectories",
abstract = "With the advent of ubiquitous computing, we can easily acquire the locations of moving objects. This paper studies clustering problems for trajectory data that is constrained by the road network. While many trajectory clustering algorithms have been proposed, they do not consider the spatial proximity of objects across the road network. For this kind of data, we propose a new distance measure that reflects the spatial proximity of vehicle trajectories on the road network, and an efficient clustering method that reduces the number of distance computations during the clustering process. Experimental results demonstrate that our proposed method correctly identifies clusters using real-life trajectory data yet reduces the distance computations by up to 80{\%} against the baseline algorithm.",
author = "Roh, {Gook Pil} and Hwang, {Seung Won}",
year = "2010",
month = "12",
day = "28",
doi = "10.1007/978-3-642-12098-5_4",
language = "English",
isbn = "3642120970",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "47--61",
booktitle = "Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings",
edition = "PART 2",

}

Roh, GP & Hwang, SW 2010, NNCluster: An efficient clustering algorithm for road network trajectories. in Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 5982 LNCS, pp. 47-61, 15th International Conference on Database Systems for Advanced Applications, DASFAA 2010, Tsukuba, Japan, 10/4/1. https://doi.org/10.1007/978-3-642-12098-5_4

NNCluster : An efficient clustering algorithm for road network trajectories. / Roh, Gook Pil; Hwang, Seung Won.

Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings. PART 2. ed. 2010. p. 47-61 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5982 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - NNCluster

T2 - An efficient clustering algorithm for road network trajectories

AU - Roh, Gook Pil

AU - Hwang, Seung Won

PY - 2010/12/28

Y1 - 2010/12/28

N2 - With the advent of ubiquitous computing, we can easily acquire the locations of moving objects. This paper studies clustering problems for trajectory data that is constrained by the road network. While many trajectory clustering algorithms have been proposed, they do not consider the spatial proximity of objects across the road network. For this kind of data, we propose a new distance measure that reflects the spatial proximity of vehicle trajectories on the road network, and an efficient clustering method that reduces the number of distance computations during the clustering process. Experimental results demonstrate that our proposed method correctly identifies clusters using real-life trajectory data yet reduces the distance computations by up to 80% against the baseline algorithm.

AB - With the advent of ubiquitous computing, we can easily acquire the locations of moving objects. This paper studies clustering problems for trajectory data that is constrained by the road network. While many trajectory clustering algorithms have been proposed, they do not consider the spatial proximity of objects across the road network. For this kind of data, we propose a new distance measure that reflects the spatial proximity of vehicle trajectories on the road network, and an efficient clustering method that reduces the number of distance computations during the clustering process. Experimental results demonstrate that our proposed method correctly identifies clusters using real-life trajectory data yet reduces the distance computations by up to 80% against the baseline algorithm.

UR - http://www.scopus.com/inward/record.url?scp=78650498006&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650498006&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-12098-5_4

DO - 10.1007/978-3-642-12098-5_4

M3 - Conference contribution

AN - SCOPUS:78650498006

SN - 3642120970

SN - 9783642120978

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 47

EP - 61

BT - Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings

ER -

Roh GP, Hwang SW. NNCluster: An efficient clustering algorithm for road network trajectories. In Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings. PART 2 ed. 2010. p. 47-61. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-642-12098-5_4