Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Shu, Yue Joyce | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/1555 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Mining fuzzy weighted association rule with domain knowledge | en_US |
| dcterms.abstract | The objective of data mining is to discover and extract valuable information from data, i.e., the hidden gold. Before we design a data mining system to support decision-making, we have to know how people make decision. Some sociologists carried out investigations into 60 highly successful California enterprise managers. These managers were asked how they made business decision. All of them answered that they used a combination of their intuition and the data. No one said they made decision based on data alone. Significant data mining problems have been addressed recently, namely, mining fuzzy association rules. Using the fuzzy set concept, the discovered rules are more easily understandable. In most models of mining fuzzy association rules, items are considered to have equal importance. However, depending on a user's domain knowledge, items should have different degree of importance for each user. Existing models do not address such individual interest and preference. To improve such models, we proposed the mining of fuzzy association rules with weighted items. The weighted support and weighted confidence for fuzzy association rules are defined. Our Experiments are based on some benchmark problems. For example, adult records selected by a census of the United States in 1990, show the strengths of our proposed methodology. The strengths are that, for different users who are interested in different attributes (i.e. who assign different values of weights to corresponding attributes), different fuzzy association rules which reflect the initial interest of users are mined. The relationship between the mining with and without weighted-items in a large database is obtained. | en_US |
| dcterms.extent | x, 92 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2003 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.LCSH | Data mining | en_US |
| dcterms.LCSH | Rule-based programming | en_US |
| dcterms.LCSH | Computer algorithms | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b16927266.pdf | For All Users | 5.29 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/1555