Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

A New Incremental Mining of Frequent Item Set On Large Unstructured Dataset

Author : G.K.Sharmila 1 Dr. T. Hanumantha Reddy 2

Date of Publication :18th April 2018

Abstract: The information present in the unstructured dataset are often inaccurate in nature.In this paper we examine the problem of preserving the mining result for a dataset that is changing by pushing a new tuple into the dataset. The problem is technically difficult because an uncertain[14] dataset contains an exponential number of possible worlds. To overcome this problem we proposed a KNN (k-nearest neighbor) algorithm to get the content of each review.Here we need to apply k-value based on that display the review with the classification. All our approaches support both tuple and attribute uncertainty, which are two common uncertain data set models.

Reference :

    1. Adriano Veloso and Wagner Meira Jr. and Marcio de Carvalho and ´ Bruno Possas and Srinivasan Parthasarathy and Mohammed Javeed ˆ Zaki. Mining Frequent Itemsets in Evolving Databases. In SDM, 2002.
    2. C. Aggarwal, Y. Li, J. Wang, and J. Wang. Frequent pattern mining with uncertain data. In KDD, 2009.
    3. C. Aggarwal and P. Yu. A survey of uncertain data algorithms and applications. TKDE, 21(5), 2009.
    4. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules ´ between sets of items in large databases. In SIGMOD, 1993.
    5. O. Benjelloun, A. D. Sarma, A. Halevy, and J. Widom. ULDBs: databases with uncertainty and lineage. In VLDB, 2006
    6. T. Bernecker, H. Kriegel, M. Renz, F. Verhein, and A. Zuefle. Probabilistic frequent itemset mining in uncertain databases. In KDD, 2009
    7. H. Cheng, P. Yu, and J. Han. Approximate frequent itemset mining in the presence of random noise. Soft Computing for Knowledge Discovery and Data Mining, pages 363–389, 2008.
    8. R. Cheng, D. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003.
    9. D. Cheung, J. Han, V. Ng, and C. Wong. Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. In ICDE, 1996.
    10. D. Cheung, S. D. Lee, and B. Kao. A General Incremental Technique for Maintaining Discovered Association Rules. In DASFAA, 1997.

Recent Article