CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Enhancement of Marketing Strategies using Weighted Association Rule Mining

by Dhwaneel Trivedi, Suraj Singh, Rashmi Thakur
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 68 - Number 21
Year of Publication: 2013
Authors: Dhwaneel Trivedi, Suraj Singh, Rashmi Thakur
10.5120/11704-7311

Dhwaneel Trivedi, Suraj Singh, Rashmi Thakur . Enhancement of Marketing Strategies using Weighted Association Rule Mining. International Journal of Computer Applications. 68, 21 ( April 2013), 28-33. DOI=10.5120/11704-7311

@article{ 10.5120/11704-7311,
author = { Dhwaneel Trivedi, Suraj Singh, Rashmi Thakur },
title = { Enhancement of Marketing Strategies using Weighted Association Rule Mining },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 68 },
number = { 21 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 28-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume68/number21/11704-7311/ },
doi = { 10.5120/11704-7311 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:28:31.867900+05:30
%A Dhwaneel Trivedi
%A Suraj Singh
%A Rashmi Thakur
%T Enhancement of Marketing Strategies using Weighted Association Rule Mining
%J International Journal of Computer Applications
%@ 0975-8887
%V 68
%N 21
%P 28-33
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper symbolizes our aim to promote Business organizations to take marketing decisions based on mining large databases of Transactions. Frequent item sets and Strong Association Rules are formed without need of supplying minimum support and minimum confidence. We have proposed and implemented an algorithm that scans Database only once and modifies Apriori algorithm and produces better results.

References
  1. W. Wang, J. Yang, and P. S. Yu, "Efficient Mining of Weighted Association Rules (WAR)," Proc. ACM SIGKDD '00, pp. 270-274, 2000.
  2. Omiecinski, "Alternative Interest Measures for Mining Associations in Data- bases", IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 1, pp. 57-69
  3. K. Wang and M. -Y. Su, "Item Selection by "Hub-Authority" Profit Ranking, Proc. ACM SIGKDD, 2002.
  4. R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules between Sets of Items in Large Datasets," Proc. ACM SIGMOD '93, pp. 207-216, 1993.
  5. Ke Sun and Fengshan Bai "Mining Weighted Association Rules without Preassigned Weights", IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, Vol. 20, No. 4, pp. 489-495, April 2008.
  6. J. M. Kleinberg, "Authoritative Sources in a Hyperlinked Environment," J. ACM, vol. 46, no. 5, pp. 604-632, 1999.
  7. F. Tao, F. Murtagh, and M. Farid, "Weighted Association Rule Mining Using Weighted Support and Significance Framework," Proc. ACM SIGKDD '03, pp. 661-666, 2003.
  8. Liu, B. Hsu, W. , Ma, Y. , "Mining Association Rules with Multiple Minimum Supports," Proc. Knowledge Discovery and Data Mining Conf. , pp. 337-341, Aug. 1999.
  9. A. Borodin, G. Roberts, J. Rosenthal, "Link Analysis Ranking : Algorithms, Theory, and Experiments", Panayiotis Tsaparas, ACM Transactions on Internet Technology, Vol. 5, No. 1, February 2005, Pages 231-297
  10. R. Aggarwal, R. Srikant, "Fast Algorithm for mining Association Rules", IBM Almaden Research Centre, Proceedings of 20th VLDB Conference, Santiago, Chile, 1994.
Index Terms

Computer Science
Information Sciences

Keywords

Support Confidence weighted support weighted confidence

Powered by PhDFocusTM