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.
목차
Abstract 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
보안공학연구지원센터(IJDTA) [Science & Engineering Research Support Center, Republic of Korea(IJDTA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Database Theory and Application
간기
격월간
pISSN
2005-4270
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Database Theory and Application Vol.8 No.6