Results 231 to 240 of about 1,388,038 (289)
Some of the next articles are maybe not open access.

Rules in incomplete information systems

Information Sciences, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marzena Kryszkiewicz
exaly   +3 more sources

Approximations and uncertainty measures in incomplete information systems

Information Sciences, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianhua Dai
exaly   +2 more sources

Rough set approach to incomplete information systems

Information Sciences, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marzena Kryszkiewicz
exaly   +2 more sources

Information structures in an incomplete real-valued information system

Journal of Intelligent & Fuzzy Systems, 2019
 An information system as a database that shows relationships between objects and attributes is a crucial mathematical model in the field of artificial intelligence. A real-valued information system is an information system where information function values of each attribute are real numbers.
Jiasheng Zeng, Jiali He, Rongping Chen
openaire   +1 more source

A direct approach for incomplete information systems

SPIE Proceedings, 2004
There are already some extensions of rough set theory for incomplete information systems, such as tolerance relation, limited tolerance relation, similarity relation, and etc. But there are no approaches and algorithms for these extensions. A direct approach for processing incomplete information systems is developed in this paper, including ...
Hai Huang, Guoyin Wang 0001, Yu Wu 0001
openaire   +1 more source

THE ALGORITHM ON KNOWLEDGE REDUCTION IN INCOMPLETE INFORMATION SYSTEMS

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002
Rough set theory is emerging as a powerful tool for reasoning about data, knowledge reduction is one of the important topics in the research on rough set theory. It has been proven that finding the minimal reduct of an information system is a NP-hard problem, so is finding the minimal reduct of an incomplete information system.
Jiye Liang, Zongben Xu
openaire   +2 more sources

Information Granules and Approximations in Incomplete Information Systems

2007 International Conference on Machine Learning and Cybernetics, 2007
In this paper three types of information granular structures, called similarity classes, maximal consistent blocks, and labeled blocks, in incomplete information systems are introduced. Their properties are examined. Based on the three structures of granules, three types of rough set approximation models are derived for mining of certain and possible ...
Wei-Zhi Wu, Xiao-Ping Yang
openaire   +1 more source

Information storage and retrieval systems with incomplete information II

Fundamenta Informaticae, 1979
In the paper is developed a theory of information storage and retrieval systems which arise in situations when a whole possessed information amounts to a fact that a given document has some feature from properly chosen set. Such systems are described as suitable maps from descriptor algebras into sets of subsets of sets of documents.
openaire   +3 more sources

Attribute reduction with homomorphism in incomplete information systems

2012 IEEE International Conference on Granular Computing, 2012
The notion of homomorphism is used as a tool to deal with attribute reduction in incomplete information systems. In this paper, we define a tolerance relation on the universe of discoures U, and the tolerance classes which are created by the tolerance relation can form a cover of U.
Xiao-Juan Liu, Ju-Sheng Mi
openaire   +1 more source

Home - About - Disclaimer - Privacy