An algorithm for checking dependencies of attributes in a table with non-deterministic information: a rough sets based approach

Authors:
Hiroshi Sakai;Akimichi Okuma
Affiliations:
Department of Computer Engineering, Kyushu Institute of Technology, Tobata, Japan;Department of Computer Engineering, Kyushu Institute of Technology, Tobata, Japan
Venue:
PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence
Year:
2000

Citing 8
Cited 4

From rough set theory to evidence theory

Advances in the Dempster-Shafer theory of evidence
A new version of the rule induction system LERS

Fundamenta Informaticae
Query approximate answering system for an incomplete DKBS

Fundamenta Informaticae - Special issue: intelligent information systems
On semantic issues connected with incomplete information databases

ACM Transactions on Database Systems (TODS)
Induction of Decision Trees

Machine Learning
Database Mining: A Performance Perspective

IEEE Transactions on Knowledge and Data Engineering
Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery

PKDD '97 Proceedings of the First European Symposium on Principles of Data Mining and Knowledge Discovery
An Algorithm for Finding Equivalence Relations from Tables with Non-Deterministic Information

RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing

Effective Procedures for Handling Possible Equivalence Relations in Non-deterministic Information Systems

Fundamenta Informaticae
Attribute dependency functions considering data efficiency

International Journal of Approximate Reasoning
Possible equivalence relations and their application to hypothesis generation in non-deterministic information systems

Transactions on Rough Sets II
Effective Procedures for Handling Possible Equivalence Relations in Non-deterministic Information Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rough sets theory depending upon deterministic information has recently been applied to machine learning, knowledge discovery and knowledge acquisition. For handhng some incomplete information, we are now discussing rough sets on non-deterministic information and we have developed some tool programs. In this paper, we propose a definition for dependencies of attributes on non-deterministic information and an algorithm for checking it. According to this algorithm, we have reahzed a program. To clarify the dependency on non-deterministic information will be useful for extraction of rules from nondeterministic information.