Abstract
The detection of outliers in spatio-temporal traffic data is an important research problem in the data mining and knowledge discovery community. However to the best of our knowledge, the discovery of relationships, especially causal interactions, among detected traffic outliers has not been investigated before. In this paper we propose algorithms which construct outlier causality trees based on temporal and spatial properties of detected outliers. Frequent substructures of these causality trees reveal not only recurring interactions among spatio-temporal outliers, but potential flaws in the design of existing traffic networks. The effectiveness and strength of our algorithms are validated by experiments on a very large volume of real taxi trajectories in an urban road network.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD'11 |
| Publisher | Association for Computing Machinery |
| Pages | 1010-1018 |
| Number of pages | 9 |
| ISBN (Print) | 9781450308137 |
| DOIs | |
| Publication status | Published - 2011 |
| Externally published | Yes |
| Event | 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2011 - San Diego, United States Duration: 21 Aug 2011 → 24 Aug 2011 |
Publication series
| Name | Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining |
|---|
Conference
| Conference | 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2011 |
|---|---|
| Country/Territory | United States |
| City | San Diego |
| Period | 21/08/11 → 24/08/11 |
Keywords
- Frequent substructures
- Outlier causalities
- Spatio-temporal outliers
- Urban computing and planning