Theory and applications of granular labelled partitions in multi-scale decision tables
Information SciencesPublished 12 May 2011
Wei-Zhi Wu, Yee Leung
Citations286
SJR quartileQ1
SJR score1.80
SNIP1.98
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
A formal approach to granular computing with multi-scale data measured at different levels of granulations is proposed in this paper and the unravelling of decision rules at different scales in multi- scale decision tables is discussed.
Abstract
Granular computing and acquisition of if-then rules are two basic issues in knowledge representation and data mining. A formal approach to granular computing with multi-scale data measured at different levels of granulations is proposed in this paper. The concept of labelled blocks determined by a surjective function is first introduced. Lower and upper label-block approximations of sets are then defined. Multi-scale granular labelled partitions and multi-scale decision granular labelled partitions as well as their derived rough set approximations are further formulated to analyze hierarchically structured data. Finally, the concept of multi-scale information tables in the context of rough set is proposed and the unravelling of decision rules at different scales in multi-scale decision tables is discussed.
Keywords
Computer Science
Rough Sets: Theoretical Aspects of Reasoning about Data
8,416 Citations1991Zdzisław Pawlak
Fuzzy Sets and SystemsToward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic
2,875 Citations1997Lotfi A. Zadeh
M Modes of information granulation (IG) in which the granules are crisp (c-granular) play important roles in a wide variety of methods, approaches and techniques, but this does not reflect the fact that in almost all of human reasoning and concept formation thegranules are fuzzy (f- Granular).
The Discernibility Matrices and Functions in Information Systems
1,646 Citations1992Andrzej Skowron, Cecylia Rauszer
Two notions related to any information system, namely the discernibility matrix and discernibility function, are introduced and several algorithms for solving problems related among other things to the rough definability, reducts, core and dependencies generation are obtained.
Information SciencesThree-way decisions with probabilistic rough sets
1,555 Citations2009Yiyu Yao
This paper provides an analysis of three-way decision rules in the classical rough set model and the decision-theoretic rough set models, enriched by ideas from Bayesian decision theory and hypothesis testing in statistics.
Fuzzy Sets and SystemsIntelligent decision support. Handbook of applications and advances of the rough sets theory
805 Citations1993
Information SciencesMGRS: A multi-granulation rough set
719 Citations2009Yuhua Qian, Jiye Liang +2 more
It is shown that some of the properties of Pawlak's rough set theory are special instances of those of MGRS, and several important measures are presented, which are re-interpreted in terms of a classic measure based on sets, the Marczewski-Steinhaus metric and the inclusion degree measure.
Studies in fuzziness and soft computingGranular Computing : An Introduction
706 Citations2000Witold Pedrycz
Handbook of Granular Computing
670 Citations2008Witold Pedrycz, Andrzej Skowron +1 more
The Handbook of Granular Computing offers a comprehensive reference source for the granular computing community, edited by and with contributions from leading experts in the field, and represents a significant and valuable contribution to the literature.
International Journal of Intelligent SystemsInformation granulation and rough set approximation
527 Citations2000Yiyu Yao
The granulation structures used by standard rough set theory and the corresponding approximation structures are reviewed and the notion of neighborhood systems is also explored.
International Journal of Intelligent SystemsRough approximation by dominance relations
462 Citations2002Salvatore Greco, Benedetto Matarazzo +1 more
This article characterize the DRSA as well as decision rules induced from these approximations, and its advantages over the CRSA are presented in a real study of evaluation of the risk of business failure.
Granular computing: an introduction
381 Citations2002Witold Pedrycz
The intent of the paper is to elaborate on the fundamentals of granular computing and put the entire area in a certain perspective while not moving into specific algorithmic details.
Information SciencesApproaches to knowledge reduction based on variable precision rough set model
377 Citations2003Jinhua Mi
It is proved that for some special thresholds, β lower distribution reduct is equivalent to the maximum distribution reduction reduct, whereas β upper distribution reduCT is equivalents to the possible reduct.
IEEE Transactions on Knowledge and Data EngineeringGranular Computing and Knowledge Reduction in Formal Contexts
370 Citations2008Wei-Zhi Wu, Yee Leung +1 more
Granular structure of concept lattices with application in knowledge reduction in formal concept analysis is examined in this paper and knowledge hidden in such a context is unraveled in the form of compact implication rules.
Foundations of Geographic Information Science
365 Citations2003Matt Duckham, Michael F. Goodchild +1 more
This book discusses Geographic Information Science, which investigates the nature and value of Geographic Information in Context, and the role of representation in Maps and Geographic Activity Models.
IEEE Transactions on Systems Man and Cybernetics - Part A Systems and HumansIncomplete Multigranulation Rough Set
338 Citations2009Yuhua Qian, Jiye Liang +1 more
Several elementary measures are proposed for this rough-set framework, and a concept of approximation reduct is introduced to characterize the smallest attribute subset that preserves the lower approximation and upper approximation of all decision classes in this rough set model.
Lecture notes in computer scienceA Partition Model of Granular Computing
317 Citations2004Yiyu Yao
This chapter examines the basic principles and issues of granular computing from semantic and algorithmic perspectives, as well as principles and operations of computing and reasoning with granules in a set-theoretic setting.
Lecture notes in computer scienceA Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis
316 Citations2004Yiyu Yao
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.
Information SciencesMaximal consistent block technique for rule acquisition in incomplete information systems
301 Citations2003Yee Leung
The concept of a maximal consistent block is applied to formulate a new approximation to an object set in incomplete information systems with higher level of accuracy and can provide a more efficient computation for knowledge acquisition, especially in large incomplete systems.
European Journal of Operational ResearchKnowledge acquisition in incomplete information systems: A rough set approach
299 Citations2004Yee Leung, Wei-Zhi Wu +1 more
Two new quantitative measures, “random certainty factor” and "random coverage factor" are associated with each decision rule are further proposed to explain relationships between the condition and decision parts of a rule in incomplete decision tables.
IEEE Transactions on Pattern Analysis and Machine IntelligenceClustering by scale-space filtering
290 Citations2000Yee Leung, Jiangshe Zhang +1 more
A new approach to data clustering is proposed by modeling the blurring effect of lateral retinal interconnections based on scale space theory that provides a unified framework for scale-related clustering algorithms derived from many different fields such as estimation theory, recurrent signal processing on self-organization feature maps, information theory and statistical mechanics, and radial basis function neural networks.
Knowledge-Based SystemsMixed feature selection based on granulation and approximation
267 Citations2007Qinghua Hu, Jinfu Liu +1 more
A greedy attribute reduction algorithm is constructed based on Pawlak's rough set model, where the objects with numerical attributes are granulated with @d neighborhood relations or k-nearest-neighbor relations, while objects with categorical features are granulation with equivalence relations.
IEEE Transactions on Fuzzy SystemsToward a Theory of Granular Computing for Human-Centered Information Processing
262 Citations2008A Bargiela, Witold Pedrycz
This study expands on earlier research exploring the foundations of GrC and casting it as a structured combination of algorithmic and non- algorithmic information processing that mimics human, intelligent synthesis of knowledge from information.
International Journal of Intelligent SystemsInformation granules: Towards foundations of granular computing
230 Citations2000Andrzej Skowron, Jarosław Stepaniuk
This work discusses a problem of synthesis of robust terms, i.e., descriptions of information granules, satisfying a given specification, an important problem for granular computing and its applications for spatial reasoning or knowledge discovery and data mining.
Granular Computing: An Emerging Paradigm
216 Citations2001Witold Pedrycz
This book discusses Granular Computing in Neural Networks, Fuzzy Clustering for Multiple-Model Approaches in System Identification and Control, and Induction of Rules about Complications with the Use of Rough Sets.
International Journal of Approximate ReasoningKnowledge structure, knowledge granulation and knowledge distance in a knowledge base
212 Citations2008Yuhua Qian, Jiye Liang +1 more
An axiom definition of knowledge granulation in knowledge bases is presented, under which some existing knowledge granulations become its special forms, and the concept of a knowledge distance for calculating the difference between two knowledge structures in the same knowledge base is introduced.
International Journal of Intelligent SystemsApproaches to knowledge reductions in inconsistent systems
190 Citations2003Wen‐Xiu Zhang, Ju‐Sheng Mi +1 more
A new kind of knowledge reduction is introduced called a maximum distribution reduct, which preserves all maximum decision classes and overcomes the drawback of the possible reduct that the derived decision rules may be incompatible with the ones derived from the original system.
Information SciencesAttribute reduction based on evidence theory in incomplete decision systems
189 Citations2007Wei-Zhi Wu
This paper deals with attribute reduction in incomplete information systems and incomplete decision systems based on Dempster-Shafer theory of evidence and shows that in an incomplete information system an attribute set is a belief reduct if and only if it is a classical reduct and a plausibility consistent set must be a classical consistent set.
A Theory of Granular Partitions
143 Citations2003Thomas Bittner, Barry Smith
The theory of granular partitions as it is developed in this paper is intended to serve as an alternative to set theory both as a tool of formal ontology and as a framework for the representation of human cognition.
International Journal of Intelligent SystemsDominance relation and rules in an incomplete ordered information system
136 Citations2004Mingwen Shao, Wen‐Xiu Zhang
This article proposes a reduction of knowledge that eliminates only that information that is not essential from the point of view of the ordering of objects or decision rules from an incomplete ordered decision table.
Journal of the American Society for Information ScienceData mining using extensions of the rough set model
132 Citations1998Pawan Lingras, Yiyu Yao
It is demonstrated that a generalized rough set model can be used for generating rules from incomplete databases and these rules are based on plausibility functions proposed by Shafer.
Information SciencesData analysis based on discernibility and indiscernibility
128 Citations2007Yan Zhao, Yiyu Yao +1 more
The consideration of the matrix- counterpart of relations, and the relation-counterpart of matrices, brings more insights into rough set theory.
International Journal of General SystemsRough Set Models on Two universes
114 Citations2004Daowu Pei, Zongben Xu
A revised rough set model is proposed which provides a new selection of interval structures for uncertain reasoning using rough set theory and methods and reveals some new properties.
Studies in fuzziness and soft computingRough Set Theory and Granular Computing
108 Citations2003Masahiro Inuiguchi, Shoji Hirano +1 more
Expert Systems with ApplicationsLearning rules from incomplete training examples by rough sets
102 Citations2002Tzung‐Pei Hong, Li-Huei Tseng +1 more
This paper deals with the problem of producing a set of certain and possible rules from incomplete data sets based on rough sets and proposes a new learning algorithm, which can simultaneously derive rules from complete data sets and estimate the missing values in the learning process.
Information SciencesGranular computing and dual Galois connection
92 Citations2007Jian-Min Ma, Wen‐Xiu Zhang +2 more
A covering model for granular computing in a set-theoretic setting is studied and it is proved that the duality is always true for the two pairs of lower and upper approximation operators.
Journal of the American Society for Information ScienceData mining using extensions of the rough set model
79 Citations1998Pawan Lingras, Yiyu Yao
Journal of the American Society for Information Science and TechnologyRough set approach for attribute reduction and rule generation: A case of patients with suspected breast cancer
68 Citations2004Aboul Ella Hassanien
The study showed that the theory of rough sets is a useful tool for inductive learning and a valuable aid for building expert systems.
Computational IntelligenceON MODELING UNCERTAINTY WITH INTERVAL STRUCTURES
68 Citations1995S. K. M. Wong, Lei-Xi Wang +1 more
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.
International Journal of Uncertainty Fuzziness and Knowledge-Based SystemsON KNOWLEDGE REDUCTION IN INCONSISTENT DECISION INFORMATION SYSTEMS
65 Citations2004Deyu Li, Bo Zhang +1 more
In this paper, the relationships among the existing types of knowledge reduction are reconsidered and rectified, and some related results are theoretically improved.
Stratified rough sets and granular computing
53 Citations2003Yiyu Yao
This paper examines granulation structures for stratified rough set approximations and finds that a hierarchical granulation, characterized by a special class of equivalence relations, leads to a more general approximation structure.
Lecture notes in computer scienceGranular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions
52 Citations2003Yiyu Yao, Churn‐Jung Liau +1 more
A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions to study connections between the elements of a universe and the elements in a granulated universe.
Soft ComputingVariable precision rough set model over two universes and its properties
51 Citations2010Yonghong Shen, Faxing Wang
This paper firstly proposes the variable precision rough set model (VPRS-model) over two universes using the inclsion degree, and the concepts of the reverse lower and upper approximation operators are presented.
International Journal of Intelligent SystemsIntelligent social network analysis using granular computing
50 Citations2008Ronald R. Yager
The objective here is to take a step toward the development of intelligent social network analysis using granular computing by expressing in a human‐focused manner concepts associated with social networks then formalize these concepts using fuzzy sets and then evaluate these concepts with respect to social networks that have been represented using set‐based relational network theory.
Lecture notes in computer scienceStratified Rough Sets and Vagueness
46 Citations2003Thomas Bittner, John G. Stell
This paper shows how the mechanisms for making rough descriptions with respect to an equivalence relation can be extended to give rough descriptionswith respect to a granular partition, and shows how this relates to partitions of partial sets, i.e., partitions of sets in which not all members are known.
IEEE Transactions on Fuzzy SystemsConstructive granular systems with universal approximation and fast knowledge discovery
44 Citations2005Yanqing Zhang
Predictive granular knowledge discovery simulation results indicate that the direct-calculation-based granular constructive algorithm is better than the conventional gradient descent learning algorithm in terms of learning speed, learning error, and prediction error.
Lecture notes in computer scienceClassification Strategies Using Certain and Possible Rules
32 Citations1998Jerzy W. Grzymala‐Busse, Xihong Zou
Different strategies were compared by classifying ten real-life data sets, using the error rate as a criterion of quality, and how to combine certain and possible rules with complete and partial matching of rules by a case was presented.
Recent developments in granular computing: A bibliometrics study
26 Citations2008JingTao Yao
This is a follow-up of the paper ldquoA ten-year review of granular computingrdquo published in 2007, and continues to examine the most influential papers in granular Computing.
BMC BioinformaticsSpatio-structural granularity of biological material entities
24 Citations2010Lars Vogt
A granularity framework is presented that is applicable to cumulative-constitutively organized material entities and provides a scheme for granulating complex material entities into their constitutive and regional parts by integrating various compositional and spatial granularity perspectives.