Mobile Networks and Applications

, Volume 24, Issue 1, pp 202–207 | Cite as

Recommending the Best Merchant from Previous Transactions

  • Sanjay ChatterjiEmail author


The most explored goal of mining association rules between items is to identify all possible groups of items which are used together by a set of users for purchasing, selling or any other purpose. But, it is also important to mine the association rule between merchants to get the groups of brands and item types which are used together. In this paper, we wish to find the inter-merchant association rules in the transaction database based on the distance between the merchants, the categories of the merchants, the number of times their items are purchased together, and the preferences of the users. The task is implemented in three phases. In the first phase, we preprocess the transactions by removing the unnecessary transactions and grouping them based on related users and time frames. In this phase, we have also mapped the store name and the owner name to the corresponding merchant name. In the second phase, we find top T number of merchants from each category using Association Rule Mining. Then, in the third phase we display the recommendations in the decreasing order of the distance from the last merchant. This work may be used to provide appropriate recommendations of merchants to the intended users, increase the user engagement in transactions and in turn increase the sell of the products of a merchant. The system is trained on a dataset of total 50,000 transactions of 5 users and tested for 5 users for getting the rules meant for them. The proposed system gives 83.3% correct results. All the results are useful as manually evaluated by the users.


minsup minconf Association rule mining Transaction dataset Merchant 



The author sincerely acknowledges the efforts of a couple of the Samsung developers Mr. Bagadhi Gopal Rao and Mr. Karan Chauhan and a couple of Samsung reviewers Mr. Ramachandran Narasimhamurthy and Mr. Nitish Varshney for their effective helps.


  1. 1.
    Kronberger G, Affenzeller M (2012). In: Proceedings of the 13th International Conference on Computer Aided Systems Theory - Volume Part I. EUROCAST’11. Springer, Berlin, pp 464–471Google Scholar
  2. 2.
    Blattberg RC, Kim BD, Neslin SA (2008) Market Basket Analysis. In: Database Marketing. International Series in Quantitative Marketing, vol 18. Springer, New YorkGoogle Scholar
  3. 3.
    Agrawal R, Imieliński T, Swami A (1993) Mining association rules between sets of items in large databases. SIGMOD Rec 22:207–216CrossRefGoogle Scholar
  4. 4.
    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–529Google Scholar
  5. 5.
    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–234Google Scholar
  6. 6.
    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–12CrossRefGoogle Scholar
  7. 7.
    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–730Google Scholar
  8. 8.
    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 ’95, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc, pp 432–444Google Scholar
  9. 9.
    Wang CH, Nien SH (2016) Combining multiple correspondence analysis with association rule mining to conduct user-driven product design of wearable devices WOS:000370092400004Google Scholar
  10. 10.
    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–310CrossRefGoogle Scholar
  11. 11.
    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–770Google Scholar
  12. 12.
    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’16. Springer, Switzerland, pp 30–43Google Scholar
  13. 13.
    Malarvizhi SP, Sathiyabhama B (2016) Frequent pagesets from web log by enhanced weighted association rule mining. Clust Comput 19:269–277CrossRefGoogle Scholar
  14. 14.
    Nguyen D, Nguyen LT, Vo B, Pedrycz W (2016) Efficient mining of class association rules with the itemset constraint. Know-Based Syst 103:73–88CrossRefGoogle Scholar
  15. 15.
    Nguyen LT, Nguyen NT (2015) An improved algorithm for mining class association rules using the difference of obidsets. Expert Syst Appl 42:4361–4369CrossRefGoogle Scholar
  16. 16.
    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 ’14. ACM, New York, pp 16:1–16:7Google Scholar
  17. 17.
    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–301Google Scholar
  18. 18.
    Dashdorj Z, Sobolevsky S, Serafini L, Antonelli F, Ratti C (2015) Semantic enrichment of mobile phone data records using background knowledge. arXiv:1504.05895

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Samsung R&D Institute India BangaloreBengaluruIndia

Personalised recommendations