TY - JOUR
T1 - A Novel Variable Precision Reduction Approach to Comprehensive Knowledge Systems
AU - Yang, Chao
AU - Liu, Hongbo
AU - McLoone, Sean
AU - Chen, C. L. Philip
AU - Wu, Xindong
PY - 2018/1/15
Y1 - 2018/1/15
N2 - A comprehensive knowledge system reveals the intangible
insights hidden in an information system by integrating
information from multiple data sources in a synthetical manner.
In this paper, we present a variable precision reduction theory,
underpinned by two new concepts: distribution tables and genealogical
binary trees. Sufficient and necessary conditions to
extract comprehensive knowledge from a given information system
are also presented and proven. A complete variable precision
reduction (CVPR) algorithm is proposed, in which we introduce
four important strategies, namely, distribution table abstracting,
attribute rank dynamic updating, hierarchical binary classifying,
and genealogical tree pruning. The completeness of our algorithm
is proven theoretically and its superiority to existing methods
for obtaining complete reducts is demonstrated experimentally.
Finally, having obtaining the complete reduct set, we demonstrate
how the relationships between the complete reduct set and
comprehensive knowledge system can be visualized in a doublelayer
lattice structure using Hasse diagrams.
AB - A comprehensive knowledge system reveals the intangible
insights hidden in an information system by integrating
information from multiple data sources in a synthetical manner.
In this paper, we present a variable precision reduction theory,
underpinned by two new concepts: distribution tables and genealogical
binary trees. Sufficient and necessary conditions to
extract comprehensive knowledge from a given information system
are also presented and proven. A complete variable precision
reduction (CVPR) algorithm is proposed, in which we introduce
four important strategies, namely, distribution table abstracting,
attribute rank dynamic updating, hierarchical binary classifying,
and genealogical tree pruning. The completeness of our algorithm
is proven theoretically and its superiority to existing methods
for obtaining complete reducts is demonstrated experimentally.
Finally, having obtaining the complete reduct set, we demonstrate
how the relationships between the complete reduct set and
comprehensive knowledge system can be visualized in a doublelayer
lattice structure using Hasse diagrams.
U2 - 10.1109/TCYB.2017.2648824
DO - 10.1109/TCYB.2017.2648824
M3 - Article
SN - 2168-2267
VL - 48
SP - 661
EP - 674
JO - IEEE Transactions on Cybernetics
JF - IEEE Transactions on Cybernetics
IS - 2
ER -
