Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
Proceedings of the 17th International Conference on Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient Mining of Spatiotemporal Patterns
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
CLOSET+: searching for the best strategies for mining frequent closed itemsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining, indexing, and querying historical spatiotemporal data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining compressed frequent-pattern sets
VLDB '05 Proceedings of the 31st international conference on Very large data bases
GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets
Data Mining and Knowledge Discovery
ST--ACTS: a spatio-temporal activity simulator
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Spatio–temporal rule mining: issues and techniques
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
An integrated space-time pattern classification approach for individuals' travel trajectories
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 1
A system for destination and future route prediction based on trajectory mining
Pervasive and Mobile Computing
A personal route prediction system based on trajectory data mining
Information Sciences: an International Journal
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
A space-time GIS for dynamics in potential face-to-face meeting opportunities
Proceedings of the 2011 international workshop on Trajectory data mining and analysis
Proceedings of the 13th international conference on Ubiquitous computing
Frequent route based continuous moving object location- and density prediction on road networks
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Mining regular routes from GPS data for ridesharing recommendations
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
Daisy: the center for data-intensive systems at Aalborg University
ACM SIGMOD Record
International Journal of Intelligent Information and Database Systems
Improving route prediction through user journey detection
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
The efficient analysis of spatio-temporal data, generated by moving objects, is an essential requirement for intelligent location-based services. Spatio-temporal rules can be found by constructing spatio-temporal baskets, from which traditional association rule mining methods can discover spatio-temporal rules. When the items in the baskets are spatio-temporal identifiers and are derived from trajectories of moving objects, the discovered rules represent frequently travelled routes. For some applications, e.g., an intelligent ridesharing application, these frequent routes are only interesting if they are long and sharable, i.e., can potentially be shared by several users. This paper presents a database projection based method for efficiently extracting such long, sharable frequent routes. The method prunes the search space by making use of the minimum length and sharable requirements and avoids the generation of the exponential number of sub-routes of long routes. Considering alternative modelling options for trajectories, leads to the development of two effective variants of the method. SQL-based implementations are described, and extensive experiments on both real life- and large-scale synthetic data show the effectiveness of the method and its variants.