Approximation Operators in Qualitative Data Analysis

@inproceedings{Dntsch2003ApproximationOI,
  title={Approximation Operators in Qualitative Data Analysis},
  author={I. D{\"u}ntsch and G. Gediga},
  booktitle={Theory and Applications of Relational Structures as Knowledge Instruments},
  year={2003}
}
A large part of qualitative data analysis is concerned with approximations of sets on the basis of relational information. In this paper, we present various forms of set approximations via the unifying concept of modal–style operators. Two examples indicate the usefulness of the approach. 

Figures, Tables, and Topics from this paper

Rough approximations in formal contexts
TLDR
Relationships between the rough set theory and the formal concept analysis are discussed and several types of rough approximation operators on the object set are introduced. Expand
Rough Approximation Operators with Hedges
The theory of formal concept analysis and the theory of rough sets are related. In the paper, from the point of view of graded truth approach, two L-rough operators with hedges are defined, some ofExpand
A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis
  • Yiyu Yao
  • Computer Science
  • Rough Sets and Current Trends in Computing
  • 2004
TLDR
The theory of rough sets and formal concept analysis are compared in a common framework based on formal contexts to produce different types of rules summarizing knowledge embedded in data. Expand
Simplifying Contextual Structures
TLDR
The ICRA approach offers an effective way to reduce the complexity of a concept lattice and/or a knowledge space by changing only little information in comparison to a competing model which uses fuzzy K-Means clustering. Expand
Rough set approximations in formal concept analysis
  • Yiyu Yao, Yaohua Chen
  • Mathematics, Computer Science
  • IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04.
  • 2004
TLDR
The notion of rough set approximations is introduced into formal concept analysis and approximation operators are defined based on both lattice- theoretic and set-theoretic operators to provide a better understanding of data analysis. Expand
Multiview intelligent data analysis based on granular computing
  • Yaohua Chen, Yiyu Yao
  • Computer Science
  • 2006 IEEE International Conference on Granular Computing
  • 2006
TLDR
The mental issues of granulations and granular structures for data analysis are discussed based on modal-style data operators and the results provide a basis for establishing a framework of multiview intelligent data analysis. Expand
Concept Lattices in L-Rough Sets
  • X. Chen
  • Mathematics, Computer Science
  • ISNN
  • 2009
In this paper, two L-rough approximation operators are defined by an arbitrary L-relation, some of their properties and their relation to Galois connection in Formal Concept Analysis areExpand
Fuzzy Modal – Like Approximation Operations Based on Residuated Lattices
In many applications we have a set of objects together with their properties. Since the available information is often incomplete and/or imprecise, the true knowledge about subsets of objects can beExpand
Relationships Between Concept Lattice and Rough Set
TLDR
By introducing the term of anti-chain formal context, the relation between the reduction of formal context in concept lattice and attribute reduction in rough set theory is studied more deeply. Expand
A Fuzzy Approach to Some Set Approximation Operations
TLDR
A fuzzy generalisation of two relation-based operations suitable for set approximations based on relationships between objects and their properties, which are based on similarities between objects. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 53 REFERENCES
Modal-style operators in qualitative data analysis
  • I. Düntsch, G. Gediga
  • Mathematics, Computer Science
  • 2002 IEEE International Conference on Data Mining, 2002. Proceedings.
  • 2002
We explore the usage of the modal possibility operator (and its dual necessity operator) in qualitative data analysis, and show that it-quite literally-complements the derivation operator of formalExpand
Relational Interpretations of Neigborhood Operators and Rough Set Approximation Operators
  • Yiyu Yao
  • Mathematics, Computer Science
  • Inf. Sci.
  • 1998
This paper presents a framework for the formulation, interpretation, and comparison of neighborhood systems and rough set approximations using the more familiar notion of binary relations. A specialExpand
On the Structure of Rough Approximations
TLDR
In a lattice-theoretical setting two maps are defined which mimic the rough approximation operators and note that this setting is suitable also for other operators based on binary relations. Expand
A Generalized Definition of Rough Approximations Based on Similarity
TLDR
New definitions of lower and upper approximations are proposed, which are basic concepts of the rough set theory and are shown to be more general, in the sense that they are the only ones which can be used for any type of indiscernibility or similarity relation. Expand
On Generalizing Pawlak Approximation Operators
  • Yiyu Yao
  • Mathematics, Computer Science
  • Rough Sets and Current Trends in Computing
  • 1998
This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and posets. The structuresExpand
Granular Computing on Binary Relations
  • T. Lin
  • Engineering, Computer Science
  • Rough Sets and Current Trends in Computing
  • 2002
TLDR
The granular computing on binary relations is presented and the result is applied to the analysis of conflict of interests relation (CIR) and the Chinese wall security policy (CWSP). Expand
ON MODELING UNCERTAINTY WITH INTERVAL STRUCTURES
TLDR
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. Expand
Analysis of Proximities as a Technique for the Study of Information Processing in Man1
  • R. Shepard
  • Computer Science, Medicine
  • Human factors
  • 1963
A recently developed method is described for the reductive analysis of confusion matrices by means of a high-speed digital computer. Illustrative applications of this method to several previouslyExpand
Constructive and Algebraic Methods of the Theory of Rough Sets
  • Yiyu Yao
  • Mathematics, Computer Science
  • Inf. Sci.
  • 1998
TLDR
This paper reviews and compares constructive and algebraic approaches in the study of rough set algebras and states axioms that must be satisfied by the operators. Expand
Semantics of Vague Concepts
TLDR
The present paper is an attempt to show that problems concerning semantics of vague concepts may find their proper foundation in the theory of rough sets originated by Pawlak (1982), and gives a formal framework to what is considered to be different ways of making vague concepts precise. Expand
...
1
2
3
4
5
...