MSpace - DSpace at UofM >
Faculty of Graduate Studies (Electronic Theses and Dissertations) >
FGS - Electronic Theses & Dissertations (Public) >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1993/4034

Title: Mining frequent itemsets from uncertain data: extensions to constrained mining and stream mining
Authors: Hao, Boyu
Supervisor: Leung, Carson K. (Computer Science)
Examining Committee: Scuse, David H. (Computer Science) Wang, Xikui (Statistics)
Graduation Date: October 2010
Keywords: Data Mining
Databases
Issue Date: 19-Jul-2010
Citation: Leung, C.K.-S., Carmichael, C.L., Hao, B. (2007). Efficient mining of frequent patterns from uncertain data. In Proc. IEEE ICDM Workshops 2007: 489-494.
Leung, C.K.-S., Hao, B. (2009). Mining of frequent itemsets from streams of uncertain data. In Proc. IEEE ICDE 2009: 1663-1670.
Leung, C.K.-S., Hao, B., Jiang, F. (2010). Constrained frequent itemset mining from uncertain data streams. In Proc. IEEE ICDE Workshops 2010: 120-127.
Leung, C.K.-S., Hao, B., Brajczuk, D.A. (2010). Mining uncertain data for frequent itemsets that satisfy aggregate constraints. In Proc. ACM SAC 2010: 1034-1038.
Abstract: Most studies on frequent itemset mining focus on mining precise data. However, there are situations in which the data are uncertain. This leads to the mining of uncertain data. There are also situations in which users are only interested in frequent itemsets that satisfy user-specified aggregate constraints. This leads to constrained mining of uncertain data. Moreover, floods of uncertain data can be produced in many other situations. This leads to stream mining of uncertain data. In this M.Sc. thesis, we propose algorithms to deal with all these situations. We first design a tree-based mining algorithm to find all frequent itemsets from databases of uncertain data. We then extend it to mine databases of uncertain data for only those frequent itemsets that satisfy user-specified aggregate constraints and to mine streams of uncertain data for all frequent itemsets. Experimental results show the effectiveness of all these algorithms.
URI: http://hdl.handle.net/1993/4034
Appears in Collection(s):FGS - Electronic Theses & Dissertations (Public)

Files in This Item:

File Description SizeFormat
Hao_B_MSc-Mining_frequent_itemsets.pdf8.05 MBAdobe PDFView/Open
View Statistics

Items in MSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! MSpace Software Copyright © 2002-2010  Duraspace - Feedback