Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Wang, Shu | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/6511 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Iterative uncertain frequent pattern mining with trees | en_US |
| dcterms.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. A common way to represent the uncertainty of a data item in transactional databases is to associate it with an existential probability. In this thesis, we propose two solutions for uncertain frequent pattern mining. One solution is a novel uncertain-frequent-pattern discovery 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 the tree. Its main purpose is to discover new uncertain frequent patterns from these iterative versions. The other solution is the mUF-trie structure and the UF-Prune algorithm. In the mUF-trie, the uncertain information about frequent patterns is summarized in the lexicographic order, which facilitates mining uncertain frequent patterns separately for each item. With the mUF-trie, the UF-Prune algorithm can continuously generate a sub-trie for each item, utilize the shuffling and merging techniques to generate iterative versions of the sub-trie, and prune away the processed items in the mUF-trie. As in the mUF-tree, the new structure can support the discovery of new uncertain frequent patterns relating to each item from iterative versions of its sub-trie. Our preliminary performance study shows that the UF-Evolve and UF-Prune algorithms are efficient and scalable for mining additional uncertain frequent patterns. We have also proposed an application and some extended work of the two solutions. The uncertain frequent pattern mining for rural systems can find out special patterns relating to productivity and sustainability to improve profitability or environmental gain for valuable crops, and the extensions are related to incremental uncertain frequent pattern mining with the mUF-tree and mUF-trie. | en_US |
| dcterms.extent | xii, 83 leaves : ill. ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2012 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.LCSH | Data mining. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b25073515.pdf | For All Users | 1.05 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/6511