A New method of packing the missing data

E Xu; GAO Xuedong; WU Sen; ZHANG Qiuyue

doi:10.13374/j.issn1001-053x.2005.03.027

Volume 27 Issue 3

Aug. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 2005 > 27(3): 364-366

E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

Citation:

E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

Citation:

E Xu, GAO Xuedong, WU Sen, ZHANG Qiuyue. A New method of packing the missing data[J]. Chinese Journal of Engineering, 2005, 27(3): 364-366. doi: 10.13374/j.issn1001-053x.2005.03.027

PDF( 377 KB)

A New method of packing the missing data

doi: 10.13374/j.issn1001-053x.2005.03.027

1. Management School, University of Science and Technology Beijing, Beijing 100083, China;
2. Department of Computer Science, Liaoning Institute of Technology, Jinzhou 121001, China;
3. Guanzhuang Campus, University of Science and Technology Beijing, Beijing 100024, China

Received Date: 2004-06-25
Rev Recd Date: 2004-11-03

Available Online: 2021-08-17

Abstract

Abstract

A new algorithm for filling up in complete data was presented according to rough sets. In this method, the main purpose was emphasizing the decision rules, the main means was selecting the important breaking points, and the iterative constraint was the quality of classification. Numerical illustration and database experiments show that the algorithm did not generate conflict rules,but highlighted them.
- rough sets,
- correlation,
- equivalent class,
- breaking point