Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Rough Set

Handbook of Research on Computational Intelligence for Engineering, Science, and Business
Set of elements which lie between lower and upper approximations of a crisp set according to rough set theory by Pawlak.
Published in Chapter:
Cancer Gene Expression Data Analysis Using Rough Based Symmetrical Clustering
Anasua Sarkar (Government College of Engineering and Leather Technology, India) and Ujjwal Maulik (Jadavpur University, India)
DOI: 10.4018/978-1-4666-2518-1.ch027
Abstract
Identification of cancer subtypes is the central goal in the cancer gene expression data analysis. Modified symmetry-based clustering is an unsupervised learning technique for detecting symmetrical convex or non-convex shaped clusters. To enable fast automatic clustering of cancer tissues (samples), in this chapter, the authors propose a rough set based hybrid approach for modified symmetry-based clustering algorithm. A natural basis for analyzing gene expression data using the symmetry-based algorithm is to group together genes with similar symmetrical patterns of microarray expressions. Rough-set theory helps in faster convergence and initial automatic optimal classification, thereby solving the problem of unknown knowledge of number of clusters in gene expression measurement data. For rough-set-theoretic decision rule generation, each cluster is classified using heuristically searched optimal reducts to overcome overlapping cluster problem. The rough modified symmetry-based clustering algorithm is compared with another newly implemented rough-improved symmetry-based clustering algorithm and existing K-Means algorithm over five benchmark cancer gene expression data sets, to demonstrate its superiority in terms of validity. The statistical analyses are also performed to establish the significance of this rough modified symmetry-based clustering approach.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
An Uncertainty-Based Model for Optimized Multi-Label Classification
A set in which the uncertainty is captured in the boundary region. It is approximated by a pair of crisp sets called the lower and upper approximation of the set.
Full Text Chapter Download: US $37.50 Add to Cart
Cluster Analysis Using Rough Clustering and k-Means Clustering
The concept of rough, or approximation, sets was introduced by Pawlak and is based on the single assumption that information is associated with every object in an information system. This information is expressed through attributes that describe the objects; objects that cannot be distinguished on the basis of a selected attribute are referred to as indiscernible. A rough set is defined by two sets, the lower approximation and the upper approximation.
Full Text Chapter Download: US $37.50 Add to Cart
A Comprehensive Review of Nature-Inspired Algorithms for Feature Selection
Full Text Chapter Download: US $37.50 Add to Cart
Fuzzy-Rough Data Mining
An approximation of a vague concept, through the use of two sets – the lower and upper approximations.
Full Text Chapter Download: US $37.50 Add to Cart
On Theory of Multisets and Applications
It is another efficient model to capture impreciseness proposed by Z.Pawlak in 1982, which follows the idea of G.Frege by defining the boundary region to capture uncertainty. It approximates every set by a pair of crisp sets, called the lower and upper approximations.
Full Text Chapter Download: US $37.50 Add to Cart
Rough Set-Based Neuro-Fuzzy System
A rough set is a formal approximation of a crisp set in terms of a pair of sets that give the lower and upper approximation of the original set
Full Text Chapter Download: US $37.50 Add to Cart
Cluster Analysis Using Rough Clustering and K-Means Clustering
The concept of rough, or approximation, sets was introduced by Pawlak, and is based on the single assumption that information is associated with every object in an information system. This information is expressed through attributes that describe the objects, and objects that cannot be distinguished on the basis of a selected attribute are referred to as indiscernible. A rough set is defined by two sets, the lower approximation and the upper approximation.
Full Text Chapter Download: US $37.50 Add to Cart
Swarm Intelligence in Solving Bio-Inspired Computing Problems: Reviews, Perspectives, and Challenges
A model, proposed by Pawlak to capture imprecision in data through boundary approach.
Full Text Chapter Download: US $37.50 Add to Cart
Application of Rough Set Based Models in Medical Diagnosis
It is an imprecise model introduced by Z. Pawlak in 1982, where sets are approximated by two crisp sets with respect to equivalence relations. A set is rough with respect to an equivalence relation or not depending upon whether the lower and upper approximations are not equal or otherwise. Several extensions of this basic model also exist.
Full Text Chapter Download: US $37.50 Add to Cart
Rough Approximations on Hesitant Fuzzy Sets
An approximation of a set in terms of a pair of sets called the lower approximation and the upper approximation. The set difference between the lower and the upper approximations gives the boundary region which characterises the uncertainty.
Full Text Chapter Download: US $37.50 Add to Cart
Soft Sets and Its Applications
Rough set theory was initiated by Pawlak (1982). Let U be a universe and R be an equivalence relation over U. This equivalence relation decomposes U into disjoint equivalence classes. We denote the equivalence class of an element x with respect to R by [ x ] R , which is defined as [ x ] R = { y | yRx }. Then for any , we associate two crisp sets and called the lower and upper approximations of X with respect to R respectively and are defined as, = { x ? U: X} and = { x ? U: [ x ] R n X }.
Full Text Chapter Download: US $37.50 Add to Cart
Application of Uncertainty Models in Bioinformatics
This is another model of uncertainty which was introduced by Pawlak in 1982 and it follows the concept of Frege on the boundary region model of uncertainty. Here, a set is approximated by a pair of crisp sets called the lower and upper approximation of the set.
Full Text Chapter Download: US $37.50 Add to Cart
Rough Set Based Green Cloud Computing in Emerging Markets
An uncertainty based model introduced by Z.Pawlak in the year 1982 which captures uncertainty through boundary region concept, the model introduced by G. Frege, the father of modern logic.
Full Text Chapter Download: US $37.50 Add to Cart
Cancer Biomarker Assessment Using Evolutionary Rough Multi-Objective Optimization Algorithm
Set of elements which lie between lower and upper approximations of a crisp set according to rough set theory by Pawlak.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR