원문정보
초록
영어
Due to various reasons, there are generally missing data in datasets. Usually the missing data in these incomplete datasets need to be filled. In this paper, the drawbacks of some existing data filling approaches for incomplete information systems are analyzed based on Rough Set theory. Several similarity relation models are discussed and the Valued Limited Tolerance Relation model is proposed. A data filling algorithm based on the Valued Limited Tolerance Relation model is put forward. This approach makes full use of the similarity of objects and selects the object which is the most similar to the incomplete object. More missing data can be filled scientifically. The experimental results show that this approach is effective.
목차
1. Introduction
2. Basic Rough Set Notions
3. Data Filling Algorithm for Incomplete Information System
3.1. Tolerance Relation and ROUSTIDA Algorithm
3.2. Valued Tolerance Relation and Data Filling Algorithm
3.3. Limited Tolerance Relation
3.4. Valued Limited Tolerance Relation
3.5. Data Filling Algorithm Based on Valued Limited Tolerance Relation
4. Instances
5. Analysis
References
