An Efficient Mining Approach of Frequent Data Item Sets on Large Uncertain Databases

International Journal of Computer Trends and Technology (IJCTT)          
© 2015 by IJCTT Journal
Volume-20 Number-1
Year of Publication : 2015
Authors : Isse Hassan Sheikh Nur


Isse Hassan Sheikh Nur "An Efficient Mining Approach of Frequent Data Item Sets on Large Uncertain Databases". International Journal of Computer Trends and Technology (IJCTT) V20(1):37-40, Feb 2015. ISSN:2231-2803. Published by Seventh Sense Research Group.

Abstract -
Mining frequent items from large uncertain database is a crucial issue, according to the accuracy, performance and computational cost, where we need the frequent itemset is ascertained efficiently and accurately with low computational cost and high performance in detecting probabilistic frequent item (PFI), so all of these factors are the required or recommended in a large uncertain database to extract the frequent items efficiently and accurately. In uncertain database the support of an item occurs randomly instead of fixed variable. We will use a model based algorithm and dynamic algorithm for mining and generating candidate itemsets for frequent itemsets in large uncertain data. Our goal is a better performance based on our dataset.

[1] Meta Group Application Development Strategies, “Data Mining for Data Warehouses: Uncovering Hidden Patterns”, July 1995.
[2] R. S. Jadon, S. Joshi, “An Implementation of Frequent Pattern Mining Algorithm using Dynamic Function”, International Journal of Computer Applications, vol. 9, pp. 37–41, Nov. 2010.
[3] D. Bhalodiya, K. M. Patel, Ch. Patel, “An Efficient way to Find Frequent Pattern With Dynamic Programming Approach,” Nirma University International Conference On Engineering, NUiCONE '13, vol. 20, pp. 569–571, Nov. 2013.
[4] M. W.David, “Evaluation: From Precision, Recall and F-Factor to ROC, Informedness, Markedness & Correlation,” Journal of Machine Learning Technologies, vol. 2, pp. 37–63, 2011.

Frequent itemsets, Probabilistic Frequent Item