{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:30:35Z","timestamp":1781105435033,"version":"3.54.1"},"reference-count":30,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,1,1]]},"abstract":"<p>The problem of trip planning with time constraints aims to find the optimal routes satisfying the maximum time requirement and possessing the highest attraction score. In this paper, a more efficient algorithm TripRec is proposed to solve this problem. Based on the principle of the Aprior algorithm for mining frequent item sets, our method constructs candidate attraction sets containing k attractions by using the join rule on valid sets consisting of k-1 attractions. After all the valid routes from the valid k-1 attraction sets have been obtained, all of the candidate routes for the candidate k-sets can be acquired through a route extension approach. This method exhibits manifest improvement of the efficiency in the valid routes generation process. Then, by determining whether there exists at least one valid route, the paper prunes some candidate attraction sets to gain all the valid sets. The process will continue until no more valid attraction sets can be obtained. In addition, several optimization strategies are employed to greatly enhance the performance of the algorithm. Experimental results on both real-world and synthetic data sets show that our algorithm has the better pruning rate and efficiency compared with the state-of-the-art method.<\/p>","DOI":"10.4018\/ijdwm.2015010103","type":"journal-article","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T07:12:20Z","timestamp":1422342740000},"page":"45-65","source":"Crossref","is-referenced-by-count":1,"title":["TripRec"],"prefix":"10.4018","volume":"11","author":[{"given":"Heli","family":"Sun","sequence":"first","affiliation":[{"name":"School of Electronic and Information Engineering, Xi'an Jiaotong Univeristy, Xi'an, China & State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianbin","family":"Huang","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China & School of Software, Xidian University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinwei","family":"She","sequence":"additional","affiliation":[{"name":"School of Software, Xidian University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhou","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Electronic and Information Engineering, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiao","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Electronic and Information Engineering, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianhua","family":"Zou","sequence":"additional","affiliation":[{"name":"School of Electronic and Information Engineering, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qinbao","family":"Song","sequence":"additional","affiliation":[{"name":"School of Electronic and Information Engineering, Xi'an Jiaotong University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Northwest University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijdwm.2015010103-0","doi-asserted-by":"publisher","DOI":"10.1023\/A:1019194325861"},{"key":"ijdwm.2015010103-1","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules. In the 20th International Conference on Very Large Data Bases. (pp. 487-499)."},{"key":"ijdwm.2015010103-2","doi-asserted-by":"crossref","unstructured":"Averjanova, O., Ricci, F., & Nguyen, Q. N. (2008). Map-based interaction with a conversational mobile recommender system. In the Second International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies. (pp. 212-218). IEEE.","DOI":"10.1109\/UBICOMM.2008.16"},{"key":"ijdwm.2015010103-3","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1145\/1835804.1835918","article-title":"An energy-efficient mobile recommender system.","author":"Y.Ge","year":"2010","journal-title":"Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining"},{"key":"ijdwm.2015010103-4","doi-asserted-by":"crossref","unstructured":"Goh J., & Taniar D. (2004). Mining Frequency Pattern from Mobile Users. Knowledge-Based Intelligent Information and Engineering Systems. 795-801.","DOI":"10.1007\/978-3-540-30134-9_106"},{"key":"ijdwm.2015010103-5","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0002-x"},{"key":"ijdwm.2015010103-6","unstructured":"Heijden van der H. Kotsis H.G., & Kronsteiner, R. (2005). Mobile recommendation systems for decision making'on the go'. In International Conference on Mobile Business, 2005. (pp. 137-143)."},{"key":"ijdwm.2015010103-7","doi-asserted-by":"publisher","DOI":"10.1109\/SAINT.2006.55"},{"key":"ijdwm.2015010103-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.10.019"},{"key":"ijdwm.2015010103-9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12326-9_9"},{"key":"ijdwm.2015010103-10","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920934"},{"key":"ijdwm.2015010103-11","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2011.13"},{"key":"ijdwm.2015010103-12","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424349"},{"key":"ijdwm.2015010103-13","doi-asserted-by":"publisher","DOI":"10.1145\/1873951.1873972"},{"key":"ijdwm.2015010103-14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22922-0_15"},{"key":"ijdwm.2015010103-15","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-009-0167-z"},{"key":"ijdwm.2015010103-16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44799-7_5"},{"key":"ijdwm.2015010103-17","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-011-0319-7"},{"key":"ijdwm.2015010103-18","doi-asserted-by":"publisher","DOI":"10.1080\/15501320601069499"},{"key":"ijdwm.2015010103-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.01.017"},{"issue":"2","key":"ijdwm.2015010103-20","article-title":"Research on location-dependent queries in mobile databases.","volume":"20","author":"A. B.Waluyo","year":"2005","journal-title":"International Journal of Computer Systems: Science and Engineering"},{"key":"ijdwm.2015010103-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.02.005"},{"key":"ijdwm.2015010103-22","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-010-0498-y"},{"key":"ijdwm.2015010103-23","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2008.69"},{"key":"ijdwm.2015010103-24","first-page":"19","author":"H.Yoon","year":"2010","journal-title":"Smart itinerary recommendation based on user-generated gps trajectories. In Ubiquitous Intelligence and Computing"},{"key":"ijdwm.2015010103-25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03964-5_5"},{"key":"ijdwm.2015010103-26","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2009.2026372"},{"key":"ijdwm.2015010103-27","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2011.2167113"},{"key":"ijdwm.2015010103-28","doi-asserted-by":"publisher","DOI":"10.1145\/1889681.1889683"},{"key":"ijdwm.2015010103-29","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526816"}],"container-title":["International Journal of Data Warehousing and Mining"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=122515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T23:05:22Z","timestamp":1654124722000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijdwm.2015010103"}},"subtitle":["An Efficient Approach for Trip Planning with Time Constraints"],"short-title":[],"issued":{"date-parts":[[2015,1,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijdwm.2015010103","relation":{},"ISSN":["1548-3924","1548-3932"],"issn-type":[{"value":"1548-3924","type":"print"},{"value":"1548-3932","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,1]]}}}