{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:42:17Z","timestamp":1740123737775,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T00:00:00Z","timestamp":1524528000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T00:00:00Z","timestamp":1524528000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2019,2,15]]},"DOI":"10.1007\/s11036-018-1053-8","type":"journal-article","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T14:36:25Z","timestamp":1524580585000},"page":"202-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recommending the Best Merchant from Previous Transactions"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1086-9987","authenticated-orcid":false,"given":"Sanjay","family":"Chatterji","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Kronberger G, Affenzeller M (2012). In: Proceedings of the 13th International Conference on Computer Aided Systems Theory - Volume Part I. EUROCAST\u201911. Springer, Berlin, pp 464\u2013471","key":"1053_CR1","DOI":"10.1007\/978-3-642-27549-4_59"},{"doi-asserted-by":"crossref","unstructured":"Blattberg RC, Kim BD, Neslin SA (2008) Market Basket Analysis. In: Database Marketing. International Series in Quantitative Marketing, vol 18. Springer, New York","key":"1053_CR2","DOI":"10.1007\/978-0-387-72579-6"},{"key":"1053_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. SIGMOD Rec 22:207\u2013216","journal-title":"SIGMOD Rec"},{"doi-asserted-by":"crossref","unstructured":"Dunkel B, Soparkar N (1999) Data organization and access for efficient data mining. In: Kitsuregawa M, Papazoglou MP, Pu C (eds) Proceedings of the 15th International Conference on Data Engineering, Sydney, Austrialia, March 23-26, 1999, IEEE Computer Society, pp 522\u2013529","key":"1053_CR4","DOI":"10.1109\/ICDE.1999.754968"},{"doi-asserted-by":"crossref","unstructured":"Hegland M (2002) Algorithms for association rules. In: Mendelson S, Smola AJ (eds) Advanced Lectures on Machine Learning, Machine Learning Summer School 2002, Canberra, Australia, February 11-22, 2002, Revised Lectures. Volume 2600 of Lecture Notes in Computer Science. Springer, pp 226\u2013234","key":"1053_CR5","DOI":"10.1007\/3-540-36434-X_7"},{"key":"1053_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/276305.276306","volume":"27","author":"D Tsur","year":"1998","unstructured":"Tsur D, Ullman JD, Abiteboul S, Clifton C, Motwani R, Nestorov S, Rosenthal A (1998) Query flocks: a generalization of association-rule mining. SIGMOD Rec. 27:1\u201312","journal-title":"SIGMOD Rec."},{"unstructured":"Al-Shorman H, Jbara Y (2009) An efficient algorithm for mining association rules for large itemsets in large databases. In: Arabnia HR, Hashemi RR, Moxley FI (eds) Proceedings of the 2009 International Conference on Information & Knowledge Engineering, IKE 2009, July 13-16, 2009, Las Vegas Nevada, USA, 2 Volumes, CSREA Press, pp 727\u2013730","key":"1053_CR7"},{"unstructured":"Savasere A, Omiecinski E, Navathe SB (1995) An efficient algorithm for mining association rules in large databases. In: Proceedings of the 21th International Conference on Very Large Data Bases. VLDB \u201995, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc, pp 432\u2013444","key":"1053_CR8"},{"doi-asserted-by":"crossref","unstructured":"Wang CH, Nien SH (2016) Combining multiple correspondence analysis with association rule mining to conduct user-driven product design of wearable devices WOS:000370092400004","key":"1053_CR9","DOI":"10.1016\/j.csi.2015.11.007"},{"key":"1053_CR10","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.eswa.2016.02.045","volume":"57","author":"N Khader","year":"2016","unstructured":"Khader N, Lashier A, Yoon SW (2016) Pharmacy robotic dispensing and planogram analysis using association rule mining with prescription data. Expert Syst Appl 57:296\u2013310","journal-title":"Expert Syst Appl"},{"doi-asserted-by":"crossref","unstructured":"Reps JM, Aickelin U, Ma J, Zhang Y (2014) Refining adverse drug reactions using association rule mining for electronic healthcare data. In: 2014 IEEE International Conference on Data Mining Workshop (ICDMW). Volume 00, pp 763\u2013770","key":"1053_CR11","DOI":"10.1109\/ICDMW.2014.53"},{"doi-asserted-by":"crossref","unstructured":"Barati M, Bai Q, Liu Q (2016) Swarm: An approach for mining semantic association rules from semantic web data. In: Proceedings of the 14th Pacific Rim International Conference on Trends in Artificial Intelligence. PRICAI\u201916. Springer, Switzerland, pp 30\u201343","key":"1053_CR12","DOI":"10.1007\/978-3-319-42911-3_3"},{"key":"1053_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s10586-015-0507-z","volume":"19","author":"SP Malarvizhi","year":"2016","unstructured":"Malarvizhi SP, Sathiyabhama B (2016) Frequent pagesets from web log by enhanced weighted association rule mining. Clust Comput 19:269\u2013277","journal-title":"Clust Comput"},{"key":"1053_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.knosys.2016.03.025","volume":"103","author":"D Nguyen","year":"2016","unstructured":"Nguyen D, Nguyen LT, Vo B, Pedrycz W (2016) Efficient mining of class association rules with the itemset constraint. Know-Based Syst 103:73\u201388","journal-title":"Know-Based Syst"},{"key":"1053_CR15","doi-asserted-by":"publisher","first-page":"4361","DOI":"10.1016\/j.eswa.2015.01.002","volume":"42","author":"LT Nguyen","year":"2015","unstructured":"Nguyen LT, Nguyen NT (2015) An improved algorithm for mining class association rules using the difference of obidsets. Expert Syst Appl 42:4361\u20134369","journal-title":"Expert Syst Appl"},{"doi-asserted-by":"crossref","unstructured":"Singh A, Rumantir G, South A, Bethwaite B (2014) Clustering experiments on big transaction data for market segmentation. In: Proceedings of the 2014 International Conference on Big Data Science and Computing. BigDataScience \u201914. ACM, New York, pp 16:1\u201316:7","key":"1053_CR16","DOI":"10.1145\/2640087.2644161"},{"doi-asserted-by":"crossref","unstructured":"Li Y, Gifford WM, Sheopuri A (2016) A case study of mobile user behaviors using spatio-temporal data. In: MDM, IEEE Computer Society, pp 298\u2013301","key":"1053_CR17","DOI":"10.1109\/MDM.2016.51"},{"unstructured":"Dashdorj Z, Sobolevsky S, Serafini L, Antonelli F, Ratti C (2015) Semantic enrichment of mobile phone data records using background knowledge. arXiv:1504.05895","key":"1053_CR18"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11036-018-1053-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-018-1053-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-018-1053-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T20:11:26Z","timestamp":1626207086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11036-018-1053-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,24]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2,15]]}},"alternative-id":["1053"],"URL":"https:\/\/doi.org\/10.1007\/s11036-018-1053-8","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2018,4,24]]},"assertion":[{"value":"24 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}