Abstract
The data dependency among attributes is very important for the rule generation. So far, we proposed a dependency among attributes in a table with non-deterministic information, and developed some important algorithms. According to these algorithms, a procedure for dependencies has been implemented. This paper proposes new algorithms and enhances the implemented procedure. In two procedures, the manipulation of equivalence relations takes an important role.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Orlowska, E.(Ed.) (1998): Incomplete Information: Rough Set Analysis. Physica-Verlag
Pawlak, Z. (1991): Rough Sets. Kluwer Academic Publisher
Sakai, H. (2001): An Enhancement of a Procedure for Checking Dependencies of Attributes in a Table with Non-deterministic Information. Bulletin of International Rough Set Society 5(1–2), 81–87
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakai, H. (2001). Two Procedures for Dependencies among Attributes in a Table with Non-deterministic Information: A Summary. In: Terano, T., Ohsawa, Y., Nishida, T., Namatame, A., Tsumoto, S., Washio, T. (eds) New Frontiers in Artificial Intelligence. JSAI 2001. Lecture Notes in Computer Science(), vol 2253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45548-5_35
Download citation
DOI: https://doi.org/10.1007/3-540-45548-5_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43070-4
Online ISBN: 978-3-540-45548-6
eBook Packages: Springer Book Archive