Downloads: 106 | Views: 183

Dissertation Chapters | Computer Science & Engineering | India | Volume 4 Issue 6, June 2015

Probabilistic Frequent Sequential Patterns Analysis Using Apriori of Unsure Databases

Madhavi G. Patil | Ravi Patki ^[2]

Abstract: Frequent item-set mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied on standard (certain) transaction databases. Data uncertainty is inherent in number of real-world applications. Uncertain transaction databases consist of sets of existentially uncertain items. The uncertainty of items in transactions makes traditional techniques inapplicable. Mining serial patterns from inaccurate data, like those data arising from detector readings is incredibly necessary for locating hidden information in such applications. In applications such as natural habitat monitoring, web data integration, the values of the underlying data are inherently deafening or vague. PrefixSpan tend to propose to reside pattern frequentness supported the achievable globe linguistics. It tend to establish two unsure sequence information models ed from a number of real-life applications involving uncertain sequence information, and plan the subject of removal probabilistically frequent sequential patterns from information that adapt to developed models.

Keywords: FREQUENT ITEM-SET, SERIAL PATTERNS, UNCERTAIN DATABASES, PREFIXSPAN ALGORITHM

Edition: Volume 4 Issue 6, June 2015,

Pages: 2953 - 2955