TY - GEN

T1 - A K-Main routes approach to spatial network activity summarization

T2 - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010

AU - Oliver, Dev

AU - Bannur, Abdussalam

AU - Kang, James M.

AU - Shekhar, Shashi

AU - Bousselaire, Renee

PY - 2010/12/1

Y1 - 2010/12/1

N2 - Given a spatial network and a collection of activity events (e.g., emergency requests, crime reports, accident reports, etc.), spatial network activity summarization (SNAS) finds a set of k shortest paths based on the activity events. SNAS is important for critical societal applications such as disaster response and crime analysis. SNAS is computationally challenging because of the potentially exponential search space wherein there are an exponential number of k subsets of all possible shortest paths in a spatial network. Previous work on SNAS has focused on either geometry or sub-graph based (e.g., only one path), and cannot summarize multiple routes in a spatial network. We propose a novel approach, called K-Main Routes (KMR), that discovers a set of k shortest paths to summarize activities. KMR can be considered a generalization of the well known K-means technique for network space. KMR uses inactive node pruning to reduce the number of shortest paths calculated by accounting only for active nodes. Experimental evaluation of KMR using a real-world data set demonstrates that KMR with inactive node pruning leads to substantial computational savings without reducing the coverage of the resulting summary paths. A case study that compares network based with geometry based summarization on a real-world data set is also presented.

AB - Given a spatial network and a collection of activity events (e.g., emergency requests, crime reports, accident reports, etc.), spatial network activity summarization (SNAS) finds a set of k shortest paths based on the activity events. SNAS is important for critical societal applications such as disaster response and crime analysis. SNAS is computationally challenging because of the potentially exponential search space wherein there are an exponential number of k subsets of all possible shortest paths in a spatial network. Previous work on SNAS has focused on either geometry or sub-graph based (e.g., only one path), and cannot summarize multiple routes in a spatial network. We propose a novel approach, called K-Main Routes (KMR), that discovers a set of k shortest paths to summarize activities. KMR can be considered a generalization of the well known K-means technique for network space. KMR uses inactive node pruning to reduce the number of shortest paths calculated by accounting only for active nodes. Experimental evaluation of KMR using a real-world data set demonstrates that KMR with inactive node pruning leads to substantial computational savings without reducing the coverage of the resulting summary paths. A case study that compares network based with geometry based summarization on a real-world data set is also presented.

KW - Clustering

KW - Generalization

KW - Spatial network

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

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

U2 - 10.1109/ICDMW.2010.156

DO - 10.1109/ICDMW.2010.156

M3 - Conference contribution

AN - SCOPUS:79951743081

SN - 9780769542577

T3 - Proceedings - IEEE International Conference on Data Mining, ICDM

SP - 265

EP - 272

BT - Proceedings - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010

Y2 - 14 December 2010 through 17 December 2010

ER -