Interval structure: a framework for representing uncertain information
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Rough concept analysis: a synthesis of rough sets and formal concept analysis
Fundamenta Informaticae - Special issue: rough sets
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
On Generalizing Pawlak Approximation Operators
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Approximation Spaces and Definability for Incomplete Information Systems
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Concept Approximation in Concept Lattice
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
RSFDGrC '99 Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing
Modal-style operators in qualitative data analysis
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Fuzzy Logic as a Basis for a Theory of Hierarchical Definability (THD)
ISMVL '03 Proceedings of the 33rd International Symposium on Multiple-Valued Logic
Rough Formal Concepts and Their Accuracies
SCC '04 Proceedings of the 2004 IEEE International Conference on Services Computing
Galois Connections and Data Analysis
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
On generalizing rough set theory
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Approximation in formal concept analysis
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
A partitional view of concept lattice
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Concept lattices vs. approximation spaces
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Attribute reduction in concept lattice based on discernibility matrix
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Subsystem based generalizations of rough set approximations
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Transactions on Rough Sets III
Generalisation of roughness bounds in rough set operations
International Journal of Approximate Reasoning
Rough set approximations in formal concept analysis and knowledge spaces
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Relational Contexts and Relational Concepts
Fundamenta Informaticae
Possibility theory and formal concept analysis: context decomposition and uncertainty handling
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
A possibility theory-oriented discussion of conceptual pattern structures
SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
Towards multi-adjoint property-oriented concept lattices
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
On lower and upper intension order relations by different cover concepts
Information Sciences: an International Journal
Approximation of sets based on partial covering
Theoretical Computer Science
Fuzzy Optimization and Decision Making
Multi-adjoint property-oriented and object-oriented concept lattices
Information Sciences: an International Journal
Closed-Label concept lattice based rule extraction approach
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Relating attribute reduction in formal, object-oriented and property-oriented concept lattices
Computers & Mathematics with Applications
Set-theoretic Approaches to Granular Computing
Fundamenta Informaticae - Rough Sets and Knowledge Technology (RSKT 2010)
Rough set model based on formal concept analysis
Information Sciences: an International Journal
Dual multi-adjoint concept lattices
Information Sciences: an International Journal
Approximation of sets based on partial covering
Transactions on Rough Sets XVI
| Hi-index | 0.00 |
A basic notion shared by rough set analysis and formal concept analysis is the definability of a set of objects based on a set of properties. The two theories can be compared, combined and applied to each other based on definability. In this paper, the notion of rough set approximations is introduced into formal concept analysis. Rough set approximations are defined by using a system of definable sets. The similar idea can be used in formal concept analysis. The families of the sets of objects and the sets of properties established in formal concept analysis are viewed as two systems of definable sets. The approximation operators are then formulated with respect to the systems. Two types of approximation operators, with respect to lattice-theoretic and set-theoretic interpretations, are studied. The results provide a better understanding of data analysis using rough set analysis and formal concept analysis.