Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/8802
Title: | Efficient frequent pattern mining | Authors: | GOETHALS, Bart | Advisors: | VAN DEN BUSSCHE, Jan | Issue Date: | 2002 | Publisher: | UHasselt Diepenbeek | Abstract: | ... In this thesis we focus on the Frequent Pattern Discovery task and how it can be efficiently solved in the specific context of itemsets and association rules. The original motivation for searching association rules came from the need to analyze so called supermarket transaction data, that is, to examine customer behavior in terms of the purchased products. Association rules describe how often items are purchased together. For example, an association rule "beer::::;, chips (80%)" states that four out of five customers that bought beer also bought chips. Such rules can be useful for decisions concerning product pricing, promotions, store layout and many others. Since their introduction in 1993 by Argawal et al. [3], the frequent itemset and association rule mining problems have received a great deal of attention. Within the past decade, hundreds of research papers have been published presenting new algorithms or improvements on existing algorithms to solve these mining problems more efficiently. ... | Document URI: | http://hdl.handle.net/1942/8802 | Category: | T1 | Type: | Theses and Dissertations |
Appears in Collections: | PhD theses Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Bart Goethals.pdf | 7.88 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.