A Compression Method of Decision Table Based on Matrix Computation - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

A Compression Method of Decision Table Based on Matrix Computation

(1) , (1)
1
Laipeng Luo
  • Function : Author
  • PersonId : 1013059

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.
Fichier principal
Vignette du fichier
978-3-642-18369-0_1_Chapter.pdf (64.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01564813 , version 1 (19-07-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
25 View
41 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More