Advances in the Dempster-Shafer theory of evidence
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
An application of rough set methods in control design
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Communication and Concurrency
Rough-Neuro-Computing: Techniques for Computing with Words
Rough-Neuro-Computing: Techniques for Computing with Words
Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Toward Intelligent Systems: Calculi of Information Granules
Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
Wireless Agent Guidance of Remote Mobile Robots: Rough Integral Approach to Sensor Signal Analysis
WI '01 Proceedings of the First Asia-Pacific Conference on Web Intelligence: Research and Development
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Fuzzy logic = computing with words
IEEE Transactions on Fuzzy Systems
Rough Neurocomputing Based on Hierarchical Classifiers
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Rough sets and infomorphisms: towards approximation of relations in distributed environments
Fundamenta Informaticae - Concurrency specification and programming
Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation Spaces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Spatio-Temporal Approximate Reasoning over Complex Objects
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Reinforcement Learning with Approximation Spaces
Fundamenta Informaticae
Calculi of Approximation Spaces
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Approximation spaces in off-policy Monte Carlo learning
Engineering Applications of Artificial Intelligence
Rough sets and information granulation
IFSA'03 Proceedings of the 10th international fuzzy systems association World Congress conference on Fuzzy sets and systems
Rough sets: trends and challenges
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Time complexity of decision trees
Transactions on Rough Sets III
Hi-index | 0.00 |
This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an agent. Agents are designed to classify information granules derived from sensors that respond to stimuli in the environment of an agent or received from other agents. Classification of information granules is carried out in the context of parameterized approximation spaces and a calculus of granules. Judgment in agents is a faculty of thinking about (classifying) the particular relative to decision rules derived from data. Judgment in agents is reflective, but not in the classical philosophical sense (e.g., the notion of judgment in Kant). In an agent, a reflective judgment itself is an assertion that a particular decision rule derived from data is applicable to an object (input). That is, a reflective judgment by an agent is an assertion that a particular vector of attribute (sensor) values matches to some degree the conditions for a particular rule. In effect, this form of judgment is an assertion that a vector of sensor values reflects a known property of data expressed by a decision rule. Since the reasoning underlying a reflective judgment is inductive and surjective (not based on a priori conditions or universals), this form of judgment is reflective, but not in the sense of Kant. Unlike Kant, a reflective judgment is surjective in the sense that it maps experimental attribute values onto the most closely matching descriptors (conditions) in the derived rule. Again, unlike Kant's notion of judgment, a reflective judgment is not the result of searching for a universal that pertains to a particular set of values of descriptors. Rather, a reflective judgment by an agent is a form of recognition that a particular vector of sensor values pertains to a particular rule in some degree. This recognition take the form of an assertion that a particular descriptor vector is associated with a particular decision rule. These considerations can be repeated to other forms of classifiers besides those defined by decision rules.