@article{(Open Science Index):https://publications.waset.org/pdf/9999546,
	  title     = {Frequent Itemset Mining Using Rough-Sets},
	  author    = {Usman Qamar and  Younus Javed},
	  country	= {},
	  institution	= {},
	  abstract     = {Frequent pattern mining is the process of finding a
pattern (a set of items, subsequences, substructures, etc.) that occurs
frequently in a data set. It was proposed in the context of frequent
itemsets and association rule mining. Frequent pattern mining is used
to find inherent regularities in data. What products were often
purchased together? Its applications include basket data analysis,
cross-marketing, catalog design, sale campaign analysis, Web log
(click stream) analysis, and DNA sequence analysis. However, one of
the bottlenecks of frequent itemset mining is that as the data increase
the amount of time and resources required to mining the data
increases at an exponential rate. In this investigation a new algorithm
is proposed which can be uses as a pre-processor for frequent itemset
mining. FASTER (FeAture SelecTion using Entropy and Rough sets)
is a hybrid pre-processor algorithm which utilizes entropy and roughsets
to carry out record reduction and feature (attribute) selection
respectively. FASTER for frequent itemset mining can produce a
speed up of 3.1 times when compared to original algorithm while
maintaining an accuracy of 71%.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {8},
	  number    = {10},
	  year      = {2014},
	  pages     = {1836 - 1840},
	  ee        = {https://publications.waset.org/pdf/9999546},
	  url   	= {https://publications.waset.org/vol/94},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 94, 2014},
	}