Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Zhao, Suyun | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/3454 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | A framework of fuzzy variable precision rough sets and its applications | en_US |
| dcterms.abstract | The traditional rough sets model was restrictive for many applications since it could only handle the symbolic valued databases without misclassification. Here misclassification means the wrong or missing information in classification. As a generalization, the Variable Precision Rough Set model (VPRS) was introduced to handle databases with misclassification. However it could not effectively handle numerical data (real number data). To handle the databases with non-symbolic values, some generalization models of rough sets, called Fuzzy Rough Sets (FRS), have been introduced by combining fuzzy sets and rough sets. It could handle databases with numerical data. However, FRS was sensitive to misclassification and perturbation. Here perturbation means small change between the observed data and factual data. It is valuable to combine FRS and VPRS so that a powerful tool, which can effectively handle numerical data with misclassification and perturbation, is developed. In this thesis we first study two applications of FRS and find their limitations in real worlds which show the necessity to propose a robust model. Second, we generalize FRS and then propose a robust model named Fuzzy Variable Precision Rough Sets (FVPRS). After compring FVPRS with some flexible generalizations of RS, we find that FVPRS has good prospects for some real applications. Third, we establish two applications with FVPRS: attribute reduction and classifier construction. In these two applications, we propose the concepts of reductions in FVPRS and investigate their structures by using discernibility matrix (or vector). We also develop the algorithms to find the reductions. Thus a unified variable precision framework of FRS is set up. Finally in order to overcome NP-hard problem of finding the optimal solutions, we design some fast heuristic algorithms (the computational complexities of these algorithms increase with the square of the number of attributes) to obtain near-optimal solutions. From the theoretical viewpoints, the main contribution of this thesis is that we propose a robust framework with respect to misclassification and perturbation. From the practical viewpoint, the main contribution of this thesis is that two robust applications of FVPRS are proposed based on the strict mathematical reasoning. | en_US |
| dcterms.extent | xiii, 160 p. : ill. ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2009 | en_US |
| dcterms.educationalLevel | All Doctorate | en_US |
| dcterms.educationalLevel | Ph.D. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations. | en_US |
| dcterms.LCSH | Rough sets. | en_US |
| dcterms.LCSH | Fuzzy sets. | en_US |
| dcterms.LCSH | Machine learning. | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b23068061.pdf | For All Users | 9.55 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/3454