摘要:The problem of constructing a data table which satisfies available knowledge, is one of the most important problems in the field of knowledge discovery and data mining. Based on some results in relational database theory, in this paper we introduce an algorithm to construct a decision table which satisfies a given relation scheme. In the worst case, the time complexity of the proposed algorithm is exponential in the number of attributes.
关键词:Data mining; rough set theory; relational database; decision table.