Skip to main content
padlock icon - secure page this page is secure

NET-DBSCAN: clustering the nodes of a dynamic linear network

Buy Article:

$61.00 + tax (Refund Policy)

NET-DBSCAN, a method for clustering the nodes of a linear network, whose edges may be temporarily inaccessible, is introduced. The new method extends the idea of a well-known spatial clustering method, named density-based spatial clustering of applications with noise (DBSCAN). The new algorithm is described in detail and through a series of examples. A prototype system, which implements the algorithm, developed in Java and tested through a series of synthetic networks, is also presented. Finally, the application of NET-DBSCAN method to support real-world situations is briefly discussed.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: Clustering; Data mining; Dynamic linear networks; Graphs; Spatio-temporal analysis

Document Type: Research Article

Affiliations: Department of Geography, Harokopio University of Athens, 17671 Kallithea, Athens, Greece

Publication date: January 1, 2007

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more