Rough Sets and Data Mining pp 229-238 | Cite as
Neighborhoods, Rough Sets, and Query Relaxation in Cooperative Answering
Abstract
We present a mathematical treatment of query relaxation based on the notions of neighborhoods and rough sets. In a relational database management system, for each query term, the user provides the system a list of related terms, called a neighborhood. A relational database management system engine then performs queries using related terms in the neighborhood. A neighborhood in this sense is a binary relation without further axioms. Since the relational database management system engine can not perform transitive closure, the resulting list of relaxed queries is the closure (or upper approximation) in the theory of neighborhood systems. In contrast to relational database management systems, the underlying logic model for first-order deductive database systems provides for transitive closure and therefore guarantees the transitive closure of a neighborhood, the resulting list of which is precisely the upper approximation in rough set theory.
Preview
Unable to display preview. Download preview PDF.
References
- [1]Engesser. K, Some connections between topological and modal logic, Mathematical Logic Quarterly, 41, pp. 49–64, 1995.MathSciNetMATHCrossRefGoogle Scholar
- [2]Back, T., Evolutionary Algorithms in Theory and Practice, Oxford University Press, 1996.Google Scholar
- [3]Bairamian, S., Goal Search in Relational Databases, thesis, California State University-Northridge, 1989.Google Scholar
- [4]Chu, W.W., Neighborhood and associative query answering, Journal of Intelligent Information Systems, 1, pp. 355–382, 1992.CrossRefGoogle Scholar
- [5]Chu, W. W., and Q. Chen, A structured approach for cooperative query answering, IEEE Transactions on Knowledge and Data Engineering, 6(5), pp. 738–749.Google Scholar
- [6]Gaasterland, T., Generating Cooperative Answers in Deductive Databases, Ph.D. dissertation, University of Maryland, College Park, Maryland, 1992.Google Scholar
- [7]Gaasterland, T., Restricting query relaxation through user constraints, in Proceedings of the International Conference on Intelligent and Cooperative Information Systems. Huhns, M.; Papazoglou, M. P.; and Schlageter, G., eds. Los Alamitos, California, IEEE Computer Society Press, 1993, pp. 359–366.Google Scholar
- [8]Lin, T. Y. and S. Bairamian, Neighborhood systems and goal queries, unpublished manuscript, California State University, Northridge, 1987.Google Scholar
- [9]Lin, T. Y., Neighborhood systems and relational databases, abstract, in Proceedings of Annual Computer Science Conferences, CSC ’88, February 1988.Google Scholar
- [10]Lin, T. Y., Neighborhood systems and approximation in database and knowledge base systems. Poster session paper presented at the Colloquium of the Fourth International Symposium on Methodologies of Intelligent Systems, 1989.Google Scholar
- [11]Lin, T.Y., Q. Liu, and K.J. Huang, Rough sets, neighborhood systems and approximation, in Fifth International Symposium on Methodologies of Intelligent Systems, Selected Papers, 1990.Google Scholar
- [12]Yao, Y.Y. and Lin, T.Y., Generalization of rough sets using modal logic. To appear inIntelligent Automation and Soft Computing.Google Scholar
- [13]Motro, A., Supporting Goal Queries in Relational Databases, in Expert Database Systems: Proceedings of the First International Conference, L. Kerschberg, ed., Institute of Information Management, Technology and Policy, University of South Carolina, 1986, pp. 85–96.Google Scholar
- [14]Sierpenski, W. and Krieger, C., General Topology, University of Toronto, Toronto, 1956.Google Scholar