RPKM: The Rough Possibilistic K-Modes

Size: px
Start display at page:

Download "RPKM: The Rough Possibilistic K-Modes"

Transcription

1 RPKM: The Rough Possibilistic K-Modes Asma Ammar 1, Zied Elouedi 1, and Pawan Lingras 2 1 LARODEC, Institut Supérieur de Gestion de Tunis, Université de Tunis 41 Avenue de la Liberté, 2000 Le Bardo, Tunisie asma.ammar@voila.fr, zied.elouedi@gmx.fr 2 Department of Mathematics and Computing Science, Saint Marys University Halifax, Nova Scotia, B3H 3C3, Canada pawan@cs.smu.ca Abstract. Clustering categorical data sets under uncertain framework is a fundamental task in data mining area. In this paper, we propose a new method based on the k-modes clustering method using rough set and possibility theories in order to cluster objects into several clusters. While possibility theory handles the uncertainty in the belonging of objects to different clusters by specifying the possibilistic membership degrees, rough set theory detects and clusters peripheral objects using the upper and lower approximations. We introduce modifications on the standard version of the k-modes approach (SKM) to obtain the rough possibilistic k-modes method denoted by RPKM. These modifications make it possible to classify objects to different clusters characterized by rough boundaries. Experimental results on benchmark UCI data sets indicate the effectiveness of our proposed method i.e. RPKM. 1 Introduction Clustering is an unsupervised learning technique where its main aim is to discover structure of unlabeled data by grouping together similar objects. There are two main categories of clustering methods. They consist of hard (or crisp) methods and soft methods. Crisp approaches cluster each object of the training set into a particular cluster. In contrast to the hard clustering methods, in soft approaches, objects belong to different clusters. Actually, clustering objects into separate clusters presents a difficult task because clusters may not necessarily have precise boundaries. In order to deal with this imperfection, many theories of uncertainty have been proposed. We can mention the fuzzy set, the possibility and the Rough set theories that have been used with different clustering methods to handle uncertainty [1] [5] [6] [11]. In this work, we develop the rough possibilistic k-modes method denoted by RPKM. This proposed approach is based on the standard k-modes (SKM) and it uses possibility and rough set theories to handle uncertainty in the belonging of the objects to several clusters. Hence, it forms clusters with rough limits. The use of these uncertainty theories provides many advantages. They can express the degree of belongingness of each object to several clusters using possibilistic membership values and they allow the detection of peripheral objects (i.e. an object belongs to several clusters) using the upper and lower approximations. L. Chen et al. (Eds.): ISMIS 2012, LNAI 7661, pp , c Springer-Verlag Berlin Heidelberg 2012

2 82 A. Ammar, Z. Elouedi, and P. Lingras 2 The K-Modes Method The k-modes method (SKM) [9] [10] deals with large categorical data sets. It is based on the k-means [7] and it uses the simple matching dissimilarity measure and the frequency-based function to cluster the objects into k clusters. Assume that we have two objects X 1 and X 2 with m categorical attributes defined respectively by X 1 =(x 11, x 12,..., x 1m )andx 2 =(x 21, x 22,..., x 2m ). The simple matching method denoted by d (0 d m) is described in Equation (1): m d (X 1,X 2 )= δ (x 1t,x 2t ). (1) t=1 Note that δ (x 1t,x 2t )isequalto0ifx 1t = x 2t and equal to 1 otherwise. Moreover, d=0 if all the values of attributes relative to X 1 and X 2 are similar. However, if there are no similarities between them, d=m. Generally, if we have a set of n objects S = {X 1,X 2,..., X n } with its k-modes Q = {Q 1,Q 2,..., Q k } for set of k clusters C = {C 1,C 2,..., C k }, we can aggregate it into k clusters with k n. The minimization of the clustering cost function is min D(W, Q) = k n j=1 i=1 ω i,jd(x i,q j ), where W is an n k partition matrix and ω i,j {0, 1} is the membership degree of X i in C j. 3 Possibility and Rough Set Theories 3.1 Possibility Theory Possibility Distribution. Let us consider Ω = {ω 1,ω 2,..., ω n } as the universe of discourse where ω i is an element (an event or a state) from Ω [12]. The possibilistic scale denoted by L is defined in the quantitative setting by [0, 1]. A fundamental concept in possibility theory is the possibility distribution function denoted by π. It is defined from the set Ω to L and associates to each element ω i Ω a value from L. Besides, we mention the normalization illustrated by max i {π (ω i )} = 1, the complete knowledge defined by ω 0, π (ω 0 )=1and π (ω) = 0 otherwise and the total ignorance defined by ω Ω,π (ω) = Rough Set Theory Information System. Data sets used in RST are presented through a table known as an information table. Generally, an information system (IS) is a pair defined such that S =(U, A) whereu and A are finite and nonempty sets. U is the universe and A is the set of attributes. The value set of a also called the domain of a is denoted by V a and defined for every a A such that a : U V a. Indiscernibility Relation. Assume that S =(U, A) is an IS, the equivalence relation (IND S (B)) for any B A is defined in Equation (2): IND S (B) = { (x, y) U 2 a Ba(x) =a(y) }. (2)

3 RPKM: The Rough Possibilistic K-Modes 83 Where IND S (B) is B- indiscernibility relation and a(x) anda(y) denote respectively the value of attribute a for the elements x and y. Approximation of Sets. Suppose we have an IS: S =(U, A), B A and Y U. ThesetY can be described through the attribute values from B using two sets called the B-upper B(Y )andtheb-lowerb(y) approximations of Y. B(Y )= {B(y) :B(y) Y φ}. (3) y U B(Y )= {B(y) :B(y) Y }. (4) y U By B(y) we denote the equivalence class of B identified by the element y. Equivalence class of B describes elementary knowledge called granule. The B-boundary region of Y is described by: BN B (Y )=B(Y ) B(Y ). 4 Rough Possibilistic K-Modes The aim of the RPKM is to deal with uncertainty in the belonging of objects to several clusters based on possibilistic membership degrees and to detect peripheral objects in the clustering task using rough sets. There are several cases where an object can be similar to different clusters and it can belong to each cluster with a different degree. This fact can be caused by the high similarities between the values of the modes and objects. Clustering such objects to exactly one cluster is difficult and even impossible in some situations. Besides it can make the clustering results inaccurate. In order to avoid this limitation, we propose the RPKM that defines possibilistic membership using possibility theory in order to specify the degree of belongingness of each object to different clusters. Then, the RPKM derives clusters with rough boundaries by applying the upper and the lower approximations. Thus, an object is assigned to an upper or a lower approximation with respect to its possibilistic membership. 4.1 The RPKM Parameters 1. The simple matching dissimilarity measure: The RPKM deals with categorical and certain attributes values as the SKM does, so the simple matching method is applied, using Equation (1). It indicates how dissimilar are the objects from the clusters by comparing their attributes values. 2. The possibilistic membership degree: It presents the degree of belongingness of each object of the training set to the available clusters. It is denoted by ω ij where i and j present respectively the object and the cluster. ω ij expresses the degree of similarity between objects and clusters. To obtain this possibilistic membership, which is defined in [0, 1], we transform the dissimilarity value obtained through Equation (1) to a similarity value such that similarity = total number of attributes dissimilarity. Afterthat, we normalize the obtained result.

4 84 A. Ammar, Z. Elouedi, and P. Lingras 3. The update of clusters modes: It uses Equation (5). j k, t A, Mode jt =argmax v n ω ijtv. (5) Where i n, max j (ω ij )=1,ω ijtv is the possibilistic membership degree of the object i relative to the cluster j defined for the value v of the attribute t and A is the total number of attributes. 4. The deriving of the rough clusters from the possibilistic membership: We adapt the ratio [3] [4] to specify to which region each peripheral object belongs. In fact, after specifying the final ω ij for each object, we compute the ratio defined by Equation (6). ratio ij = max ω i. (6) ω ij After that, the ratio relative to each object is compared to a threshold 1 [3] [4] denoted by T.Ifratio ij T it means that the object i belongs to the upper bound of the cluster j. If an object belongs to the upper bound of exactly one cluster j, it means that it belongs to the lower bound of j. Note that every object in the data set satisfies the rough sets properties [3]. i=1 4.2 The RPKM Algorithm 1. Select randomly the k initial modes, one mode for each cluster. 2. Compute the distance measure between all objects and modes using Equation (1) then precise the membership degree of each object to the k clusters. 3. Allocate an object to the k clusters using the possibilistic membership. 4. Update the cluster mode using Equation (5). 5. Retest the similarity between objects and modes. Reallocate objects to clusters using possibilistic membership degrees then update the modes. 6. Repeat step 5 until all objects are stable. 7. Derive the rough clustering through the possibilistic membership degrees by computing the ratio of each object using Equation (6) and assigning each object to the upper or the lower bound of the cluster. 5 Experiments 5.1 The Framework In order to test the RPKM, we have used several real-world data sets taken from UCI machine learning repository [8]. They consist of Shuttle Landing Control (SLC), Balloons (Bal), Post-Operative Patient (POP), Congressional Voting Records (CVR), Balance Scale (BS), Tic-Tac-Toe Endgame (TE), Solar-Flare (SF) and Car Evaluation (CE).

5 RPKM: The Rough Possibilistic K-Modes Evaluation Criteria The evaluation criteria consist of the accuracy (AC), the iteration number (IN) k l=1 and the execution time (ET). The AC= ac n is the rate of the correctly classified objects, where n is the total number of objects and a C is the number of objects correctly classified in C. It can be verified that the objects with the highest degree are in the correct clusters. The IN denotes the number of iterations needed to classify the objects into k rough clusters. The ET is the time taken to form the k rough clusters and to classify the objects. 5.3 Experimental Results In this section, we make a comparative study between the RPKM, the SKM and the KM-PM (the k-modes method based on possibilistic membership) proposed in [2] which is an improved version of the SKM where each object is assigned to all the clusters with different memberships. This latter specifies how similar is each object to different clusters. However, it cannot detect the boundary region computed using the set approximations as the RPKM does. Table 1. The evaluation criteria of RPKM vs. SKM and KM-PM Data sets SLC Bal POP CVR BS TE SF CE AC SKM IN ET/s AC KM-PM IN ET/s AC RPKM IN ET/s As shown in Table 1, the RPKM has improved the clustering task of both the SKM and the KM-PM. Both of the KM-PM and the RPKM allow objects to belong to several clusters, in contrast to the SKM which forces each object to belong to exactly one cluster. The difference in the behaviors leads to different clustering results. Generally, the RPKM and the KM-PM provide better results than the SKM based on the three evaluation criteria. Furthermore, we observe that the RPKM gives the most accurate results for all data sets. Moving to the second evaluation criterion (i.e. the IN), the KM-PM and the RPKM need the same number of iterations to cluster the objects, to give the final partitions and to detect the peripheral objects. However, the last evaluation criterion i.e. the execution time relative to the RPKM is higher than the execution time of the KM-PM since, our proposed approach needs more time to detect boundary regions and to specify to which bound (upper or lower) each object belongs. We can observe that the ET of the RPKM is lower than the ET relative to the SKM. This result is due to the time taken by the SKM to cluster each object to distinct cluster which slows down the SKM algorithm. Moreover, in the SKM it is possible to obtain several modes for a particular

6 86 A. Ammar, Z. Elouedi, and P. Lingras cluster which leads to random choice, this latter may affect the stability of the partition and as a result, increases the execution time. Generally, the RPKM has improved the clustering task by providing more accurate results through the detection of clusters with rough limits. 6 Conclusion In this paper, we have highlighted the uncertainty in the clustering task by combining the SKM with the possibility and the rough set theories. This combination has been addressed in the RPKM which successfully clustered objects using possibilistic membership degrees and detected objects that belong to rough clusters. The RPKM has been tested and evaluated on several data sets from UCI machine learning repository [8]. Experimental results on well-known UCI data sets have proved the effectiveness of our method compared to the SKM and the KM-PM. References 1. Ammar, A., Elouedi, Z.: A New Possibilistic Clustering Method: The Possibilistic K- Modes. In: Pirrone, R., Sorbello, F. (eds.) AI*IA LNCS, vol. 6934, pp Springer, Heidelberg (2011) 2. Ammar, A., Elouedi, Z., Lingras, P.: K-Modes Clustering Using Possibilistic Membership. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU 2012, Part III. CCIS, vol. 299, pp Springer, Heidelberg (2012) 3. Joshi, M., Lingras, P., Rao, C.R.: Correlating Fuzzy and Rough Clustering. Fundamenta Informaticae (2011) (in press) 4. Lingras, P., Nimse, S., Darkunde, N., Muley, A.: Soft clustering from crisp clustering using granulation for mobile call mining. In: Proceedings of the GrC 2011: International Conference on Granular Computing, pp (2011) 5. Lingras, P., West, C.: Interval Set Clustering of Web Users with Rough K-means. Journal of Intelligent Information Systems 23, 5 16 (2004) 6. Lingras, P., Hogo, M., Snorek, M., Leonard, B.: Clustering Supermarket Customers Using Rough Set Based Kohonen Networks. In: Zhong, N., Raś, Z.W., Tsumoto, S., Suzuki, E. (eds.) ISMIS LNCS (LNAI), vol. 2871, pp Springer, Heidelberg (2003) 7. MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceeding of the 5th Berkeley Symposium on Math., Stat. and Prob., pp (1967) 8. Murphy, M.P., Aha, D.W.: Uci repository databases (1996), 9. Huang, Z.: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery 2, (1998) 10. Huang, Z., Ng, M.K.: A note on k-modes clustering. Journal of Classification 20, (2003) 11. Pal, N.R., Pal, K., Keller, J.M., Bezdek, J.C.: A possibilistic fuzzy c-means clustering algorithm. IEEE Transactions on Fuzzy Systems, (2005) 12. Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 1, 3 28 (1978)

Collaborative Rough Clustering

Collaborative Rough Clustering Collaborative Rough Clustering Sushmita Mitra, Haider Banka, and Witold Pedrycz Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India {sushmita, hbanka r}@isical.ac.in Dept. of Electrical

More information

Qualitative classification and evaluation in possibilistic decision trees

Qualitative classification and evaluation in possibilistic decision trees Qualitative classification evaluation in possibilistic decision trees Nahla Ben Amor Institut Supérieur de Gestion de Tunis, 41 Avenue de la liberté, 2000 Le Bardo, Tunis, Tunisia E-mail: nahlabenamor@gmxfr

More information

A Generalized Decision Logic Language for Granular Computing

A Generalized Decision Logic Language for Granular Computing A Generalized Decision Logic Language for Granular Computing Y.Y. Yao Department of Computer Science, University of Regina, Regina Saskatchewan, Canada S4S 0A2, E-mail: yyao@cs.uregina.ca Churn-Jung Liau

More information

HARD, SOFT AND FUZZY C-MEANS CLUSTERING TECHNIQUES FOR TEXT CLASSIFICATION

HARD, SOFT AND FUZZY C-MEANS CLUSTERING TECHNIQUES FOR TEXT CLASSIFICATION HARD, SOFT AND FUZZY C-MEANS CLUSTERING TECHNIQUES FOR TEXT CLASSIFICATION 1 M.S.Rekha, 2 S.G.Nawaz 1 PG SCALOR, CSE, SRI KRISHNADEVARAYA ENGINEERING COLLEGE, GOOTY 2 ASSOCIATE PROFESSOR, SRI KRISHNADEVARAYA

More information

On Generalizing Rough Set Theory

On Generalizing Rough Set Theory On Generalizing Rough Set Theory Y.Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca Abstract. This paper summarizes various formulations

More information

Mining High Order Decision Rules

Mining High Order Decision Rules Mining High Order Decision Rules Y.Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 e-mail: yyao@cs.uregina.ca Abstract. We introduce the notion of high

More information

Minimal Test Cost Feature Selection with Positive Region Constraint

Minimal Test Cost Feature Selection with Positive Region Constraint Minimal Test Cost Feature Selection with Positive Region Constraint Jiabin Liu 1,2,FanMin 2,, Shujiao Liao 2, and William Zhu 2 1 Department of Computer Science, Sichuan University for Nationalities, Kangding

More information

Belief Hierarchical Clustering

Belief Hierarchical Clustering Belief Hierarchical Clustering Wiem Maalel, Kuang Zhou, Arnaud Martin and Zied Elouedi Abstract In the data mining field many clustering methods have been proposed, yet standard versions do not take base

More information

Granular Computing based on Rough Sets, Quotient Space Theory, and Belief Functions

Granular Computing based on Rough Sets, Quotient Space Theory, and Belief Functions Granular Computing based on Rough Sets, Quotient Space Theory, and Belief Functions Yiyu (Y.Y.) Yao 1, Churn-Jung Liau 2, Ning Zhong 3 1 Department of Computer Science, University of Regina Regina, Saskatchewan,

More information

RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy Sets

RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy Sets Fundamenta Informaticae 8 (7) 475 495 475 RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy Sets Pradipta Maji and Sankar K. Pal Center for Soft Computing Research Indian Statistical Institute

More information

HFCT: A Hybrid Fuzzy Clustering Method for Collaborative Tagging

HFCT: A Hybrid Fuzzy Clustering Method for Collaborative Tagging 007 International Conference on Convergence Information Technology HFCT: A Hybrid Fuzzy Clustering Method for Collaborative Tagging Lixin Han,, Guihai Chen Department of Computer Science and Engineering,

More information

Classification with Diffuse or Incomplete Information

Classification with Diffuse or Incomplete Information Classification with Diffuse or Incomplete Information AMAURY CABALLERO, KANG YEN Florida International University Abstract. In many different fields like finance, business, pattern recognition, communication

More information

Rough Sets, Neighborhood Systems, and Granular Computing

Rough Sets, Neighborhood Systems, and Granular Computing Rough Sets, Neighborhood Systems, and Granular Computing Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca Abstract Granulation

More information

ROUGH SETS THEORY AND UNCERTAINTY INTO INFORMATION SYSTEM

ROUGH SETS THEORY AND UNCERTAINTY INTO INFORMATION SYSTEM ROUGH SETS THEORY AND UNCERTAINTY INTO INFORMATION SYSTEM Pavel Jirava Institute of System Engineering and Informatics Faculty of Economics and Administration, University of Pardubice Abstract: This article

More information

EFFICIENT ATTRIBUTE REDUCTION ALGORITHM

EFFICIENT ATTRIBUTE REDUCTION ALGORITHM EFFICIENT ATTRIBUTE REDUCTION ALGORITHM Zhongzhi Shi, Shaohui Liu, Zheng Zheng Institute Of Computing Technology,Chinese Academy of Sciences, Beijing, China Abstract: Key words: Efficiency of algorithms

More information

RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy Sets

RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy Sets Fundamenta Informaticae 8 (27) 475 496 475 RFCM: A Hybrid Clustering Algorithm Using Rough and Fuzzy Sets Pradipta Maji and Sankar K. Pal Center for Soft Computing Research Indian Statistical Institute

More information

A Rough Set Approach for Generation and Validation of Rules for Missing Attribute Values of a Data Set

A Rough Set Approach for Generation and Validation of Rules for Missing Attribute Values of a Data Set A Rough Set Approach for Generation and Validation of Rules for Missing Attribute Values of a Data Set Renu Vashist School of Computer Science and Engineering Shri Mata Vaishno Devi University, Katra,

More information

CHAPTER 3 A FAST K-MODES CLUSTERING ALGORITHM TO WAREHOUSE VERY LARGE HETEROGENEOUS MEDICAL DATABASES

CHAPTER 3 A FAST K-MODES CLUSTERING ALGORITHM TO WAREHOUSE VERY LARGE HETEROGENEOUS MEDICAL DATABASES 70 CHAPTER 3 A FAST K-MODES CLUSTERING ALGORITHM TO WAREHOUSE VERY LARGE HETEROGENEOUS MEDICAL DATABASES 3.1 INTRODUCTION In medical science, effective tools are essential to categorize and systematically

More information

A fuzzy k-modes algorithm for clustering categorical data. Citation IEEE Transactions on Fuzzy Systems, 1999, v. 7 n. 4, p.

A fuzzy k-modes algorithm for clustering categorical data. Citation IEEE Transactions on Fuzzy Systems, 1999, v. 7 n. 4, p. Title A fuzzy k-modes algorithm for clustering categorical data Author(s) Huang, Z; Ng, MKP Citation IEEE Transactions on Fuzzy Systems, 1999, v. 7 n. 4, p. 446-452 Issued Date 1999 URL http://hdl.handle.net/10722/42992

More information

A New Method For Forecasting Enrolments Combining Time-Variant Fuzzy Logical Relationship Groups And K-Means Clustering

A New Method For Forecasting Enrolments Combining Time-Variant Fuzzy Logical Relationship Groups And K-Means Clustering A New Method For Forecasting Enrolments Combining Time-Variant Fuzzy Logical Relationship Groups And K-Means Clustering Nghiem Van Tinh 1, Vu Viet Vu 1, Tran Thi Ngoc Linh 1 1 Thai Nguyen University of

More information

Mining Surgical Meta-actions Effects with Variable Diagnoses Number

Mining Surgical Meta-actions Effects with Variable Diagnoses Number Mining Surgical Meta-actions Effects with Variable Diagnoses Number Hakim Touati 1,ZbigniewW.Raś 1,2, James Studnicki 3, and Alicja A. Wieczorkowska 4 1 Univ. of North Carolina, College of Comp. and Informatics,

More information

A Rough Set Approach to Data with Missing Attribute Values

A Rough Set Approach to Data with Missing Attribute Values A Rough Set Approach to Data with Missing Attribute Values Jerzy W. Grzymala-Busse Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA and Institute

More information

CLUSTERING analysis [1] is one of the most popular

CLUSTERING analysis [1] is one of the most popular Rough K-modes Clustering Algorithm Based on Entropy Qi Duan, You Long Yang, and Yang Li Abstract Cluster analysis is an important technique used in data mining. Categorical data clustering has received

More information

QUALITY OF CLUSTER INDEX BASED ON STUDY OF DECISION TREE

QUALITY OF CLUSTER INDEX BASED ON STUDY OF DECISION TREE International Journal of Research in Computer Science eissn 2249-8265 Volume 2 Issue 1 (2011) pp. 39-43 White Globe Publications QUALITY OF CLUSTER INDEX BASED ON STUDY OF DECISION TREE B.Rajasekhar 1,

More information

Saudi Journal of Engineering and Technology. DOI: /sjeat ISSN (Print)

Saudi Journal of Engineering and Technology. DOI: /sjeat ISSN (Print) DOI:10.21276/sjeat.2016.1.4.6 Saudi Journal of Engineering and Technology Scholars Middle East Publishers Dubai, United Arab Emirates Website: http://scholarsmepub.com/ ISSN 2415-6272 (Print) ISSN 2415-6264

More information

Determination of Similarity Threshold in Clustering Problems for Large Data Sets

Determination of Similarity Threshold in Clustering Problems for Large Data Sets Determination of Similarity Threshold in Clustering Problems for Large Data Sets Guillermo Sánchez-Díaz 1 and José F. Martínez-Trinidad 2 1 Center of Technologies Research on Information and Systems, The

More information

Semi-Supervised Clustering with Partial Background Information

Semi-Supervised Clustering with Partial Background Information Semi-Supervised Clustering with Partial Background Information Jing Gao Pang-Ning Tan Haibin Cheng Abstract Incorporating background knowledge into unsupervised clustering algorithms has been the subject

More information

Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction

Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction Jerzy W. Grzymala-Busse 1,2 1 Department of Electrical Engineering and Computer Science, University of

More information

A framework for fuzzy models of multiple-criteria evaluation

A framework for fuzzy models of multiple-criteria evaluation INTERNATIONAL CONFERENCE ON FUZZY SET THEORY AND APPLICATIONS Liptovský Ján, Slovak Republic, January 30 - February 3, 2012 A framework for fuzzy models of multiple-criteria evaluation Jana Talašová, Ondřej

More information

APPLICATION OF THE FUZZY MIN-MAX NEURAL NETWORK CLASSIFIER TO PROBLEMS WITH CONTINUOUS AND DISCRETE ATTRIBUTES

APPLICATION OF THE FUZZY MIN-MAX NEURAL NETWORK CLASSIFIER TO PROBLEMS WITH CONTINUOUS AND DISCRETE ATTRIBUTES APPLICATION OF THE FUZZY MIN-MAX NEURAL NETWORK CLASSIFIER TO PROBLEMS WITH CONTINUOUS AND DISCRETE ATTRIBUTES A. Likas, K. Blekas and A. Stafylopatis National Technical University of Athens Department

More information

Approximate Reasoning with Fuzzy Booleans

Approximate Reasoning with Fuzzy Booleans Approximate Reasoning with Fuzzy Booleans P.M. van den Broek Department of Computer Science, University of Twente,P.O.Box 217, 7500 AE Enschede, the Netherlands pimvdb@cs.utwente.nl J.A.R. Noppen Department

More information

Approximation of Relations. Andrzej Skowron. Warsaw University. Banacha 2, Warsaw, Poland. Jaroslaw Stepaniuk

Approximation of Relations. Andrzej Skowron. Warsaw University. Banacha 2, Warsaw, Poland.   Jaroslaw Stepaniuk Approximation of Relations Andrzej Skowron Institute of Mathematics Warsaw University Banacha 2, 02-097 Warsaw, Poland e-mail: skowron@mimuw.edu.pl Jaroslaw Stepaniuk Institute of Computer Science Technical

More information

CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION

CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION CHAPTER 6 MODIFIED FUZZY TECHNIQUES BASED IMAGE SEGMENTATION 6.1 INTRODUCTION Fuzzy logic based computational techniques are becoming increasingly important in the medical image analysis arena. The significant

More information

Interval Sets and Interval-Set Algebras

Interval Sets and Interval-Set Algebras Interval Sets and Interval-Set Algebras Yiyu Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 yyao@cs.uregina.ca Abstract An interval set is an interval in

More information

A Comparison of Global and Local Probabilistic Approximations in Mining Data with Many Missing Attribute Values

A Comparison of Global and Local Probabilistic Approximations in Mining Data with Many Missing Attribute Values A Comparison of Global and Local Probabilistic Approximations in Mining Data with Many Missing Attribute Values Patrick G. Clark Department of Electrical Eng. and Computer Sci. University of Kansas Lawrence,

More information

S-APPROXIMATION SPACES: A FUZZY APPROACH

S-APPROXIMATION SPACES: A FUZZY APPROACH Iranian Journal of Fuzzy Systems Vol. 14, No.2, (2017) pp. 127-154 127 S-APPROXIMATION SPACES: A FUZZY APPROACH A. SHAKIBA, M. R. HOOSHMANDASL, B. DAVVAZ AND S. A. SHAHZADEH FAZELI Abstract. In this paper,

More information

Mining Local Association Rules from Temporal Data Set

Mining Local Association Rules from Temporal Data Set Mining Local Association Rules from Temporal Data Set Fokrul Alom Mazarbhuiya 1, Muhammad Abulaish 2,, Anjana Kakoti Mahanta 3, and Tanvir Ahmad 4 1 College of Computer Science, King Khalid University,

More information

Enhancing K-means Clustering Algorithm with Improved Initial Center

Enhancing K-means Clustering Algorithm with Improved Initial Center Enhancing K-means Clustering Algorithm with Improved Initial Center Madhu Yedla #1, Srinivasa Rao Pathakota #2, T M Srinivasa #3 # Department of Computer Science and Engineering, National Institute of

More information

A Logic Language of Granular Computing

A Logic Language of Granular Computing A Logic Language of Granular Computing Yiyu Yao and Bing Zhou Department of Computer Science University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: {yyao, zhou200b}@cs.uregina.ca Abstract Granular

More information

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY ALGEBRAIC METHODS IN LOGIC AND IN COMPUTER SCIENCE BANACH CENTER PUBLICATIONS, VOLUME 28 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1993 ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING

More information

The Rough Set View on Bayes Theorem

The Rough Set View on Bayes Theorem The Rough Set View on Bayes Theorem Zdzis law Pawlak University of Information Technology and Management ul. Newelska 6, 01 447 Warsaw, Poland zpw@ii.pw.edu.pl MOTTO: It is a capital mistake to theorise

More information

Formal Concept Analysis and Hierarchical Classes Analysis

Formal Concept Analysis and Hierarchical Classes Analysis Formal Concept Analysis and Hierarchical Classes Analysis Yaohua Chen, Yiyu Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: {chen115y, yyao}@cs.uregina.ca

More information

Induction of Strong Feature Subsets

Induction of Strong Feature Subsets Induction of Strong Feature Subsets Mohamed Quafafou and Moussa Boussouf IRIN, University of Nantes, 2 rue de la Houssiniere, BP 92208-44322, Nantes Cedex 03, France. quafafou9 Abstract The problem of

More information

Using Decision Boundary to Analyze Classifiers

Using Decision Boundary to Analyze Classifiers Using Decision Boundary to Analyze Classifiers Zhiyong Yan Congfu Xu College of Computer Science, Zhejiang University, Hangzhou, China yanzhiyong@zju.edu.cn Abstract In this paper we propose to use decision

More information

self-organizing maps and symbolic data

self-organizing maps and symbolic data self-organizing maps and symbolic data Aïcha El Golli, Brieuc Conan-Guez, Fabrice Rossi AxIS project, National Research Institute in Computer Science and Control (INRIA) Rocquencourt Research Unit Domaine

More information

Granular Computing: A Paradigm in Information Processing Saroj K. Meher Center for Soft Computing Research Indian Statistical Institute, Kolkata

Granular Computing: A Paradigm in Information Processing Saroj K. Meher Center for Soft Computing Research Indian Statistical Institute, Kolkata Granular Computing: A Paradigm in Information Processing Saroj K. Meher Center for Soft Computing Research Indian Statistical Institute, Kolkata Granular computing (GrC): Outline Introduction Definitions

More information

Keywords: clustering algorithms, unsupervised learning, cluster validity

Keywords: clustering algorithms, unsupervised learning, cluster validity Volume 6, Issue 1, January 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Clustering Based

More information

UNSUPERVISED STATIC DISCRETIZATION METHODS IN DATA MINING. Daniela Joiţa Titu Maiorescu University, Bucharest, Romania

UNSUPERVISED STATIC DISCRETIZATION METHODS IN DATA MINING. Daniela Joiţa Titu Maiorescu University, Bucharest, Romania UNSUPERVISED STATIC DISCRETIZATION METHODS IN DATA MINING Daniela Joiţa Titu Maiorescu University, Bucharest, Romania danielajoita@utmro Abstract Discretization of real-valued data is often used as a pre-processing

More information

A Parallel Evolutionary Algorithm for Discovery of Decision Rules

A Parallel Evolutionary Algorithm for Discovery of Decision Rules A Parallel Evolutionary Algorithm for Discovery of Decision Rules Wojciech Kwedlo Faculty of Computer Science Technical University of Bia lystok Wiejska 45a, 15-351 Bia lystok, Poland wkwedlo@ii.pb.bialystok.pl

More information

REDUNDANCY OF MULTISET TOPOLOGICAL SPACES

REDUNDANCY OF MULTISET TOPOLOGICAL SPACES Iranian Journal of Fuzzy Systems Vol. 14, No. 4, (2017) pp. 163-168 163 REDUNDANCY OF MULTISET TOPOLOGICAL SPACES A. GHAREEB Abstract. In this paper, we show the redundancies of multiset topological spaces.

More information

Some questions of consensus building using co-association

Some questions of consensus building using co-association Some questions of consensus building using co-association VITALIY TAYANOV Polish-Japanese High School of Computer Technics Aleja Legionow, 4190, Bytom POLAND vtayanov@yahoo.com Abstract: In this paper

More information

Optimization with linguistic variables

Optimization with linguistic variables Optimization with linguistic variables Christer Carlsson christer.carlsson@abo.fi Robert Fullér rfuller@abo.fi Abstract We consider fuzzy mathematical programming problems (FMP) in which the functional

More information

Applying Rough Set Concepts to Clustering

Applying Rough Set Concepts to Clustering Applying Rough Set Concepts to Clustering Pawan Lingras and Georg Peters Abstract Clustering algorithms are probably the most commonly used methods in data mining. Applications can be found in virtually

More information

Discretizing Continuous Attributes Using Information Theory

Discretizing Continuous Attributes Using Information Theory Discretizing Continuous Attributes Using Information Theory Chang-Hwan Lee Department of Information and Communications, DongGuk University, Seoul, Korea 100-715 chlee@dgu.ac.kr Abstract. Many classification

More information

Rough Approximations under Level Fuzzy Sets

Rough Approximations under Level Fuzzy Sets Rough Approximations under Level Fuzzy Sets W.-N. Liu J.T. Yao Y.Y.Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: [liuwe200, jtyao, yyao]@cs.uregina.ca

More information

Modeling the Real World for Data Mining: Granular Computing Approach

Modeling the Real World for Data Mining: Granular Computing Approach Modeling the Real World for Data Mining: Granular Computing Approach T. Y. Lin Department of Mathematics and Computer Science San Jose State University San Jose California 95192-0103 and Berkeley Initiative

More information

6. Dicretization methods 6.1 The purpose of discretization

6. Dicretization methods 6.1 The purpose of discretization 6. Dicretization methods 6.1 The purpose of discretization Often data are given in the form of continuous values. If their number is huge, model building for such data can be difficult. Moreover, many

More information

Efficient SQL-Querying Method for Data Mining in Large Data Bases

Efficient SQL-Querying Method for Data Mining in Large Data Bases Efficient SQL-Querying Method for Data Mining in Large Data Bases Nguyen Hung Son Institute of Mathematics Warsaw University Banacha 2, 02095, Warsaw, Poland Abstract Data mining can be understood as a

More information

Fuzzy Set-Theoretical Approach for Comparing Objects with Fuzzy Attributes

Fuzzy Set-Theoretical Approach for Comparing Objects with Fuzzy Attributes Fuzzy Set-Theoretical Approach for Comparing Objects with Fuzzy Attributes Y. Bashon, D. Neagu, M.J. Ridley Department of Computing University of Bradford Bradford, BD7 DP, UK e-mail: {Y.Bashon, D.Neagu,

More information

On Solving Fuzzy Rough Linear Fractional Programming Problem

On Solving Fuzzy Rough Linear Fractional Programming Problem On Solving Fuzzy Rough Linear Fractional Programming Problem El-saeed Ammar 1 Mohamed Muamer 2 1 Professor Dept. of mathematics Faculty of science. Tanta University. Tanta Egypt 2 PhD student of mathematics

More information

Rough Set Approaches to Rule Induction from Incomplete Data

Rough Set Approaches to Rule Induction from Incomplete Data Proceedings of the IPMU'2004, the 10th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Perugia, Italy, July 4 9, 2004, vol. 2, 923 930 Rough

More information

A Modular Reduction Method for k-nn Algorithm with Self-recombination Learning

A Modular Reduction Method for k-nn Algorithm with Self-recombination Learning A Modular Reduction Method for k-nn Algorithm with Self-recombination Learning Hai Zhao and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University, 800 Dong Chuan Rd.,

More information

Chapter 4 Fuzzy Logic

Chapter 4 Fuzzy Logic 4.1 Introduction Chapter 4 Fuzzy Logic The human brain interprets the sensory information provided by organs. Fuzzy set theory focus on processing the information. Numerical computation can be performed

More information

Dynamic Clustering of Data with Modified K-Means Algorithm

Dynamic Clustering of Data with Modified K-Means Algorithm 2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Dynamic Clustering of Data with Modified K-Means Algorithm Ahamed Shafeeq

More information

A Weighted Majority Voting based on Normalized Mutual Information for Cluster Analysis

A Weighted Majority Voting based on Normalized Mutual Information for Cluster Analysis A Weighted Majority Voting based on Normalized Mutual Information for Cluster Analysis Meshal Shutaywi and Nezamoddin N. Kachouie Department of Mathematical Sciences, Florida Institute of Technology Abstract

More information

Moving Object Segmentation Method Based on Motion Information Classification by X-means and Spatial Region Segmentation

Moving Object Segmentation Method Based on Motion Information Classification by X-means and Spatial Region Segmentation IJCSNS International Journal of Computer Science and Network Security, VOL.13 No.11, November 2013 1 Moving Object Segmentation Method Based on Motion Information Classification by X-means and Spatial

More information

Fuzzy Sets and Systems. Lecture 1 (Introduction) Bu- Ali Sina University Computer Engineering Dep. Spring 2010

Fuzzy Sets and Systems. Lecture 1 (Introduction) Bu- Ali Sina University Computer Engineering Dep. Spring 2010 Fuzzy Sets and Systems Lecture 1 (Introduction) Bu- Ali Sina University Computer Engineering Dep. Spring 2010 Fuzzy sets and system Introduction and syllabus References Grading Fuzzy sets and system Syllabus

More information

Attribute Reduction using Forward Selection and Relative Reduct Algorithm

Attribute Reduction using Forward Selection and Relative Reduct Algorithm Attribute Reduction using Forward Selection and Relative Reduct Algorithm P.Kalyani Associate Professor in Computer Science, SNR Sons College, Coimbatore, India. ABSTRACT Attribute reduction of an information

More information

Granular Computing. Y. Y. Yao

Granular Computing. Y. Y. Yao Granular Computing Y. Y. Yao Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca, http://www.cs.uregina.ca/~yyao Abstract The basic ideas

More information

An Accelerated MapReduce-based K-prototypes for Big Data

An Accelerated MapReduce-based K-prototypes for Big Data An Accelerated MapReduce-based K-prototypes for Big Data Mohamed Aymen Ben HajKacem, Chiheb-Eddine Ben N'cir, and Nadia Essoussi LARODEC, Université de Tunis, Institut Supérieur de Gestion de Tunis, 41

More information

A Decision-Theoretic Rough Set Model

A Decision-Theoretic Rough Set Model A Decision-Theoretic Rough Set Model Yiyu Yao and Jingtao Yao Department of Computer Science University of Regina Regina, Saskatchewan, Canada S4S 0A2 {yyao,jtyao}@cs.uregina.ca Special Thanks to Professor

More information

American International Journal of Research in Science, Technology, Engineering & Mathematics

American International Journal of Research in Science, Technology, Engineering & Mathematics American International Journal of Research in Science, Technology, Engineering & Mathematics Available online at http://www.iasir.net ISSN (Print): 2328-3491, ISSN (Online): 2328-3580, ISSN (CD-ROM): 2328-3629

More information

Semantics of Fuzzy Sets in Rough Set Theory

Semantics of Fuzzy Sets in Rough Set Theory Semantics of Fuzzy Sets in Rough Set Theory Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan Canada S4S 0A2 E-mail: yyao@cs.uregina.ca URL: http://www.cs.uregina.ca/ yyao

More information

Multiple-Criteria Fuzzy Evaluation: The FuzzME Software Package

Multiple-Criteria Fuzzy Evaluation: The FuzzME Software Package Multiple-Criteria Fuzzy Evaluation: The FuzzME Software Package Jana Talašová 1 Pavel Holeček 2 1., 2. Faculty of Science, Palacký University Olomouc tř. Svobody 26, 771 46 Olomouc, Czech Republic Email:

More information

Swarm Based Fuzzy Clustering with Partition Validity

Swarm Based Fuzzy Clustering with Partition Validity Swarm Based Fuzzy Clustering with Partition Validity Lawrence O. Hall and Parag M. Kanade Computer Science & Engineering Dept University of South Florida, Tampa FL 33620 @csee.usf.edu Abstract

More information

I. INTRODUCTION II. RELATED WORK.

I. INTRODUCTION II. RELATED WORK. ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: A New Hybridized K-Means Clustering Based Outlier Detection Technique

More information

Package SoftClustering

Package SoftClustering Title Soft Clustering Algorithms Package SoftClustering February 19, 2015 It contains soft clustering algorithms, in particular approaches derived from rough set theory: Lingras & West original rough k-means,

More information

Fuzzy Queueing Model Using DSW Algorithm

Fuzzy Queueing Model Using DSW Algorithm Fuzzy Queueing Model Using DSW Algorithm R. Srinivasan Department of Mathematics, Kongunadu College of Engineering and Technology, Tiruchirappalli 621215, Tamilnadu ABSTRACT--- This paper proposes a procedure

More information

A study on lower interval probability function based decision theoretic rough set models

A study on lower interval probability function based decision theoretic rough set models Annals of Fuzzy Mathematics and Informatics Volume 12, No. 3, (September 2016), pp. 373 386 ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon

More information

Data Analysis and Mining in Ordered Information Tables

Data Analysis and Mining in Ordered Information Tables Data Analysis and Mining in Ordered Information Tables Ying Sai, Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: yyao@cs.uregina.ca Ning Zhong

More information

Strong Chromatic Number of Fuzzy Graphs

Strong Chromatic Number of Fuzzy Graphs Annals of Pure and Applied Mathematics Vol. 7, No. 2, 2014, 52-60 ISSN: 2279-087X (P), 2279-0888(online) Published on 18 September 2014 www.researchmathsci.org Annals of Strong Chromatic Number of Fuzzy

More information

Similarity Measures of Pentagonal Fuzzy Numbers

Similarity Measures of Pentagonal Fuzzy Numbers Volume 119 No. 9 2018, 165-175 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Similarity Measures of Pentagonal Fuzzy Numbers T. Pathinathan 1 and

More information

Application of Fuzzy Classification in Bankruptcy Prediction

Application of Fuzzy Classification in Bankruptcy Prediction Application of Fuzzy Classification in Bankruptcy Prediction Zijiang Yang 1 and Guojun Gan 2 1 York University zyang@mathstat.yorku.ca 2 York University gjgan@mathstat.yorku.ca Abstract. Classification

More information

On the packing chromatic number of some lattices

On the packing chromatic number of some lattices On the packing chromatic number of some lattices Arthur S. Finbow Department of Mathematics and Computing Science Saint Mary s University Halifax, Canada BH C art.finbow@stmarys.ca Douglas F. Rall Department

More information

Learning the Three Factors of a Non-overlapping Multi-camera Network Topology

Learning the Three Factors of a Non-overlapping Multi-camera Network Topology Learning the Three Factors of a Non-overlapping Multi-camera Network Topology Xiaotang Chen, Kaiqi Huang, and Tieniu Tan National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy

More information

Sequences Modeling and Analysis Based on Complex Network

Sequences Modeling and Analysis Based on Complex Network Sequences Modeling and Analysis Based on Complex Network Li Wan 1, Kai Shu 1, and Yu Guo 2 1 Chongqing University, China 2 Institute of Chemical Defence People Libration Army {wanli,shukai}@cqu.edu.cn

More information

Advances in Fuzzy Rough Set Theory for Temporal Databases

Advances in Fuzzy Rough Set Theory for Temporal Databases Advances in Fuzzy Rough Set Theory for Temporal Databases AQIL BURNEY, NADEEM MAHMOOD, ZAIN ABBAS Department of Computer Science University of Karachi University Road, Karachi 75270 PAKISTAN burney@uok.edu.pk,

More information

Feature Selection with Adjustable Criteria

Feature Selection with Adjustable Criteria Feature Selection with Adjustable Criteria J.T. Yao M. Zhang Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: jtyao@cs.uregina.ca Abstract. We present a

More information

On Reduct Construction Algorithms

On Reduct Construction Algorithms 1 On Reduct Construction Algorithms Yiyu Yao 1, Yan Zhao 1 and Jue Wang 2 1 Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 {yyao, yanzhao}@cs.uregina.ca 2 Laboratory

More information

Efficient Rule Set Generation using K-Map & Rough Set Theory (RST)

Efficient Rule Set Generation using K-Map & Rough Set Theory (RST) International Journal of Engineering & Technology Innovations, Vol. 2 Issue 3, May 2015 www..com 6 Efficient Rule Set Generation using K-Map & Rough Set Theory (RST) Durgesh Srivastava 1, Shalini Batra

More information

Supervised vs. Unsupervised Learning

Supervised vs. Unsupervised Learning Clustering Supervised vs. Unsupervised Learning So far we have assumed that the training samples used to design the classifier were labeled by their class membership (supervised learning) We assume now

More information

ECM A Novel On-line, Evolving Clustering Method and Its Applications

ECM A Novel On-line, Evolving Clustering Method and Its Applications ECM A Novel On-line, Evolving Clustering Method and Its Applications Qun Song 1 and Nikola Kasabov 2 1, 2 Department of Information Science, University of Otago P.O Box 56, Dunedin, New Zealand (E-mail:

More information

Cost Minimization Fuzzy Assignment Problem applying Linguistic Variables

Cost Minimization Fuzzy Assignment Problem applying Linguistic Variables Inter national Journal of Pure and Applied Mathematics Volume 113 No. 6 2017, 404 412 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Cost Minimization

More information

Data Mining & Feature Selection

Data Mining & Feature Selection دااگشنه رتبيت م عل م Data Mining & Feature Selection M.M. Pedram pedram@tmu.ac.ir Faculty of Engineering, Tarbiat Moallem University The 11 th Iranian Confernce on Fuzzy systems, 5-7 July, 2011 Contents

More information

Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets

Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan Canada S4S 0A2 E-mail: yyao@cs.uregina.ca

More information

A Novel Fuzzy Rough Granular Neural Network for Classification

A Novel Fuzzy Rough Granular Neural Network for Classification International Journal of Computational Intelligence Systems, Vol. 4, No. 5 (September, 2011), 1042-1051 A Novel Fuzzy Rough Granular Neural Network for Classification Avatharam Ganivada, Sankar K. Pal

More information

10701 Machine Learning. Clustering

10701 Machine Learning. Clustering 171 Machine Learning Clustering What is Clustering? Organizing data into clusters such that there is high intra-cluster similarity low inter-cluster similarity Informally, finding natural groupings among

More information

Cluster analysis of 3D seismic data for oil and gas exploration

Cluster analysis of 3D seismic data for oil and gas exploration Data Mining VII: Data, Text and Web Mining and their Business Applications 63 Cluster analysis of 3D seismic data for oil and gas exploration D. R. S. Moraes, R. P. Espíndola, A. G. Evsukoff & N. F. F.

More information

A Proposed Approach for Solving Rough Bi-Level. Programming Problems by Genetic Algorithm

A Proposed Approach for Solving Rough Bi-Level. Programming Problems by Genetic Algorithm Int J Contemp Math Sciences, Vol 6, 0, no 0, 45 465 A Proposed Approach or Solving Rough Bi-Level Programming Problems by Genetic Algorithm M S Osman Department o Basic Science, Higher Technological Institute

More information

Estimating Missing Attribute Values Using Dynamically-Ordered Attribute Trees

Estimating Missing Attribute Values Using Dynamically-Ordered Attribute Trees Estimating Missing Attribute Values Using Dynamically-Ordered Attribute Trees Jing Wang Computer Science Department, The University of Iowa jing-wang-1@uiowa.edu W. Nick Street Management Sciences Department,

More information