Results 1  10
of
58
Information granulation and rough set approximation
 International Journal of Intelligent Systems
, 2001
"... Information granulation and concept approximation are some of the fundamental issues of granular computing. Granulation of a universe involves grouping of similar elements into granules to form coarsegrained views of the universe. Approximation of concepts, represented by subsets of the universe, d ..."
Abstract

Cited by 47 (19 self)
 Add to MetaCart
(Show Context)
Information granulation and concept approximation are some of the fundamental issues of granular computing. Granulation of a universe involves grouping of similar elements into granules to form coarsegrained views of the universe. Approximation of concepts, represented by subsets of the universe, deals with the descriptions of concepts using granules. In the context of rough set theory, this paper examines the two related issues. The granulation structures used by standard rough set theory and the corresponding approximation structures are reviewed. Hierarchical granulation and approximation structures are studied, which results in stratified rough set approximations. A nested sequence of granulations induced by a set of nested equivalence relations leads to a nested sequence of rough set approximations. A multilevel granulation, characterized by a special class of equivalence relations, leads to a more general approximation structure. The notion of neighborhood systems is also explored. 1
A decision theoretic framework for approximating concepts
 International Journal of Manmachine Studies
, 1992
"... This paper explores the implications of approximating a concept based on the Bayesian decision procedure, which provides a plausible unification of the fuzzy set and rough set approaches for approximating a concept. We show that if a given concept is approximated by one set, the same result given by ..."
Abstract

Cited by 44 (22 self)
 Add to MetaCart
This paper explores the implications of approximating a concept based on the Bayesian decision procedure, which provides a plausible unification of the fuzzy set and rough set approaches for approximating a concept. We show that if a given concept is approximated by one set, the same result given by the αcut in the fuzzy set theory is obtained. On the other hand, if a given concept is approximated by two sets, we can derive both the algebraic and probabilistic rough set approximations. Moreover, based on the well known principle of maximum (minimum) entropy, we give a useful interpretation of fuzzy intersection and union. Our results enhance the understanding and broaden the applications of both fuzzy and rough sets. 1.
Discovery of Data Patterns with Applications to Decomposition and Classification Problems
, 1998
"... ..."
Attribute Reduction in DecisionTheoretic Rough Set Models
 INFORMATION SCIENCES, 178(17), 33563373, ELSEVIER B.V.
, 2008
"... Rough set theory can be applied to rule induction. There are two different types of classification rules, positive and boundary rules, leading to different decisions and consequences. They can be distinguished not only from the syntax measures such as confidence, coverage and generality, but also th ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
Rough set theory can be applied to rule induction. There are two different types of classification rules, positive and boundary rules, leading to different decisions and consequences. They can be distinguished not only from the syntax measures such as confidence, coverage and generality, but also the semantic measures such as decisionmonotocity, cost and risk. The classification rules can be evaluated locally for each individual rule, or globally for a set of rules. Both the two types of classification rules can be generated from, and interpreted by, a decisiontheoretic model, which is a probabilistic extension of the Pawlak rough set model. As an important concept of rough set theory, an attribute reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of the given information table. This paper addresses attribute reduction in decisiontheoretic rough set models regarding different classification properties, such as: decisionmonotocity, confidence, coverage, generality and cost. It is important to note that many of these properties can be truthfully reflected by a single measure γ in the Pawlak rough set model. On the other hand, they need to be considered separately in probabilistic models. A straightforward extension of the γ measure is unable to evaluate these properties. This study provides a new insight into the problem of attribute reduction.
Probabilistic approaches to rough sets
 Expert Systems
, 2003
"... This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize partitions of a universe. Both algebraic and probabilistic rough set approximations are studied. The probabilistic approxim ..."
Abstract

Cited by 22 (10 self)
 Add to MetaCart
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize partitions of a universe. Both algebraic and probabilistic rough set approximations are studied. The probabilistic approximations are defined in a decisiontheoretic framework. The problem of rule induction, a major application of rough set theory, is studied in probabilistic and informationtheoretic terms. Two types of rules are analyzed, the local, low order rules, and the global, high order rules. 1
Potential Applications of Granular Computing in Knowledge Discovery and Data Mining
, 1999
"... In this paper, we argue that granular computing may have many potential applications in knowledge discovery and data mining. Three related basic operations of granular computing are examined: granulation of the universe, characterization of granules, and relationships between granules. Their connect ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
In this paper, we argue that granular computing may have many potential applications in knowledge discovery and data mining. Three related basic operations of granular computing are examined: granulation of the universe, characterization of granules, and relationships between granules. Their connections to the tasks of knowledge discovery and data mining are analyzed.
Threeway decisions with probabilistic rough sets
 Information Sciences
, 2010
"... The rough set theory approximates a concept by three regions, namely, the positive, boundary and negative regions. Rules constructed from the three regions are associated with different actions and decisions, which immediately leads to the notion of threeway decision rules. A positive rule makes a ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
(Show Context)
The rough set theory approximates a concept by three regions, namely, the positive, boundary and negative regions. Rules constructed from the three regions are associated with different actions and decisions, which immediately leads to the notion of threeway decision rules. A positive rule makes a decision of acceptance, a negative rule makes a decision of rejection, and a boundary rule makes a decision of abstaining. This paper provides an analysis of threeway decision rules in the classical rough set model and the decisiontheoretic rough set model. The results enrich the rough set theory by ideas from Bayesian decision theory and hypothesis testing in statistics. The connections established between the levels of tolerance for errors and costs of incorrect decisions make the rough set theory practical in applications. Key words: Decisiontheoretic rough sets; probabilistic rough sets; threeway decisions; hypothesis testing; Bayesian decision procedure; classification 1
Improving new user recommendations with rulebased induction on cold user data
 In Proceedings of the 2007 ACM Conference on Recommender Systems
, 2007
"... With recommender systems, users receive items recommended on the basis of their profile. New users experience the cold start problem: as their profile is very poor, the system performs very poorly. In this paper, classical new user cold start techniques are improved by exploiting the cold user data, ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
(Show Context)
With recommender systems, users receive items recommended on the basis of their profile. New users experience the cold start problem: as their profile is very poor, the system performs very poorly. In this paper, classical new user cold start techniques are improved by exploiting the cold user data, i.e. the user data that is readily available (e.g. age, occupation, location, etc.), in order to automatically associate the new user with a better first profile. Relying on the existing αcommunity spaces model, a rulebased induction process is used and a recommendation process based on the “level of agreement ” principle is defined. The experiments show that the quality of recommendations compares to that obtained after a classical new user technique, while the new user effort is smaller as no initial ratings are asked.
Webbased Support Systems with Rough Set Analysis
"... Abstract. Rough sets have been applied to many areas where multiattribute data is needed to be analyzed to acquire knowledge for decision making. Webbased Support Systems (WSS) are a new research area that aims to support human activities and extend human physical limitations of information process ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Rough sets have been applied to many areas where multiattribute data is needed to be analyzed to acquire knowledge for decision making. Webbased Support Systems (WSS) are a new research area that aims to support human activities and extend human physical limitations of information processing with Web technologies. The applications of rough set analysis for WSS is looked at in this article. In particular, our focus will be on WebBased Medical Support Systems (WMSS). A WMSS is a support system that integrates medicine practices (diagnosis and surveillance) with computer science and Web technologies. We will explore some of the challenges of using rough sets in a WMSS and detail some of the applications of rough sets in analyzing medical data. 1