Paper Info
Title
Attribute-Oriented Knowledge Discovery in Rough Relational Databases
Abstract
The rough relational database model was developed for the management of uncertainty in relational databases. A particular type of knowledge discovery, attribute oriented induction of rules from generalized data is described in this paper. Rough Relational Databases In rough sets (Pawlak 1984) an approximation space is defined on some universe U by defining some equivalence relation that partitions the universe into equivalence classes called elementary sets, based on some definition of 'equivalence' as it relates to the application domain. Any finite union of these elementary sets is called a definable set. A rough set X é U, however, can be defined in terms of the definable sets in terms of its lower (RX) and
Year
Venue
Keywords
2007
FLAIRS Conference
relational database,equivalence relation,rough set,knowledge discovery
Field
DocType
Citations 
Data mining,Relational database,Computer science,Equivalence (measure theory),Natural language processing,Artificial intelligence,Equivalence class,Definable set,Discrete mathematics,Equivalence relation,Rough set,Knowledge extraction,Relational model
Conference
1
PageRank 
References 
Authors
0.35
2
2
Name
Order
Citations
PageRank
Theresa Beaubouef131732.74
Frederick E. Petry256269.24