论文信息 - Query Answering in DAKS Based on Reducts

Query Answering in DAKS Based on Reducts

In this paper we are interested in necessary and sufficient conditions needed to learn definitions of non-local attributes in DAKS (see [15], [1.4]) assuming that the confidence of what we learn is kept possibly the highest. The notion of a reduci introduced in Rough Sets theory seems to be quite useful in solving this problem. For every non-local attribute a and local attributes A, we introduce the notion of -directed set of reducts which basically models the strategy of search for a definition of a in DAKS.

Zbigniew W. Ras

[1] Salvatore J. Stolfo,et al. Mining Databases with Different Schemas: Integrating Incompatible Classifiers , 1998, KDD.

[2] Ewa Orlowska,et al. Expressive Power of Knowledge Representation Systems , 1984, Int. J. Man Mach. Stud..

[3] J. M. Żytkow. An Interpretation of a Concept in Science by a Set of Operational Procedures , 1982 .

[4] P. Frank,et al. Boston Studies in the Philosophy of Science , 1968 .

[5] Zbigniew W. Ras,et al. Resolving Queries Through Cooperation in Multi-Agent Systems , 1997 .

[6] Hiroshi Motoda,et al. Feature Selection for Knowledge Discovery and Data Mining , 1998, The Springer International Series in Engineering and Computer Science.

[7] Gio Wiederhold,et al. Abstraction of Representation for Interoperation , 1997, ISMIS.

[8] Zdzislaw Pawlak. Rough classification , 1999, Int. J. Hum. Comput. Stud..

[9] Shamkant B. Navathe,et al. Towards intelligent integration of heterogeneous information sources , 1996 .

[10] Jan M. Zytkow,et al. Discovery of Equations and the Shared Operational Semantics in Distributed Autonomous Databases , 1999, PAKDD.

[11] Jieming Zhu,et al. Operational Definition Refinement: A Discovery Process , 1992, AAAI.

[12] Zbigniew W. Ras,et al. Query Approximate Answering System for an Incomplete DKBS , 1997, Fundam. Informaticae.