IntroductIon Cluster analysis is a fundamental data reduction technique used in the physical and social sciences. It is of potential interest to managers in Information Science, as it can be used to identify user needs though segmenting users such as Web site visitors. In addition, the theory of Rough sets is the subject of intense interest in computational intelligence research. The extension ...

Abstract We introduce dynamic reducts in object oriented information system using rough set theory. To develop dynamic reducts in object oriented information system using rough set theory ,we propose object-oriented information system into rough set models. To accomplish this, we construct the class, object, and name structures using rough set theory. Next, combining class, name and object stru...

Preface Rough sets over generalized transitive relations like proto-transitive ones have been initiated by the present author in the year 2012 [1]. Subsequently [2], approximation of proto-transitive relations by other relations was investigated and the relation with rough approximations was developed towards constructing semantics that can handle fragments of structure. It was also proved that...

Rough sets, introduced by Pawlak as a model to capture impreciseness in data have been a very useful tool in several applications. These basic rough sets are defined by taking equivalence relations over a universe. In order to enhance the modeling powers of rough sets, several extensions to the basic definition has been introduced over the past few years. Extending the single granular structure...

As it is well known the rough set a beneficial method for data uncertainty analysis. However, this time- consuming task many big sets. So we utilized concept of local sets in analysis children addicted to social media handle efficiently and give some properties. With results, proved that gave more concrete clear information than

Rough set theory is a powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. This paper discusses five types of existing neighborhoodbased generalized rough sets. The concepts of minimal neighborhood description and maximal neighborhood description of an element are defined, and by means of the two concepts, the properties and structures...

Granularity of knowledge attracted attention of many researchers recently. This paper concerns this issue from the rough set perspective. Granularity is inherently connected with foundation of rough set theory. The concept of the rough set hinges on classification of objects of interest into similarity classes, which form elementary building blocks (atoms, granules) of knowledge. These granules...

The notion of three-way decisions was originally introduced by the needs to explain the three regions of probabilistic rough sets. Recent studies show that rough set theory is only one of possible ways to construct three regions. A more general theory of three-way decisions has been proposed, embracing ideas from rough sets, interval sets, shadowed sets, three-way approximations of fuzzy sets, ...

the aim of this paper is to introduce and study set- valued homomorphism on lattices and t-rough lattice with respect to a sublattice. this paper deals with t-rough set approach on the lattice theory. the result of this study contributes to, t-rough fuzzy set and approximation theory and proved in several papers. keywords: approximation space; lattice; prime ideal; rough ideal; t-rough set; set...

The intent of this paper is to face the essentials of granular computing and in its major component— the rough sets theory, introduced by Pawlak, since any rough set represents an information granule. As a part of modern soft computing paradigm, rough sets have been introduced as an interval-like extension of the usual sets with main applications in the intelligent systems. The proposed rough a...