ON MODELING UNCERTAINTY WITH INTERVAL STRUCTURES
Computational IntelligencePublished 1 May 1995
S. K. M. Wong, Lei-Xi Wang, Yiyu Yao
Citations68
SJR quartileQ2
SJR score0.58
SNIP1.20
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The notion of interval structures is introduced in an attempt to establish a unified framework for representing uncertain information and an algorithm is developed for computing the tightest incidence bounds.
Abstract
In this paper, we introduce the notion of interval structures in an attempt to establish a unified framework for representing uncertain information. Two views are suggested for the interpretation of an interval structure. A typical example using the compatibility view is the rough set model in which the lower and upper approximations form an interval structure. Incidence calculus adopts the allocation view in which an interval structure is defined by the tightest lower and upper incidence bounds. The relationship between interval structures and interval‐based numeric belief and plausibility functions is also examined. As an application of the proposed model, an algorithm is developed for computing the tightest incidence bounds.
Keywords
Computer ScienceDecision Sciences
International Journal of Parallel ProgrammingRough sets
12,138 Citations1982Zdzis aw Pawlak
The presented approach may be considered as an alternative to fuzzy sets theory and tolerance theory and some applications are outlined.
The Annals of Mathematical StatisticsUpper and Lower Probabilities Induced by a Multivalued Mapping
5,972 Citations1967A. P. Dempster
Studies in fuzziness and soft computingUpper and Lower Probabilities Induced by a Multivalued Mapping
5,299 Citations2008Arthur P. Dempster
A distinctive feature of the present approach is a rule for conditioning, or more generally, arule for combining sources of information, as discussed in Sects.
European Journal of Operational ResearchFuzzy sets, uncertainty, and information
3,193 Citations1989
The fuzzy sets uncertainty and information is universally compatible with any devices to read and is available in the book collection an online access to it is set as public so you can get it instantly.
International Journal of General SystemsROUGH FUZZY SETS AND FUZZY ROUGH SETS*
2,948 Citations1990Didier Dubois, Henri Prade
It is argued that both notions of a rough set and a fuzzy set aim to different purposes, and it is more natural to try to combine the two models of uncertainty (vagueness and coarseness) rather than to have them compete on the same problems.
IGI Global eBooksEncyclopedia of Artificial Intelligence
1,400 Citations2009Rabuñal Dopico, Juan Ramón 1973-
TechnometricsProbabilistic Reasoning in Expert Systems, Theory and Algorithms
616 Citations1992Peter M. Jones, Richard E. Neapolitan
This text is a reprint of the seminal 1989 book Probabilistic Reasoning in Expert systems: Theory and Algorithms, which helped serve to create the field the authors now call Bayesian networks and provides an insightful comparison of the two most prominent approaches to probability.
International Journal of Man-Machine StudiesA decision theoretic framework for approximating concepts
612 Citations1992Yiyu Yao, S. K. M. Wong
This paper shows that if a given concept is approximated by one set, the same result given by the α-cut in the fuzzy set theory is obtained, and can derive both the algebraic and probabilistic rough set approximations.
International Journal of Man-Machine StudiesRough sets: probabilistic versus deterministic approach
469 Citations1988Zdzisław Pawlak, S. K. M. Wong +1 more
W: B. Gains and J. Boose, editors, Machine Learning and Uncertain Reasoning 3, pages 227-242, 1990.
HAL (Le Centre pour la Communication Scientifique Directe)Non-standard logics for automated reasoning
406 Citations1988Philippe Smets
International Journal of General SystemsA SET-THEORETIC VIEW OF BELIEF FUNCTIONS Logical operations and approximations by fuzzy sets†
401 Citations1986Didier Dubois, Henri Prade
The algebraic structure of bodies of evidence on a set is studied, based on extended set union, intersection and complementation, and it is pointed out that a body of evidence can account for conjunctive as well as a disjunctive information.
Workshops in computingRough Approximate Operators: Axiomatic Rough Set Theory
183 Citations1994Tzu-Yu Lin, Qing Liu
This paper considers the reverse problem, where H and L are two abstract operators acting on the power set of U, the universe of discourse, and finds that there is an equivalence relation defined on U such that H (X) and L(X) are precisely the upper and lower approximations.
Interval-set algebra for qualitative knowledge representation
122 Citations2002Yiyu Yao
The notion of interval sets is introduced as a new kind of sets represented by a pair of sets, namely, the lower and upper bounds, and operations on interval sets are defined, based on the corresponding set-theoretic operations on their members.
Journal of Automated ReasoningIncidence calculus: A mechanism for probabilistic reasoning
100 Citations1985Alan Bundy
It is argued that a purely numeric mechanism, like those proposed so far, cannot provide a probabilistic logic with truth functional connectives, and an alternative mechanism, Incidence Calculus, which is based on a representation of uncertainty using sets of points, which might represent situations models or possible worlds.
Studies in fuzziness and soft computingA Set-Theoretic View of Belief Functions
80 Citations2008Didier Dubois, Henri Prade
The algebraic structure of bodies of evidence on a set is studied, based on extended set union, intersection and complementation, and it is pointed out that a body of evidence can account for conjunctive as well as a disjunctive information.
Machine intelligence and pattern recognitionHandling Uncertain Information: A Review of Numeric and Non-numeric Methods
79 Citations1986Raj Bhatnagar, Laveen N. Kanal
Probability Theory, Shafer's Evidence Theory, Zadeh's Possibility Theory, Cohen's Theory of Endorsements and the non-monotonic logics are examined for handling uncertainty of information.
Uncertainty in Artificial IntelligenceINTERVAL STRUCTURE
70 Citations1992S. K. M. Wong, Lei-Xi Wang +1 more
A unified framework for representing uncertain information based on the notion of an interval structure is proposed and it is shown that the lower and upper approximations of the rough-set model, theLower and upper bounds of incidence calculus, and the belief and plausibility functions all obey the axioms of an intervals structure.
Workshops in computingOn Rough Sets in Topological Boolean Algebras
50 Citations1994Marek Chuchro
This work has focused on rough sets in topological Boolean algebras and characterization of the rough sets determined by regular open and regular closed elements.
Lecture notes in computer scienceMethodologies for Intelligent Systems
40 Citations1994Zbigniew W. Raś, Maria Zemankova
Journal of Automated ReasoningCorrectness criteria of some algorithms for uncertain reasoning using Incidence Calculus
25 Citations1986Alan Bundy
This paper proves soundness and completeness results for some algorithms introduced in [1] and hence satisfy some of the correctness criteria for Incidence Calculus, which can be used for probabilistic reasoning and to check the consistency of the subjective probabilities of sentences.
Workshops in computingA Pure Logic-algebraic Analysis of Rough Top and Rough Bottom Equalities
17 Citations1994Piero Pagliani
An analysis of rough sets, rough top equality and rough bottom equality by means of pure logic-algebraic operations, which reveals some very peculiar properties that are able to provide the logic framework within which to systematically deduce all the properties of rough (top, bottom) equalities.
International Journal of Man-Machine StudiesTwo perspectives of the Dempster-Shafer theory ofbelief functions
14 Citations1990Pawan Lingras, S. K. M. Wong
This study illustrates a possible method for incorporating dependencies based on limited information and a generalization of the Bayesian theory by allocating the probability mass to the propositions which may not necessarily be singleton sets of possible answers.
Non-Numeric Belief Structures
7 Citations1992S. K. M. Wong, Lusheng Wang +1 more
There exists a closed- foriu expression for the proposed conditional noli-numeric beliefs, which is useful in qualitative, qualitative, Mono-monoionic rensoning, and conditional logic.