Title :
The study of discretization lattice and partition lattice
Author :
Wang, Li-Hong ; Yan, Wu ; Wu, Geng-feng
Author_Institution :
Sch. of Comput. Sci. & Technol., Yantai Univ., China
Abstract :
The relation between discretization lattice and partition lattice is studied in this paper. Comparison shows that a discretization lattice is a Boolean algebra while a partition lattice is not, and a mapping from discretization lattice to partition lattice based on the indiscernibility relation on attribute set is not a homomorphism. Analysis of some discretization algorithms demonstrates that these algorithms discretize an information table by searching its discretization lattice.
Keywords :
Boolean algebra; information theory; search problems; Boolean algebra; discretization algorithms; discretization lattice; information table; partition lattice; search problems; Algorithm design and analysis; Ambient intelligence; Approximation algorithms; Boolean algebra; Computer science; Cybernetics; Information analysis; Lattices; Mathematics; Partitioning algorithms;
Conference_Titel :
Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on
Print_ISBN :
0-7803-8403-2
DOI :
10.1109/ICMLC.2004.1381986
