Advertisement

Mining Time-Aware Transit Patterns for Route Recommendation in Big Check-in Data

  • Hsun-Ping HsiehEmail author
  • Cheng-Te Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8643)

Abstract

In current location-based services, there are numerous travel route patterns hidden in the user check-in behaviors over locations in a city. Such records rapidly accumulate and update over time, so that an efficient and scalable algorithm is demanded to mine the useful travel patterns from the big check-in data. However, discovering travel patterns under efficiency and scalability concerns from large-scaled location data had not ever carefully tackled yet. In this paper, we propose to mine the Time-aware Transit Patterns (TTP), which capture the representative traveling behaviors over consecutive locations, from the big check-in data. We model the travel behaviors among different locations into a Route Transit Graph (RTG), in which nodes represents locations, and edges denotes the transit behaviors of users between locations with certain time intervals. The time-aware transit patterns, which are required to satisfy frequent, closed, and connected requirements due to respectively physical meanings, are mined based on the RTG transaction database. To achieve such goal, we propose a novel TTPM-algorithm, which is devised to only need to scan the database once and generate no unnecessary candidates, and thus guarantee better time efficiency lower and memory usage. Experiments conducted on different cities demonstrate the promising performance of our TTPM-algorithm, comparing to a modified Apriori method.

Keywords

Time-aware transit patterns Check-in data Route planning 

References

  1. 1.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: International Conference on Very Large Data Bases (VLDB), pp. 487–499 (1994)Google Scholar
  2. 2.
    Agrawal, R., Srikant, R.: Mining sequential patterns. In: IEEE International Conference on Data Engineering (ICDE), pp. 3–14 (1995)Google Scholar
  3. 3.
    Ayres, J., Gehrke, J.E., Yiu, T., Flannick, J.: Sequential pattern mining using a bitmap representation. In: ACM SIGMOD International Conference on Knowledge Discovery in Database (SIGMOD), pp. 429–435 (2002)Google Scholar
  4. 4.
    Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 1082–1090 (2011)Google Scholar
  5. 5.
    Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: European Conference on Principles of Data Mining and Knowledge Discovery (PKDD), pp. 13–23 (2000)Google Scholar
  6. 6.
    Lu, H.C., Lin, C.Y., Tseng, V.S.: Trip-Mine: an efficient trip planning approach with travel time constraints. In: IEEE International Conference on Mobile Data Management (MDM), pp. 162–161 (2011)Google Scholar
  7. 7.
    Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: IEEE International Conference on Data Mining (ICDM), pp. 313–320 (2001)Google Scholar
  8. 8.
    Leleu, M., Rigotti, C., Boulicaut, J.-F., Euvrard, G.: GO-SPADE: mining sequential patterns over datasets with consecutive repetitions. In: International Conference on Machine Learning and Data Mining, pp. 293–306 (2003)Google Scholar
  9. 9.
    Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: IEEE International Conference on Database Theory (ICDT), pp. 398–416 (1999)Google Scholar
  10. 10.
    Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H.: PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In: IEEE International Conference on Data Engineering (ICDE), pp. 215–224 (2001)Google Scholar
  11. 11.
    Scellato, S., Noulas, A., Lambiotte, R., Mascolo, C.: Socio-spatial properties of online location-based social networks. In: AAAI International Conference on Weblog and Social Media (ICWSM) (2010)Google Scholar
  12. 12.
    Scellato, S., Noulas, A., Mascolo, C.: Exploiting place features in link prediction on location-based social networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 1046–1054 (2011)Google Scholar
  13. 13.
    Wang, J., Han, J., Li, C.: Frequent closed sequence mining without candidate maintenance. IEEE Trans. Knowl. Data Eng. (TKDE) 19(8), 1042–1056 (2007)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: IEEE International Conference on Data Mining (ICDM), pp. 721–724 (2002)Google Scholar
  15. 15.
    Yan, X., Han, J., Afshar, R.: CloSpan: mining closed sequential patterns in large datasets. In: SIAM International Conference on Data Mining (SDM), pp. 166–177 (2003)Google Scholar
  16. 16.
    Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 286–295 (2003)Google Scholar
  17. 17.
    Yoon, H., Zheng, Y., Xie, X., Woo, W.: Social itinerary recommendation from user-generated digital trails. Pers. Ubiquit. Comput. 16, 469–484 (2011)CrossRefGoogle Scholar
  18. 18.
    Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Mach. Learn. 42(1), 31–60 (2011)Google Scholar
  19. 19.
    Zaki, M.J., Hsiao, C.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. (TKDE) 17(4), 462–478 (2005)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Graduate Institute of Networking and MultimediaNational Taiwan UniversityTaipeiTaiwan

Personalised recommendations