Computer Science & Technology

An Efficient Incremental Attribute Reduction for Complex Information Systems

Expand
  • 1. School of Economics and Management,Fuzhou University,Fuzhou 350116,Fujian,China; 2. School of Intelligent Manufacturing,Sichuan University of Arts and Science,Dazhou 635000,Sichuan,China 
段海玲(1989-),女,博士生,主要从事企业管理系统研究和数据挖掘研究.

Received date: 2018-08-08

  Revised date: 2018-12-03

  Online published: 2019-05-05

Supported by

 Supported by National Natural Science Foundation of China(71171054) 

Abstract

An incremental attribute reduction algorithm for complex information systems with discrete and continu- ous mixed attributes was proposed. Firstly,the knowledge granulation in the granular computing model was extend- ed under the mixed information system,the neighborhood knowledge granulation was proposed,and a non-incre- mental attribute reduction algorithm based on the neighborhood knowledge granulation was constructed. Then,the incremental computation of neighborhood knowledge granulation with the increase of objects was studied under the mixed information system,and the efficiency of the computation was proved theoretically. Finally,an incremental attribute reduction algorithm for mixed information systems based on neighborhood knowledge granulation was pro- posed. Experimental results of UCI datasets show that the proposed algorithm has high incremental attribute reduc- tion performance in mixed information systems.

Cite this article

DUAN Hailing WANG Guangqiong . An Efficient Incremental Attribute Reduction for Complex Information Systems[J]. Journal of South China University of Technology(Natural Science), 2019 , 47(6) : 18 -30 . DOI: 10.12141/j.issn.1000-565X.180409

References

 
Outlines

/