2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)
DOI: 10.1109/icsmc.2004.1400837
|View full text |Cite
|
Sign up to set email alerts
|

Learning coverage rules from incomplete data based on rough sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 20 publications
0
0
0
Order By: Relevance
“…According to study, the idea of attribute-value pair block is used to determine characteristic sets, characteristic relations, lower and upper approximation and rule extraction from an incomplete decision table. Some other rough set approaches to handling missing attribute values are presented in Hong, Tseng and Chien (2004), Nakata and Sakai (2005); Wang (2002) as well. Nguyen (2008) proposed a method of Boolean reasoning and discernibility for efficient computation of different entities like reduct and rule generation.…”
Section: Literature Reviewmentioning
confidence: 99%
“…According to study, the idea of attribute-value pair block is used to determine characteristic sets, characteristic relations, lower and upper approximation and rule extraction from an incomplete decision table. Some other rough set approaches to handling missing attribute values are presented in Hong, Tseng and Chien (2004), Nakata and Sakai (2005); Wang (2002) as well. Nguyen (2008) proposed a method of Boolean reasoning and discernibility for efficient computation of different entities like reduct and rule generation.…”
Section: Literature Reviewmentioning
confidence: 99%