Lattice description of approximation space

Author

Lishi Zhang

Author_Institution

Sch. of Sci., Dalian Ocean Univ., Dalian, China

fYear

2013

fDate

25-27 May 2013

Firstpage

2475

Lastpage

2478

Abstract

Knowledge reduction is one of the main problems in rough sets theory. The attribute reduction algorithms of decision table based on discernible matrix are required to construct discernible matrix, which is the core of the algorithms,the process is associated with the intersection of sets and discernibility function computing, in this paper, the system is equipped with a lattice structure, the operations on the decision table are transmitted into lattice operation, in this frame, we pave a way to explore the attribute reduction with lattice approaches.

Keywords

data mining; decision tables; functional programming; lattice theory; rough set theory; approximation space; attribute reduction algorithm; decision table; discernibility function computing; discernible matrix; knowledge discovery; knowledge reduction; lattice description; lattice operation; lattice structure; rough set theory; Approximation algorithms; Approximation methods; Educational institutions; Information systems; Knowledge based systems; Lattices; Rough sets; Approximation Space; Decision Table; Indiscernibility Matrix; Information System; Reduction of Attribute;

fLanguage

English

Publisher

ieee

Conference_Titel

Control and Decision Conference (CCDC), 2013 25th Chinese

Conference_Location

Guiyang

Print_ISBN

978-1-4673-5533-9

Type

conf

DOI

10.1109/CCDC.2013.6561355

Filename

6561355