Decision of the attribute reductivity about concept lattices
Guojun Wang
Abstract
Guojun Wang
Abstract
Introduces the concept of Galois connection by which concept lattices are studied further.The two concept lattices which are concept lattice isomorphic with each other are lattice isomorphic with each other.In order to find out more concise and reasonable reduction algorithm,four kinds of decision theorems of consistent set are proposed in general formal context(i.e.attribute sets and object sets are finite or infinite),which generalize the present results.It is illustrated by an example that the reduction needs not exist in general formal context.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Introduces the concept of Galois connection by which concept lattices are studied further.The two concept lattices which are concept lattice isomorphic with each other are lattice isomorphic with each other.In order to find out more concise and reasonable reduction algorithm,four kinds of decision theorems of consistent set are proposed in general formal context(i.e.attribute sets and object sets are finite or infinite),which generalize the present results.It is illustrated by an example that the reduction needs not exist in general formal context.
Key concepts: Galois connection, Lattice Miner, Formal concept analysis, Lattice (music), Mathematics, Complete lattice, Rough set, Map of lattices