Abstract: In recent years multi-agent systems have emerged as one of the interesting architectures facilitating distributed collaboration and distributed problem solving. Each node (agent) of the network might pursue its own agenda, exploit its environment, develop its own problem solving strategy and establish required communication strategies. Within each node of the network, one could encounter a diversity of problem-solving approaches. Quite commonly the agents can realize their processing at the level of information granules that is the most suitable from their local points of view. Information granules can come at various levels of granularity. Each agent could exploit a certain formalism of information granulation engaging a machinery of fuzzy sets, interval analysis, rough sets, just to name a few dominant technologies of granular computing. Having this in mind, arises a fundamental issue of forming effective interaction linkages between the agents so that they fully broadcast their findings and benefit from interacting with others.
Abstract: One main drawback of intrusion detection system is the
inability of detecting new attacks which do not have known
signatures. In this paper we discuss an intrusion detection method
that proposes independent component analysis (ICA) based feature
selection heuristics and using rough fuzzy for clustering data. ICA is
to separate these independent components (ICs) from the monitored
variables. Rough set has to decrease the amount of data and get rid of
redundancy and Fuzzy methods allow objects to belong to several
clusters simultaneously, with different degrees of membership. Our
approach allows us to recognize not only known attacks but also to
detect activity that may be the result of a new, unknown attack. The
experimental results on Knowledge Discovery and Data Mining-
(KDDCup 1999) dataset.
Abstract: A learning content management system (LCMS) is an
environment to support web-based learning content development.
Primary function of the system is to manage the learning process as
well as to generate content customized to meet a unique requirement
of each learner. Among the available supporting tools offered by
several vendors, we propose to enhance the LCMS functionality to
individualize the presented content with the induction ability. Our
induction technique is based on rough set theory. The induced rules
are intended to be the supportive knowledge for guiding the content
flow planning. They can also be used as decision rules to help
content developers on managing content delivered to individual
learner.
Abstract: The internet is constantly expanding. Identifying web
links of interest from web browsers requires users to visit each of the
links listed, individually until a satisfactory link is found, therefore
those users need to evaluate a considerable amount of links before
finding their link of interest; this can be tedious and even
unproductive. By incorporating web assistance, web users could be
benefited from reduced time searching on relevant websites. In this
paper, a rough set approach is presented, which facilitates
classification of unlimited available e-vocabulary, to assist web users
in reducing search times looking for relevant web sites. This
approach includes two methods for identifying relevance data on web
links based on the priority and percentage of relevance. As a result of
these methods, a list of web sites is generated in priority sequence
with an emphasis of the search criteria.
Abstract: Effective employee selection is a critical component
of a successful organization. Many important criteria for personnel
selection such as decision-making ability, adaptability, ambition, and
self-organization are naturally vague and imprecise to evaluate. The
rough sets theory (RST) as a new mathematical approach to
vagueness and uncertainty is a very well suited tool to deal with
qualitative data and various decision problems. This paper provides
conceptual, descriptive, and simulation results, concentrating chiefly
on human resources and personnel selection factors. The current
research derives certain decision rules which are able to facilitate
personnel selection and identifies several significant features based
on an empirical study conducted in an IT company in Iran.
Abstract: Granular computing deals with representation of information in the form of some aggregates and related methods for transformation and analysis for problem solving. A granulation scheme based on clustering and Rough Set Theory is presented with focus on structured conceptualization of information has been presented in this paper. Experiments for the proposed method on four labeled data exhibit good result with reference to classification problem. The proposed granulation technique is semi-supervised imbibing global as well as local information granulation. To represent the results of the attribute oriented granulation a tree structure is proposed in this paper.
Abstract: To investigate some relations between higher mathe¬matics scores in Chinese graduate student entrance examination and calculus (resp. linear algebra, probability statistics) scores in subject's completion examination of Chinese university, we select 20 students as a sample, take higher mathematics score as a decision attribute and take calculus score, linear algebra score, probability statistics score as condition attributes. In this paper, we are based on rough-set theory (Rough-set theory is a logic-mathematical method proposed by Z. Pawlak. In recent years, this theory has been widely implemented in the many fields of natural science and societal science.) to investigate importance of condition attributes with respective to decision attribute and strength of condition attributes supporting decision attribute. Results of this investigation will be helpful for university students to raise higher mathematics scores in Chinese graduate student entrance examination.
Abstract: Adopting Zakowski-s upper approximation operator
C and lower approximation operator C, this paper investigates
granularity-wise separations in covering approximation spaces. Some
characterizations of granularity-wise separations are obtained by
means of Pawlak rough sets and some relations among granularitywise
separations are established, which makes it possible to research
covering approximation spaces by logical methods and mathematical
methods in computer science. Results of this paper give further
applications of Pawlak rough set theory in pattern recognition and
artificial intelligence.
Abstract: Rough set theory is a very effective tool to deal with granularity and vagueness in information systems. Covering-based rough set theory is an extension of classical rough set theory. In this paper, firstly we present the characteristics of the reducible element and the minimal description covering-based rough sets through downsets. Then we establish lattices and topological spaces in coveringbased rough sets through down-sets and up-sets. In this way, one can investigate covering-based rough sets from algebraic and topological points of view.
Abstract: With increasing data in medical databases, medical
data retrieval is growing in popularity. Some of this analysis
including inducing propositional rules from databases using many
soft techniques, and then using these rules in an expert system.
Diagnostic rules and information on features are extracted from
clinical databases on diseases of congenital anomaly. This paper
explain the latest soft computing techniques and some of the
adaptive techniques encompasses an extensive group of methods
that have been applied in the medical domain and that are used for
the discovery of data dependencies, importance of features,
patterns in sample data, and feature space dimensionality
reduction. These approaches pave the way for new and interesting
avenues of research in medical imaging and represent an important
challenge for researchers.
Abstract: Content-Based Image Retrieval (CBIR) has been
one on the most vivid research areas in the field of computer vision
over the last 10 years. Many programs and tools have been
developed to formulate and execute queries based on the visual or
audio content and to help browsing large multimedia repositories.
Still, no general breakthrough has been achieved with respect to
large varied databases with documents of difering sorts and with
varying characteristics. Answers to many questions with respect to
speed, semantic descriptors or objective image interpretations are
still unanswered. In the medical field, images, and especially
digital images, are produced in ever increasing quantities and used
for diagnostics and therapy. In several articles, content based
access to medical images for supporting clinical decision making
has been proposed that would ease the management of clinical data
and scenarios for the integration of content-based access methods
into Picture Archiving and Communication Systems (PACS) have
been created. This paper gives an overview of soft computing
techniques. New research directions are being defined that can
prove to be useful. Still, there are very few systems that seem to be
used in clinical practice. It needs to be stated as well that the goal
is not, in general, to replace text based retrieval methods as they
exist at the moment.
Abstract: This paper proposes rough set models with three
different level knowledge granules in incomplete information system
under tolerance relation by similarity between objects according to
their attribute values. Through introducing dominance relation on the
discourse to decompose similarity classes into three subclasses: little
better subclass, little worse subclass and vague subclass, it dismantles
lower and upper approximations into three components. By using
these components, retrieving information to find naturally hierarchical
expansions to queries and constructing answers to elaborative queries
can be effective. It illustrates the approach in applying rough set
models in the design of information retrieval system to access different
granular expanded documents. The proposed method enhances rough
set model application in the flexibility of expansions and elaborative
queries in information retrieval.
Abstract: A Decision Support System/Expert System for stock
portfolio selection presented where at first step, both technical and
fundamental data used to estimate technical and fundamental return
and risk (1st phase); Then, the estimated values are aggregated with
the investor preferences (2nd phase) to produce convenient stock
portfolio.
In the 1st phase, there are two expert systems, each of which is
responsible for technical or fundamental estimation. In the technical
expert system, for each stock, twenty seven candidates are identified
and with using rough sets-based clustering method (RC) the effective
variables have been selected. Next, for each stock two fuzzy rulebases
are developed with fuzzy C-Mean method and Takai-Sugeno-
Kang (TSK) approach; one for return estimation and the other for
risk. Thereafter, the parameters of the rule-bases are tuned with backpropagation
method. In parallel, for fundamental expert systems,
fuzzy rule-bases have been identified in the form of “IF-THEN" rules
through brainstorming with the stock market experts and the input
data have been derived from financial statements; as a result two
fuzzy rule-bases have been generated for all the stocks, one for return
and the other for risk.
In the 2nd phase, user preferences represented by four criteria and
are obtained by questionnaire. Using an expert system, four estimated
values of return and risk have been aggregated with the respective
values of user preference. At last, a fuzzy rule base having four rules,
treats these values and produce a ranking score for each stock which
will lead to a satisfactory portfolio for the user.
The stocks of six manufacturing companies and the period of
2003-2006 selected for data gathering.
Abstract: The paper presents a new hybridization methodology involving Neural, Fuzzy and Rough Computing. A Rough Sets based approximation technique has been proposed based on a certain Neuro – Fuzzy architecture. A New Rough Neuron composition consisting of a combination of a Lower Bound neuron and a Boundary neuron has also been described. The conventional convergence of error in back propagation has been given away for a new framework based on 'Output Excitation Factor' and an inverse input transfer function. The paper also presents a brief comparison of performances, of the existing Rough Neural Networks and ANFIS architecture against the proposed methodology. It can be observed that the rough approximation based neuro-fuzzy architecture is superior to its counterparts.
Abstract: The theory of rough sets is generalized by using a
filter. The filter is induced by binary relations and it is used to
generalize the basic rough set concepts. The knowledge
representations and processing of binary relations in the style of
rough set theory are investigated.
Abstract: Using maximal consistent blocks of tolerance relation
on the universe in incomplete decision table, the concepts of join block
and meet block are introduced and studied. Including tolerance class,
other blocks such as tolerant kernel and compatible kernel of an object
are also discussed at the same time. Upper and lower approximations
based on those blocks are also defined. Default definite decision rules
acquired from incomplete decision table are proposed in the paper. An
incremental algorithm to update default definite decision rules is
suggested for effective mining tasks from incomplete decision table
into which data is appended. Through an example, we demonstrate
how default definite decision rules based on maximal consistent
blocks, join blocks and meet blocks are acquired and how optimization
is done in support of discernibility matrix and discernibility function
in the incomplete decision table.
Abstract: The information systems with incomplete attribute
values and fuzzy decisions commonly exist in practical problems. On
the base of the notion of variable precision rough set model for
incomplete information system and the rough set model for
incomplete and fuzzy decision information system, the variable rough
set model for incomplete and fuzzy decision information system is
constructed, which is the generalization of the variable precision
rough set model for incomplete information system and that of rough
set model for incomplete and fuzzy decision information system. The
knowledge reduction and heuristic algorithm, built on the method and
theory of precision reduction, are proposed.
Abstract: This paper shows that some properties of the decision
rules in the literature do not hold by presenting a counterexample. We
give sufficient and necessary conditions under which these properties
are valid. These results will be helpful when one tries to choose the
right decision rules in the research of rough set theory.
Abstract: In the research field of Rough Set, few papers concern the significance of attribute set. However, there is important relation between the significance of single attribute and that of attribute set, which should not be ignored. In this paper, we draw conclusions by case analysis that (1) the attribute set including single attributes with high significance is certainly significant, while, (2)the attribute set which consists of single attributes with low significance possibly has high significance. We validate the conclusions on discernibility matrix and the results demonstrate the contribution of our conclusions.
Abstract: In this paper, we generalize some propositions in [C.Z. Wang, D.G. Chen, A short note on some properties of rough groups, Comput. Math. Appl. 59(2010)431-436.] and we give some equivalent conditions for rough subgroups. The notion of minimal upper rough subgroups is introduced and a equivalent characterization is given, which implies the rough version of Lagranges Theorem.