UF-Evolve - Uncertain frequent pattern mining

Shu Wang, Vincent To Yee Ng

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)

Abstract

Many frequent-pattern mining algorithms were designed to handle precise data, such as the FP-tree structure and the FP-growth algorithm. In data mining research, attention has been turned to mining frequent patterns in uncertain data recently. We want frequent-pattern mining algorithms for handling uncertain data. A common way to represent the uncertainty of a data item in record databases is to associate it with an existential probability. In this paper, we propose a novel uncertain-frequent-pattern discover structure, the mUF-tree, for storing summarized and uncertain information about frequent patterns. With the mUF-tree, the UF-Evolve algorithm can utilize the shuffling and merging techniques to generate iterative versions of it. Our main purpose is to discover new uncertain frequent patterns from iterative versions of the mUF-tree. Our preliminary performance study shows that the UF-Evolve algorithm is efficient and scalable for mining additional uncertain frequent patterns with different sizes of uncertain databases.
Original languageEnglish
Title of host publicationICEIS 2011 - Proceedings of the 13th International Conference on Enterprise Information Systems
Pages74-84
Number of pages11
Volume1 DISI
Publication statusPublished - 1 Dec 2011
Event13th International Conference on Enterprise Information Systems, ICEIS 2011 - Beijing, China
Duration: 8 Jun 201111 Jun 2011

Conference

Conference13th International Conference on Enterprise Information Systems, ICEIS 2011
CountryChina
CityBeijing
Period8/06/1111/06/11

Keywords

  • Shuffling and merging
  • Tree
  • Uncertain frequent pattern mining

ASJC Scopus subject areas

  • Information Systems and Management

Cite this