Abstract
This paper extends the notion of information tables and concept hierarchies of equivalence relations to binary relations. So extended rough set theory and attribute oriented generalization techniques can be used to mining binary relations in data.
partially supported by EPRI, SJSU, NASA NCC2-275, ONR N00014-96-1-0556, LLNL 442427-26449, ARO DAAH04-961-0341, and BISC at UC-Berkeley
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Agrawal, T. Imielinski A. Swami, Mining Association Rules Between Sets of Items in Large Databases. In Proceeding of ACM-SIGMOD international Conference on Management of Data, pp. 207–216, Washington, DC, June, 1993
Y.D. Cai, N. Cercone, and J. Han. Attribute-oriented induction in relational databases. In Knowledge Discovery in Databases, pages 213–228. AAAI/MIT Press, Cambridge, MA, 1991.
W. Chu, Neighborhood and associative query answering, Journal of Intelligent Information Systems, 1, 355–382, 1992.
H. J. Hamilton and D. R. Fudger. Estimating DBLEARN’s potential for knowledge discovery in databases. Computational Intelligence, 11(2), 1995.
M. Hadjimichael and A. Wasilewska. Interactive inductive learning. International Journal of Man-Machine Studies, 38:147–167, 1993.
T. Y. Lin, Granular Computing of Binary relations I: Data Mining and Neighborhood Systems. In:Rough Sets and Knowledge Discovery, L. Polkowski and A. Skowron (Editors), Springer-Verlag (to appear).
T. Y. Lin, Granular Computing of Binary relations II: Rough Set Representations and Belief Functions. In:Rough Sets and Knowledge Discovery, L. Polkowski and A. Skowron (Editors), Springer-Verlag (to appear).
T. Y. Lin, Granular Computing: Fuzzy Logic and Rough Sets. In Computing with words information/intelligent systems, L.A. Zadeh and J. Kacprzyk (Editors), Springer-Verlag (to appear)
T. Y. Lin, Neighborhood Systems-A Qualitative Theory for Fuzzy and Rough Sets. In: Advances in Machine Intelligence and Soft Computing, Volume IV. Ed. Paul Wang, 132–155, 1997.
T. Y. Lin, Rough Set Theory in Very Large Databases, Symposium on Modeling, Analysis and Simulation, IMACS Multi Conference (Computational Engineering in Systems Applications), Lille, France, July 9–12, 1996, Vol. 2 of 2, 936–941.
T. Y. Lin and R. Chen, Finding Reducts in Very Large Databases, Proceedings of Joint Conference of Information Science, Research Triangle Park, North Carolina, March 1–5, 1997, 350–352.
Supporting Rough Set Theory in very large Databases using ORACLE RDBMS. In: Soft Computing in Intelligent Systems and Information Processing, Proceedings of 1996 Asian Fuzzy Systems Symposium, Kenting, Taiwan, December 11–14, 1996, 332–337
T. Y. Lin, Neighborhood Systems and Approximation in Database and Knowledge Base Systems. In: Proceedings of the Fourth International Symposium on Methodologies of Intelligent Systems, Poster Session, October 12–15, 1989, 75–86.
T. Y. Lin, “Topological Data Models and Approximate Retrieval and Reasoning. In: Proceedings of 1989 ACM Seventeenth Annual Computer Science Conference, February 21–23, Louisville, Kentucky, 1989, 453.
T. Y. Lin, Neighborhood Systems and Relational Database. In: Proceedings of 1988 ACM Sixteen Annual Computer Science Conference, February 23–25, 1988, 725
T. Y. Lin and M. Hadjimichael, Non-Classificatory Generalization in Data Mining. In: Proceedings of The Fourth International Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery, November 6–8, 1996, Tokyo, Japan, 404–411
T. Y. Lin and Y. Y. Yao, Neighborhoods Systems and Belief Functions. In: Proceedings of The Fourth Workshop on Rough Sets, Fuzzy Sets and Machine Discovery, Tokyo, Japan, November 8–10,1996, 202–207.
T. Y. Lin, and Y. Y. Yao, Mining Soft Rules Using Rough Sets and Neighborhoods. In: Symposium on Modeling, Analysis and Simulation, CESA’96 IMACS Multiconference (Computational Engineering in Systems Applications), Lille, France, 1996, Vol. 2 of 2, 1095–1100, 1996.
B. Michael and T.Y. Lin, Neighborhoods, Rough sets, and Query Relaxation, Rough Sets and Data Mining: Analysis of Imprecise Data, Kluwer Academic Publisher, 1997, 229–238. (Final version of paper presented in Workshop on Rough Sets and Database Mining, March 2, 1995
Z. Pawlak, Rough Sets (Theoretical Aspects of Reasoning about Data). Kluwer Academic, Dordrecht, 1991.
W. Sierpenski and C. Krieger, General Topology, University of Toronto Press 1952.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, T.Y., Zhong, N., Dong, J.J., Ohsuga, S. (1998). Frameworks for Mining Binary Relations in Data. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_53
Download citation
DOI: https://doi.org/10.1007/3-540-69115-4_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64655-6
Online ISBN: 978-3-540-69115-0
eBook Packages: Springer Book Archive