Autosoft Journal

Online Manuscript Access


A New Frequent Pattern Mining Algorithm with Weighted Multiple Minimum Supports


Authors



Abstract

Association rules mining is one of the momentous areas in data mining. Frequent patterns mining plays an important role in association rules mining. The effects of traditional frequent patterns mining with same minimum support are highly affected by the value of minimum support. But, for many real datasets, it2019s hard to choose the value of minimum support. Too small values of minimum support may cause rules explosion, and too large values may cause rare item dilemma. In this paper we propose an improved approach to extract frequent patterns, which are more interesting to users. Because of the different characteristics of each item, we assign a multiple minimum support and weight based on item support and users2019 interests for each item. In order to define the minimum supports of itemsets, we suggest a novel method, which exploits the minimum constraint and maximum constraint to deal with the rare item dilemma and rules explosion problem. The combination of minimum constraint and maximum constraint is based on the weight of the itemset. In this way, we extend the support confidence framework. Experimental results show that the proposed approach is more efficient than other comparing methods.


Keywords


Pages

Total Pages: 8
Pages: 605-612

DOI
10.1080/10798587.2017.1316082


Manuscript ViewPdf Subscription required to access this document

Obtain access this manuscript in one of the following ways


Already subscribed?

Need information on obtaining a subscription? Personal and institutional subscriptions are available.

Already an author? Have access via email address?


Published

Volume: 23
Issue: 4
Year: 2017

Cite this document


References

Agrawal R. Proc. 20th int. conf. very large data bases

Chang, Joong Hyuk. "Mining Weighted Sequential Patterns in a Sequence Database with a Time-Interval Weight." Knowledge-Based Systems 24.1 (2011): 1-9. Crossref. Web. https://doi.org/10.1016/j.knosys.2010.03.003

Dass R. COMAD

Hahsler, Michael. "A Model-Based Frequency Constraint for Mining Associations from Transaction Data." Data Mining and Knowledge Discovery 13.2 (2006): 137-166. Crossref. Web. https://doi.org/10.1007/s10618-005-0026-2

Han J. VLDB

Han, Jiawei et al. "Mining Frequent Patterns Without Candidate Generation: A Frequent-Pattern Tree Approach." Data Mining and Knowledge Discovery 8.1 (2004): 53-87. Crossref. Web. https://doi.org/10.1023/B:DAMI.0000005258.31418.83

Lee, Yeong-Chyi, Tzung-Pei Hong, and Wen-Yang Lin. "Mining Association Rules with Multiple Minimum Supports Using Maximum Constraints." International Journal of Approximate Reasoning 40.1-2 (2005): 44-54. Crossref. Web. https://doi.org/10.1016/j.ijar.2004.11.006

Park, James J. et al., eds. "Mobile, Ubiquitous, and Intelligent Computing." Lecture Notes in Electrical Engineering (2014): n. pag. Crossref. Web. https://doi.org/10.1007/978-3-642-40675-1

ACM SIGKDD Explorations Newsletter 8.1 (2006): n. pag. Crossref. Web. https://doi.org/10.1145/1147234

ACM SIGKDD Explorations Newsletter 6.1 (2004): n. pag. Crossref. Web. https://doi.org/10.1145/1007730

Weiss S.M. Computer systems that learn: Classification and prediction methods from statistics, neural nets, machine learning and expert systems

Yun, Unil et al. "An Efficient Mining Algorithm for Maximal Weighted Frequent Patterns in Transactional Databases." Knowledge-Based Systems 33 (2012): 53-64. Crossref. Web. https://doi.org/10.1016/j.knosys.2012.02.002

Zhongliang L. Research of personalized recommendation model based on web log mining and association rules [D]

JOURNAL INFORMATION


ISSN PRINT: 1079-8587
ISSN ONLINE: 2326-005X
DOI PREFIX: 10.31209
10.1080/10798587 with T&F
IMPACT FACTOR: 0.652 (2017/2018)
Journal: 1995-Present




CONTACT INFORMATION


TSI Press
18015 Bullis Hill
San Antonio, TX 78258 USA
PH: 210 479 1022
FAX: 210 479 1048
EMAIL: tsiepress@gmail.com
WEB: http://www.wacong.org/tsi/