CLUSTERING OF DECISION TABLES TOWARD ROUGH SET-BASED GROUP DECISION AID

2011 ◽  
Vol 19 (supp01) ◽  
pp. 17-32 ◽  
Author(s):  
MASAHIRO INUIGUCHI ◽  
RYUTA ENOMOTO
Keyword(s):  
Hierarchical Clustering ◽  
Rough Set ◽  
Real World ◽  
Decision Aid ◽  
Group Decision ◽  
Decision Rules ◽  
Agglomerative Hierarchical Clustering ◽  
Clustering Techniques ◽  
Fuzzy C Means ◽  
Decision Tables

In order to analyze the distribution of individual opinions (decision rules) in a group, clustering of decision tables is proposed. An agglomerative hierarchical clustering (AHC) of decision tables has been examined. The result of AHC does not always optimize some criterion. We develop non-hierarchical clustering techniques for decision tables. In order to treat positive and negative evaluations to a common profile, we use a vector of rough membership values to represent individual opinion to a profile. Using rough membership values, we develop a K -means method as well as fuzzy c-means methods for clustering decision tables. We examined the proposed methods in clustering real world decision tables obtained by a questionnaire investigation.

Deep learning architecture using rough sets and rough neural networks

Kybernetes ◽  
2017 ◽  
Vol 46 (4) ◽  
pp. 693-705 ◽  
Author(s):  
Yasser F. Hassan
Keyword(s):  
Machine Learning ◽  
Deep Learning ◽  
Soft Computing ◽  
Rough Set ◽  
Real World ◽  
Rough Sets ◽  
Decision Table ◽  
Content Type ◽  
Real World Applications ◽  
Decision Tables

Purpose This paper aims to utilize machine learning and soft computing to propose a new method of rough sets using deep learning architecture for many real-world applications. Design/methodology/approach The objective of this work is to propose a model for deep rough set theory that uses more than decision table and approximating these tables to a classification system, i.e. the paper propose a novel framework of deep learning based on multi-decision tables. Findings The paper tries to coordinate the local properties of individual decision table to provide an appropriate global decision from the system. Research limitations/implications The rough set learning assumes the existence of a single decision table, whereas real-world decision problem implies several decisions with several different decision tables. The new proposed model can handle multi-decision tables. Practical implications The proposed classification model is implemented on social networks with preferred features which are freely distribute as social entities with accuracy around 91 per cent. Social implications The deep learning using rough sets theory simulate the way of brain thinking and can solve the problem of existence of different information about same problem in different decision systems Originality/value This paper utilizes machine learning and soft computing to propose a new method of rough sets using deep learning architecture for many real-world applications.

scholarly journals Quality of classification with LERS system in the data size context

2018 ◽  
Vol 16 (1/2) ◽  
pp. 29-38 ◽  
Author(s):  
M. Sudha ◽  
A. Kumaravel
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Decision Rules ◽  
Research Trend ◽  
Decision Tables ◽  
New Situation ◽  
Decision State

Rough set theory is a simple and potential methodology in extracting and minimizing rules from decision tables. Its concepts are core, reduct and discovering knowledge in the form of rules. The decision rules explain the decision state to predict and support the new situation. Initially it was proposed as a useful tool for analysis of decision states. This approach produces a set of decision rules involves two types namely certain and possible rules based on approximation. The prediction may highly be affected if the data size varies in larger numbers. Application of Rough set theory towards this direction has not been considered yet. Hence the main objective of this paper is to study the influence of data size and the number of rules generated by rough set methods. The performance of these methods is presented through the metric like accuracy and quality of classification. The results obtained show the range of performance and first of its kind in current research trend.

Clustering Methods in Game Data Science

2021 ◽  
pp. 133-178
Author(s):  
Magy Seif El-Nasr ◽  
Truong Huy Nguyen Dinh ◽  
Alessandro Canossa ◽  
Anders Drachen
Keyword(s):  
Hierarchical Clustering ◽  
Data Science ◽  
The Other ◽  
Clustering Methods ◽  
Clustering Techniques ◽  
Model Based Clustering ◽  
Fuzzy C Means ◽  
Model Based

This chapter discusses different clustering methods and their application to game data. In particular, the chapter details K-means, Fuzzy C-Means, Hierarchical Clustering, Archetypical Analysis, and Model-based clustering techniques. It discusses the disadvantages and advantages of the different methods and discusses when you may use one method vs. the other. It also identifies and shows you ways to visualize the results to make sense of the resulting clusters. It also includes details on how one would evaluate such clusters or go about applying the algorithms to a game dataset. The chapter includes labs to delve deeper into the application of these algorithms on real game data.

Rule Extraction and Rule Evaluation Based on Granular Computing

2010 ◽  
pp. 196-242
Author(s):  
Jiye Liang ◽  
Yuhua Qian ◽  
Deyu Li
Keyword(s):  
Decision Rule ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Decision Rules ◽  
Rule Extraction ◽  
Decision Table ◽  
Rule Set ◽  
Decision Tables ◽  
Rule Evaluation

In rough set theory, rule extraction and rule evaluation are two important issues. In this chapter, the concepts of positive approximation and converse approximation are first introduced, which can be seen as dynamic approximations of target concepts based on a granulation order. Then, two algorithms for rule extraction called MABPA and REBCA are designed and applied to hierarchically generate decision rules from a decision table. Furthermore, to evaluate the whole performance of a decision rule set, three kinds of measures are proposed for evaluating the certainty, consistency and support of a decision-rule set extracted from a decision table, respectively. The experimental analyses on several decision tables show that these three new measures are adequate for evaluating the decision performance of a decision-rule set extracted from a decision table in rough set theory. The measures may be helpful for determining which rule extraction technique should be chosen in a practical decision problem.

scholarly journals Hesitant Fuzzy Linguistic Agglomerative Hierarchical Clustering Algorithm and Its Application in Judicial Practice

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 370
Author(s):  
Shuangsheng Wu ◽  
Jie Lin ◽  
Zhenyu Zhang ◽  
Yushu Yang
Keyword(s):  
Hierarchical Clustering ◽  
Clustering Algorithm ◽  
Clustering Algorithms ◽  
Agglomerative Hierarchical Clustering ◽  
Research Gaps ◽  
Judicial Practice ◽  
Linguistic Term ◽  
Clustering Effect ◽  
Hierarchical Clustering Algorithm ◽  
Fuzzy Linguistic

The fuzzy clustering algorithm has become a research hotspot in many fields because of its better clustering effect and data expression ability. However, little research focuses on the clustering of hesitant fuzzy linguistic term sets (HFLTSs). To fill in the research gaps, we extend the data type of clustering to hesitant fuzzy linguistic information. A kind of hesitant fuzzy linguistic agglomerative hierarchical clustering algorithm is proposed. Furthermore, we propose a hesitant fuzzy linguistic Boole matrix clustering algorithm and compare the two clustering algorithms. The proposed clustering algorithms are applied in the field of judicial execution, which provides decision support for the executive judge to determine the focus of the investigation and the control. A clustering example verifies the clustering algorithm’s effectiveness in the context of hesitant fuzzy linguistic decision information.

Sign in / Sign up

Export Citation Format

Share Document