Skip to Main content Skip to Navigation
Conference papers

A Compression Method of Decision Table Based on Matrix Computation

Abstract : A new algorithm of attribute reduction based on boolean matrix computation is proposed in this paper. The method compresses the valid information stored in table into a binary tree, at the same time deleting the invalid information and sharing a branch about the same prefix information. Some relative concepts such as local core attributes, local attribute reduction and global core attributes, global attribute reduction are introduced. The conclusions that the global core set is the union of all local core sets and the global attribute reduction sets are the union of respective local attribute reduction sets are proved. The attribute reduction steps of the algorithm are presented. At last, The correctness and effectiveness of the new algorithm are also shown in experiment and in an example.
Document type :
Conference papers
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-01564813
Contributor : Hal Ifip <>
Submitted on : Wednesday, July 19, 2017 - 11:23:16 AM
Last modification on : Thursday, March 5, 2020 - 5:42:48 PM

File

978-3-642-18369-0_1_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Laipeng Luo, Ergen Liu. A Compression Method of Decision Table Based on Matrix Computation. 4th Conference on Computer and Computing Technologies in Agriculture (CCTA), Oct 2010, Nanchang, China. pp.1-7, ⟨10.1007/978-3-642-18369-0_1⟩. ⟨hal-01564813⟩

Share

Metrics

Record views

109

Files downloads

175