{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:25:24Z","timestamp":1747196724657,"version":"3.40.5"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131856"},{"type":"electronic","value":"9783319131863"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13186-3_73","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T20:09:58Z","timestamp":1417464598000},"page":"818-830","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mining Time-Aware Transit Patterns for Route Recommendation in Big Check-in Data"],"prefix":"10.1007","author":[{"given":"Hsun-Ping","family":"Hsieh","sequence":"first","affiliation":[]},{"given":"Cheng-Te","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,26]]},"reference":[{"key":"73_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: International Conference on Very Large Data Bases (VLDB), pp. 487\u2013499 (1994)"},{"key":"73_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: IEEE International Conference on Data Engineering (ICDE), pp. 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"73_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013435 (2002)","DOI":"10.1145\/775047.775109"},{"key":"73_CR4","doi-asserted-by":"crossref","unstructured":"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\u20131090 (2011)","DOI":"10.1145\/2020408.2020579"},{"key":"73_CR5","doi-asserted-by":"crossref","unstructured":"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\u201323 (2000)","DOI":"10.1007\/3-540-45372-5_2"},{"key":"73_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013161 (2011)","DOI":"10.1109\/MDM.2011.13"},{"key":"73_CR7","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: IEEE International Conference on Data Mining (ICDM), pp. 313\u2013320 (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"73_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013306 (2003)","DOI":"10.1007\/3-540-45065-3_26"},{"key":"73_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013416 (1999)","DOI":"10.1007\/3-540-49257-7_25"},{"key":"73_CR10","unstructured":"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\u2013224 (2001)"},{"key":"73_CR11","unstructured":"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)"},{"key":"73_CR12","doi-asserted-by":"crossref","unstructured":"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\u20131054 (2011)","DOI":"10.1145\/2020408.2020575"},{"issue":"8","key":"73_CR13","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/TKDE.2007.1043","volume":"19","author":"J Wang","year":"2007","unstructured":"Wang, J., Han, J., Li, C.: Frequent closed sequence mining without candidate maintenance. IEEE Trans. Knowl. Data Eng. (TKDE) 19(8), 1042\u20131056 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"},{"key":"73_CR14","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: IEEE International Conference on Data Mining (ICDM), pp. 721\u2013724 (2002)"},{"key":"73_CR15","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: mining closed sequential patterns in large datasets. In: SIAM International Conference on Data Mining (SDM), pp. 166\u2013177 (2003)","DOI":"10.1137\/1.9781611972733.15"},{"key":"73_CR16","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J.: CloseGraph: mining closed frequent graph patterns. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 286\u2013295 (2003)","DOI":"10.1145\/956750.956784"},{"key":"73_CR17","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00779-011-0419-8","volume":"16","author":"H Yoon","year":"2011","unstructured":"Yoon, H., Zheng, Y., Xie, X., Woo, W.: Social itinerary recommendation from user-generated digital trails. Pers. Ubiquit. Comput. 16, 469\u2013484 (2011)","journal-title":"Pers. Ubiquit. Comput."},{"issue":"1","key":"73_CR18","first-page":"31","volume":"42","author":"MJ Zaki","year":"2011","unstructured":"Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Mach. Learn. 42(1), 31\u201360 (2011)","journal-title":"Mach. Learn."},{"issue":"4","key":"73_CR19","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. (TKDE) 17(4), 462\u2013478 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng. (TKDE)"}],"container-title":["Lecture Notes in Computer Science","Trends and Applications in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13186-3_73","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:11:27Z","timestamp":1747174287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13186-3_73"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131856","9783319131863"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13186-3_73","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"26 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}