A K-Main Routes Approach to Spatial Network Activity Summarization.
Saved in:
| Title: | A K-Main Routes Approach to Spatial Network Activity Summarization. |
|---|---|
| Authors: | Oliver, Dev, Shekhar, Shashi, Kang, James M., Laubscher, Renee, Carlan, Veronica, Bannur, Abdussalam |
| Source: | IEEE Transactions on Knowledge & Data Engineering; Jun2014, Vol. 26 Issue 6, p1464-1478, 15p |
| Subject Terms: | DATABASE management, EMAIL systems, DATA mining, PARALLEL algorithms, PATH Pascal (Computer program language), COMPUTER network architectures, PROGRAM generators (Computer programs) |
| Abstract: | Data summarization is an important concept in data mining for finding a compact representation of a dataset. In spatial network activity summarization (SNAS), we are given a spatial network and a collection of activities (e.g., pedestrian fatality reports, crime reports) and the goal is to find \(k\) shortest paths that summarize the activities. SNAS is important for applications where observations occur along linear paths such as roadways, train tracks, etc. SNAS is computationally challenging because of the large number of \(k\) subsets of shortest paths in a spatial network. Previous work has focused on either geometry or subgraph-based approaches (e.g., only one path), and cannot summarize activities using multiple paths. This paper proposes a K-Main Routes (KMR) approach that discovers \(k\) shortest paths to summarize activities. KMR generalizes K-means for network space but uses shortest paths instead of ellipses to summarize activities. To improve performance, KMR uses network Voronoi, divide and conquer, and pruning strategies. We present a case study comparing KMR's network-based output (i.e., shortest paths) to geometry-based outputs (e.g., ellipses) on pedestrian fatality data. Experimental results on synthetic and real data show that KMR with our performance-tuning decisions yields substantial computational savings without reducing summary path coverage. [ABSTRACT FROM PUBLISHER] |
| Copyright of IEEE Transactions on Knowledge & Data Engineering is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!