The Representation of Indiscernibility Relation Using ZBDDs - Intelligent Information Processing VI Access content directly
Conference Papers Year : 2012

The Representation of Indiscernibility Relation Using ZBDDs

Abstract

The indiscernibility relation is the basic concept in Rough set theory, a novel representation of indiscernibility relation using Zero-Suppressed BDDs is proposed in this paper. Through introducing the indiscernibility matrix and the indiscernibility graph, we put forward the encoding of the variable and give the characteristic function. Once the characteristic function is constructed, it can be represented using ZBDDs.And further, combined with an example, we analyze the effectiveness of this method. It provides a basis for deal with rough set computing.
Fichier principal
Vignette du fichier
978-3-642-32891-6_28_Chapter.pdf (263.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01524971 , version 1 (19-05-2017)

Licence

Attribution

Identifiers

Cite

Qianjin Wei, Tianlong Gu, Fengying Li, Guoyong Cai. The Representation of Indiscernibility Relation Using ZBDDs. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. pp.216-225, ⟨10.1007/978-3-642-32891-6_28⟩. ⟨hal-01524971⟩
39 View
216 Download

Altmetric

Share

Gmail Facebook X LinkedIn More