A Fuzzy C-means Clustering Algorithm Based on Pseudo-nearest-neighbor Intervals for Incomplete Data
|
|
- Ronald Hardy
- 5 years ago
- Views:
Transcription
1 Journal of Computational Information Systems 11: 6 (2015) Available at A Fuzzy C-means Clustering Algorithm Based on Pseudo-nearest-neighbor Intervals for Incomplete Data Zujun CHEN, Dan LI, Chongquan ZHONG, Xiaorui XU School of Control Science and Engineering, Dalian University of Technology, Dalian , China Abstract Missing data handling is a challenging issue often dealt with in data mining and pattern classification. In this paper, a fuzzy c-means clustering algorithm based on pseudo-nearest-neighbor intervals for incomplete data is given. The data are first completed using the pseudo-nearest-neighbor intervals approach, then the data set can be clustered based on the fuzzy c-means algorithm for interval-valued data. The proposed algorithm estimates the missing attribute values without normalization, thus captures the essence of pattern similarities in the original untouched data set. Additionally, the pseudonearest-neighbor intervals representation takes account of implicit uncertainly of missing attribute values, and considers the angle between incomplete data and other data as well. Results on several incomplete data sets demonstrate the effectiveness of the proposed algorithm. Keywords: Fuzzy C-means; Missing Data Recovery; Pseudo-nearest-neighbor; Clustering 1 Introduction The fuzzy c-means (FCM) algorithm is a well-known partitional clustering method and has long played an important role in various application domains, such as pattern recognition and data mining. However, sometimes data sets can be incomplete as a result of random noise, limited time, etc. What s more, FCM is not directly applicable to such incomplete data. If not handled properly, these incomplete data may lead to large errors or biased clustering results. Much research has been done on clustering of incomplete data. Hathaway and Bezdek advocated four different strategies for doing FCM clustering of incomplete data sets [1]. In the whole data strategy (WDS), only complete data are regarded during FCM clustering. The partial distance strategy (PDS) calculates the partial distances between incomplete data and prototypes using available attribute values, and then scales the quantity by the reciprocal of the proportion of components used. The third approach is referred to as optimal completion strategy (OCS). In this approach, missing attribute values are viewed as additional parameters which will be This work is partially supported by the National Science Foundation of China under Grant , and the Fundamental Research Funds for the Central Universities DUT13JS03. Corresponding author. address: ldan@dlut.edu.cn (Dan LI) / Copyright 2015 Binary Information Press DOI: /jcis13783 March 15, 2015
2 2140 Z. Chen et al. /Journal of Computational Information Systems 11: 6 (2015) optimized to find better estimates in each iteration. The fourth strategy (nearest prototype strategy, NPS) is a simple modification of OCS, and each missing attribute value is substituted by the corresponding attribute value of the nearest prototype. By taking into account the essence of pattern similarities, Zhu [2] studied a new missing data recovery method, namely the pseudonearest-neighbor substitution approach. In 2003, a kernel-based fuzzy c-means (KFCM) algorithm was presented to cluster incomplete data [3]. Lim [4] proposed a hybrid network comprising fuzzy artmap and fuzzy c-means clustering for pattern classification with incomplete data. Li [5] developed a fuzzy c-means algorithm for incomplete data based on nearest-neighbor intervals (FCM-NNI). And Li [6] proposed a hybrid genetic algorithm-fuzzy c-means approach, in which the missing attribute values estimation is limited to the subsets that contain nearest neighbors of incomplete data rather than the entire attribute space. Wang [7] proposed a hybrid clustering methods for incomplete data with nearest-neighbor interval. In this paper, a novel fuzzy c-means algorithm for incomplete data based on pseudo-nearestneighbor intervals (FCM-PNNI) is given. Firstly, missing attribute values are represented by pseudo-nearest-neighbor intervals (PNNI) with regard to the implicit uncertainty of missing attribute values and the angle between vectors in data set especially. What s more, the proposed missing data recovery approach is performed using original the original data set. Secondly, a FCM clustering algorithm for interval-valued data is used to cluster incomplete data, and the interval prototypes obtained can reflect the shape of the clusters to some extent. The rest of this paper is organized as follows. Section 2 describes the basis of pseudo-nearestneighbor interval for missing data recovery. Section 3 introduces the FCM algorithm based on PNNI for incomplete data (FCM-PNNI). Section 4 gives experimental results of the proposed method and compares it with five other methods. Section 5 contains the concluding remarks. 2 Pseudo-nearest-neighbor Intervals Determination Recently, the use of nearest-neighbor (NN) based techniques has been a valuable tool for missing data recovery. But often, the NN method leads to over-fitting, and it is extended to k nearest neighbor (KNN) method. From the perspective of the accuracy of imputed data, Zhang [8] proposed a Shelly Neighbors method, in which each missing attribute value was imputed by those neighbors that form a shell surround the missing datum. To deal with heterogeneous data sets, a lately novel KNN imputation method based on gray distance [9] was presented, named gray KNN (GKNN) imputation. In the above methods, the missing attribute values are estimated by numerical values, which ignore the implicit uncertainty. In addition, numerical data always need normalization to avoid the bias that related to the magnitude. However, this causes the data points to become closer to each other in Euclidean space. In this paper, the pseudo-nearest-neighbor method for missing data recovery is based on the partial cosine similarity without normalization, thus captures the essence of pattern similarities in the original data set. To derive the pseudo-nearest-neighbor rule for missing data recovery, the concept of pseudonearest-neighbor and pseudo similarity is firstly introduced. Let x k and x l be two incomplete data vectors of an s-dimensional data set X={x 1,x 2,...,x n } R s. Then the order of the data elements are rearranged as follows [3]. (1) If the elements x kj and x lj (1 j s) both have their values missing, then they are placed
3 Z. Chen et al. /Journal of Computational Information Systems 11: 6 (2015) toward the right end of the vectors and the missing values are represented by the symbol. (2) If one of the elements x kj and x lj (1 j s) has its value missing, then it is placed toward the right end of the vectors and the missing value is represented by the symbol #. (3) If both of the elements x kj and x lj (1 j s) have their values non-missing, then their locations and values keep unchanged. The pseudo-similarity between x k and x l is defined as i=d x S p (x k, x l ) = d ( ki i=1 x li i=d x 2 i=d ki x 2 li i=1 i=1 ) (1) Note that it is similar to the cosine similarity when d = s. The measurement is actually a modification of the well-known cosine similarity, except that S p (x k, x l ) has a certain coefficient d. However, it gives more weight on the vectors which have more present elements. For a vector x k, if x l (l k) has the largest pseudo-similarity value, it means x k and x l are pseudo-nearestneighbors. The pseudo similarity between x k and x l is both effected by the angel between x k and x l and the coefficient d. The procedure of the pseudo-nearest-neighbor intervals method for missing data recovery is presented as follows. Algorithm 1 Pseudo-nearest-neighbor intervals method (PNNI) Input: an s-dimensional incomplete data set X={x 1,x 2,...,x n } R s Output: an s-dimensional interval-valued data set X={x 1, x 2,..., x n }, and j, k : x kj = [x kj, x+ kj ] Procedure: 1: for each datum x k (1 k n) in data set X 2: for each attribute value x kj (1 j s) in x k 3: if x kj is missing 4: compute S p (x k, x l ), where x lj is non-missing (1 l n, l k) 5: search x k s q pseudo-nearest-neighbors, which form a data set Y ={y 1,y 2,...,y q } R s 6: x kj = min{y 1j, y 2j,..., y qj } 7: x + kj = max{y 1j, y 2j,..., y qj } 8: else if x kj is non-missing 9: x kj = x kj 10: x + kj = x kj 11: end if 12: end for 13: end for According to the strategy of PNNI mentioned above, it s a key point to choose an appropriate value of q. If the value of q is too small, the PNNI acquired is likely to be a bias estimation. On the contrary, if the value of q is large enough, the clustering performance will be seriously affected. To put it simply, if the value of q is equivalent to the number of date in the data set, the range of PNNI is too large to represent the missing values properly. In this paper, it is assumed that only one non-missing attribute value is supposed to be missing randomly from the given
4 2142 Z. Chen et al. /Journal of Computational Information Systems 11: 6 (2015) incomplete data set each time, which changes the distribution of original incomplete attributes as little as possible. Then test whether the non-missing attribute fall within the corresponding PNNI by selected q = 2, 3,... The whole process should be repeated Z times, in which the value of Z equals to the number of missing attribute values. The selected q is located at the inflection point of the curve about the percent probability. Thus it can not only reduce the bias of PNNI estimation but also avoid the attribute confusion among clusters, which result from the excessive estimation of interval ranges. 3 Fcm Clustering Algorithm Based on Pseudo-nearestneighbor Intervals The FCM algorithm for incomplete data based on PNNI (FCM-PNNI) can be divided into two stages, first the missing attribute values are represented by appropriate intervals according to the PNNI determination approach, and then the intervals are clustered based on the fuzzy c-means algorithm for inter-valued data. The clustering algorithm is given as follows. Let X = {x 1, x 2,..., x n } be a set of n vectors in an s-dimensional interval-valued data set to be partitioned into c-(fuzzy) clusters, where x k = [x k1, x k2,..., x ks ], j, k : x kj = [x kj, x+ kj ] and x kj x+ kj. The clustering algorithm minimizes the following objective function c n c n J(U, V ) = (u m ik x k v i 2 2) = (u m ik[(x k v i )(x k v i )T +(x + k v+ i )(x+ k v+ i )T ]) (2) subject to i=1 i=1 c u ik = 1, k = 1, 2,..., n (3) i=1 The v i = [v i, v+ i ], 1 i c is the i-th interval cluster prototype. Following equations are used to minimize the above objective function [10]. n u ik = [ c t=1 v i = v + i = u m ik x k n u m ik n u m ik x+ k n u m ik, i = 1, 2,..., c (4), i = 1, 2,..., c (5) ( (x k v i )(x k v i )T + (x + k v+ i )(x+ k v+ i )T (x k v t )(x k v t ) T + (x + k v+ t )(x + k v+ t ) T ) 1 m 1 ] 1 And if k, h, 1 k n, 1 h c, j : x kj v hj, in other words, x k is within the convex hyper-polyhedron formed by v h, then x k can be considered to belong fully to the h-th cluster with membership 1, and belong to the other clusters with membership 0. Thus if i = h, then u ik = 1, otherwise, u ik = 0. For an s-dimensional incomplete data set X={x 1,x 2,...,x n } R s, the procedure of FCM-PNNI can be described as follows. (6)
5 Z. Chen et al. /Journal of Computational Information Systems 11: 6 (2015) Step 1 Choose the number of pseudo-nearest-neighbors q based on the determination strategy. Step 2 k, j, according to the strategy of PNNI, x kj can be represented by the interval [x kj, x+ kj ]. Step 3 Fix m, c and ε, then initialize the partition matrix U (0). Step 4 When the iteration index is l(l = 1, 2,...), calculate the matrix of cluster prototypes V (l) and V +(l) using Eq. (4) and Eq. (5) and U (l 1). Step 5 Update the partition matrix U (l) using Eq. (6) and V (l) and V +(l). Step 6 Compare U (l) to U (l 1) using U (l) U (l 1) ε. If true, then stop. Otherwise set l = l + 1 and return to Step 4. 4 Numerical Experiments 4.1 Data sets In the following experiments, we show the clustering performance of FCM-PNNI for three wellknown data sets: Iris, Bupa Liver Disorder and New Thyroid, which are often used as benchmarks to test the performance of clustering algorithms. The Iris data contains three types of Iris plants and each vector is described by 4 attributes. The Bupa Liver Disorder database consists of two classes: liver disorders and no liver disorders, and 345 vectors with 6 attributes included. The New Thyroid data contains three classes with 215 vectors and each vector has 5 attributes. In this paper, a certain number of attribute values are randomly selected and removed to generate incomplete data sets. That is, the missing attribute values are missing completely at random (MCAR). The random selection of missing attribute values is constrained so that [1]: (1) each original attribute vector x k retains at least one component; (2) each attribute has at least one value present in the incomplete data set x k. 4.2 Experimental results Table 1: The values of q on the three data sets with four different missing percentages %missing (NNI) %missing (PNNI) Data sets 5% 10% 15% 20% 5% 10% 15% 20% Iris Thyroid Bupa The performance of the given algorithm (FCM-PNNI) is compared with four versions of FCM (WDS-FCM, PDS-FCM, OCS-FCM, NPS-FCM) proposed by Hathaway and Bezdek [1] and the FCM-NNI algorithm advocated by Li [5]. Some experimental details notable are as follows. The
6 2144 Z. Chen et al. /Journal of Computational Information Systems 11: 6 (2015) corresponding stopping criterion is U (l) U (l 1) ε, where ε = 10 6 and the fuzzification parameter m is set to 2. To avoid the potential variation introduced by randomizing the membership grade matrix and the random distribution of the missing attribute values in the initialization, all the results shown in Tables 2-4 are obtained by the averages over 30 trails. The numbers of q on the three incomplete data sets with four different missing percentages are selected by the strategy given at the end of the Section 2. The optimal solutions in each row are presented by boldfaced, and the suboptimal solutions are underlined. 5% missing 10% missing 15% missing 20% missing NNI Accuracy NNI Accuracy NNI Accuracy Num. of NN (q) IRIS Num. of NN (q) Thyroid Num. of NN (q) BUPA Fig. 1: Change curves of averaged NNI accuracies of 30 trials PNNI Accuracy PNNI Accuracy PNNI Accuracy Num.of PNN(q) IRIS Num. of PNN (q) Thyroid Num. of PNN (q) BUPA Fig. 2: Change curves of averaged PNNI accuracies of 30 trials Table 2: Averaged results of 30 trials using incomplete Iris data sets Mean num. of iterations to termination Mean num. of misclassification WDS PDS OCS NPS NNI PNNI WDS PDS OCS NPS NNI PNNI Discussion (1) Overall comparison: In terms of misclassification error, FCM-PNNI always performs to be the best one or the better one. As for average number of iterations to terminate, FCM-PNNI needs minimal or subminimal numbers of iterations to achieve convergence in the three data sets expect
7 Z. Chen et al. /Journal of Computational Information Systems 11: 6 (2015) Table 3: Averaged results of 30 trials using incomplete Thyroid data sets Mean num. of iterations to termination Mean num. of misclassification WDS PDS OCS NPS NNI PNNI WDS PDS OCS NPS NNI PNNI Table 4: Averaged results of 30 trials using incomplete Bupa data sets Mean num. of iterations to termination Mean num. of misclassification WDS PDS OCS NPS NNI PNNI WDS PDS OCS NPS NNI PNNI for the 10% case of incomplete Bupa data set. However, clustering is often done off-line, the misclassification errors are more focused on than numbers of iterations to achieve convergence. (2) Comparison of FCM-PNNI and WDS-FCM, PDS-FCM, OCS-FCM, NPS-FCM: The WDS- FCM approach deletes all incomplete data, which results in a loss of information. The PDS- FCM scales partial distances by the reciprocal of the proportion of components used, while the distribution information of missing attribute values implicitly embodied in the other data is not taken into account. The OCS-FCM treats missing attribute values as variables that are to be optimized in order to get smallest possible value of the clustering objective function of FCM. The NPS-FCM, as a simple modification of OCS-FCM, replaces missing attribute values by the corresponding attribute value of the nearest prototype during each iteration. Compared with the four algorithms above, FCM-PNNI achieves interval estimations of missing attribute values by using the pseudo-nearest-neighbor information of incomplete data sufficiently. On one hand, the interval estimations represent the uncertainty of missing attribute values. On the other hand, the convex hyper-polyhedrons formed by interval prototypes can present the shape of clusters and sample distribution to some extent. (3) Comparison of FCM-PNNI and FCM-NNI: The difference between the two algorithms lies in similarity measurement in searching for similar samples (nearest-neighbors or pseudonearest-neighbors). While the strategy of NNI is based on the partial Euclidean distance and the PNNI is based on the partial cosine similarity. From Tables 2-4, it can be seen that FCM- PNNI generally performs better than FCM-NNI except for the 10% and 20% case of incomplete BUPA data sets. Compared with FCM-NNI, FCM-PNNI takes the angle between incomplete data and other data into consideration. In addition, the incomplete data set is unnormalized before recovery, thus captures the essence of pattern similarities in the original untouched data set without normalization. (4) The number of pseudo-nearest-neighbors q: According to the determination approach for q mentioned at the end of Section 2, 30 trials have been taken to eliminate the variation in the
8 2146 Z. Chen et al. /Journal of Computational Information Systems 11: 6 (2015) experiment. Fig. 2 shows the average percentage probability that non-missing attribute values fall within the corresponding PNNI (PNNI accuracy) based on different q. The selected q is located at the inflection point of the curve about the percent probability. The values of nearest-neighbors q are shown in Fig. 1, and the procedure is similar to the PNNI, and hence is omitted here. 5 Conclusion In this paper, a novel fuzzy c-means algorithm based on pseudo-nearest-neighbor intervals for incomplete data (FCM-PNNI) is given. The proposed algorithm takes into account the following characteristics: 1) pseudo similarity, which takes the angle between incomplete data and other data into consideration; 2) calculates the missing attribute values in the original untouched data set; 3) the implicit uncertainly of missing attribute values, which are represented by intervals. The experiments have shown the capability compared with the other five approaches at numbers of iterations to termination and misclassification error especially. References [1] Hathaway R J, Bezdek J C. Fuzzy c-means clustering of incomplete data [J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 2001, 31(5): [2] Huang X, Zhu Q. A pseudo-nearest-neighbor approach for missing data recovery on Gaussian random data sets [J]. Pattern Recognition Letters, 2002, 23(13): [3] Zhang D Q, Chen S C. Clustering incomplete data using kernel-based fuzzy c-means algorithm [J]. Neural Processing Letters, 2003, 18(3): [4] Lim C P, Leong J H, Kuan M M. A hybrid neural network system for pattern classification tasks with missing features [J]. IEEE transactions on pattern analysis and machine Intelligence, 2005, 27(4): [5] Li D, Gu H, Zhang L. A fuzzy c-means clustering algorithm based on nearest-neighbor intervals for incomplete data [J]. Expert Systems with Applications, 2010, 37(10): [6] Li D, Gu H, Zhang L. A hybrid genetic algorithm-fuzzy c-means approach for incomplete data clustering based on nearest-neighbor intervals [J]. Soft Computing, 2013, 17(10): [7] Zhang L, Wang B. Hybrid Clustering Methods for Incomplete Data with Nearest-neighbor Interval [J]. Journal of Computational Information Systems, 2014, 10(14): [8] Zhang S. Shell-neighbor method and its application in missing data imputation [J]. Applied Intelligence, 2011, 35(1): [9] Jahromi M Z, Parvinnia E, John R. A method of learning weighted similarity function to improve the performance of nearest neighbor [J]. Information Sciences, 2009, 179(17): [10] Yu C, Fan Z. A FCM clustering algorithm for multiple attribute information with interval numbers [J]. Xitong Gongcheng Xuebao, 2004, 19:
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 informationCluster Tendency Assessment for Fuzzy Clustering of Incomplete Data
EUSFLAT-LFA 2011 July 2011 Aix-les-Bains, France Cluster Tendency Assessment for Fuzzy Clustering of Incomplete Data Ludmila Himmelspach 1 Daniel Hommers 1 Stefan Conrad 1 1 Institute of Computer Science,
More informationNovel Intuitionistic Fuzzy C-Means Clustering for Linearly and Nonlinearly Separable Data
Novel Intuitionistic Fuzzy C-Means Clustering for Linearly and Nonlinearly Separable Data PRABHJOT KAUR DR. A. K. SONI DR. ANJANA GOSAIN Department of IT, MSIT Department of Computers University School
More informationFuzzy-Kernel Learning Vector Quantization
Fuzzy-Kernel Learning Vector Quantization Daoqiang Zhang 1, Songcan Chen 1 and Zhi-Hua Zhou 2 1 Department of Computer Science and Engineering Nanjing University of Aeronautics and Astronautics Nanjing
More informationHFCT: 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 informationFUZZY C-MEANS ALGORITHM BASED ON PRETREATMENT OF SIMILARITY RELATIONTP
Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications & Algorithms 14 (2007) 103-111 Copyright c 2007 Watam Press FUZZY C-MEANS ALGORITHM BASED ON PRETREATMENT OF SIMILARITY RELATIONTP
More informationKernel Based Fuzzy Ant Clustering with Partition validity
2006 IEEE International Conference on Fuzzy Systems Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 6-2, 2006 Kernel Based Fuzzy Ant Clustering with Partition validity Yuhua Gu and Lawrence
More informationUnsupervised Learning : Clustering
Unsupervised Learning : Clustering Things to be Addressed Traditional Learning Models. Cluster Analysis K-means Clustering Algorithm Drawbacks of traditional clustering algorithms. Clustering as a complex
More informationAn Empirical Study of Hoeffding Racing for Model Selection in k-nearest Neighbor Classification
An Empirical Study of Hoeffding Racing for Model Selection in k-nearest Neighbor Classification Flora Yu-Hui Yeh and Marcus Gallagher School of Information Technology and Electrical Engineering University
More informationSemi-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 informationFuzzy Ant Clustering by Centroid Positioning
Fuzzy Ant Clustering by Centroid Positioning Parag M. Kanade and Lawrence O. Hall Computer Science & Engineering Dept University of South Florida, Tampa FL 33620 @csee.usf.edu Abstract We
More informationTwo Algorithms of Image Segmentation and Measurement Method of Particle s Parameters
Appl. Math. Inf. Sci. 6 No. 1S pp. 105S-109S (2012) Applied Mathematics & Information Sciences An International Journal @ 2012 NSP Natural Sciences Publishing Cor. Two Algorithms of Image Segmentation
More informationEM algorithm with GMM and Naive Bayesian to Implement Missing Values
, pp.1-5 http://dx.doi.org/10.14257/astl.2014.46.01 EM algorithm with GMM and aive Bayesian to Implement Missing Values Xi-Yu Zhou 1, Joon S. Lim 2 1 I.T. College Gachon University Seongnam, South Korea,
More informationImproved Version of Kernelized Fuzzy C-Means using Credibility
50 Improved Version of Kernelized Fuzzy C-Means using Credibility Prabhjot Kaur Maharaja Surajmal Institute of Technology (MSIT) New Delhi, 110058, INDIA Abstract - Fuzzy c-means is a clustering algorithm
More informationCHAPTER 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 informationUsing a genetic algorithm for editing k-nearest neighbor classifiers
Using a genetic algorithm for editing k-nearest neighbor classifiers R. Gil-Pita 1 and X. Yao 23 1 Teoría de la Señal y Comunicaciones, Universidad de Alcalá, Madrid (SPAIN) 2 Computer Sciences Department,
More informationCOLOR image segmentation is a method of assigning
Proceedings of the Federated Conference on Computer Science and Information Systems pp. 1049 1054 DOI: 10.15439/2015F222 ACSIS, Vol. 5 Applying fuzzy clustering method to color image segmentation Omer
More informationLeaf Image Recognition Based on Wavelet and Fractal Dimension
Journal of Computational Information Systems 11: 1 (2015) 141 148 Available at http://www.jofcis.com Leaf Image Recognition Based on Wavelet and Fractal Dimension Haiyan ZHANG, Xingke TAO School of Information,
More informationFuzzy C-means Clustering with Temporal-based Membership Function
Indian Journal of Science and Technology, Vol (S()), DOI:./ijst//viS/, December ISSN (Print) : - ISSN (Online) : - Fuzzy C-means Clustering with Temporal-based Membership Function Aseel Mousa * and Yuhanis
More informationToward Part-based Document Image Decoding
2012 10th IAPR International Workshop on Document Analysis Systems Toward Part-based Document Image Decoding Wang Song, Seiichi Uchida Kyushu University, Fukuoka, Japan wangsong@human.ait.kyushu-u.ac.jp,
More informationGlobal Fuzzy C-Means with Kernels
Global Fuzzy C-Means with Kernels Gyeongyong Heo Hun Choi Jihong Kim Department of Electronic Engineering Dong-eui University Busan, Korea Abstract Fuzzy c-means (FCM) is a simple but powerful clustering
More informationCHAPTER 4 AN IMPROVED INITIALIZATION METHOD FOR FUZZY C-MEANS CLUSTERING USING DENSITY BASED APPROACH
37 CHAPTER 4 AN IMPROVED INITIALIZATION METHOD FOR FUZZY C-MEANS CLUSTERING USING DENSITY BASED APPROACH 4.1 INTRODUCTION Genes can belong to any genetic network and are also coordinated by many regulatory
More informationAn indirect tire identification method based on a two-layered fuzzy scheme
Journal of Intelligent & Fuzzy Systems 29 (2015) 2795 2800 DOI:10.3233/IFS-151984 IOS Press 2795 An indirect tire identification method based on a two-layered fuzzy scheme Dailin Zhang, Dengming Zhang,
More informationCollaborative 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 informationColour Image Segmentation Using K-Means, Fuzzy C-Means and Density Based Clustering
Colour Image Segmentation Using K-Means, Fuzzy C-Means and Density Based Clustering Preeti1, Assistant Professor Kompal Ahuja2 1,2 DCRUST, Murthal, Haryana (INDIA) DITM, Gannaur, Haryana (INDIA) Abstract:
More informationHybrid Models Using Unsupervised Clustering for Prediction of Customer Churn
Hybrid Models Using Unsupervised Clustering for Prediction of Customer Churn Indranil Bose and Xi Chen Abstract In this paper, we use two-stage hybrid models consisting of unsupervised clustering techniques
More informationSPATIAL BIAS CORRECTION BASED ON GAUSSIAN KERNEL FUZZY C MEANS IN CLUSTERING
SPATIAL BIAS CORRECTION BASED ON GAUSSIAN KERNEL FUZZY C MEANS IN CLUSTERING D.Vanisri Department of Computer Technology Kongu Engineering College, Perundurai, Tamilnadu, India vanisridd@gmail.com Abstract
More informationData Mining Approaches to Characterize Batch Process Operations
Data Mining Approaches to Characterize Batch Process Operations Rodolfo V. Tona V., Antonio Espuña and Luis Puigjaner * Universitat Politècnica de Catalunya, Chemical Engineering Department. Diagonal 647,
More informationFuzzy Segmentation. Chapter Introduction. 4.2 Unsupervised Clustering.
Chapter 4 Fuzzy Segmentation 4. Introduction. The segmentation of objects whose color-composition is not common represents a difficult task, due to the illumination and the appropriate threshold selection
More informationFeature-Guided K-Means Algorithm for Optimal Image Vector Quantizer Design
Journal of Information Hiding and Multimedia Signal Processing c 2017 ISSN 2073-4212 Ubiquitous International Volume 8, Number 6, November 2017 Feature-Guided K-Means Algorithm for Optimal Image Vector
More informationA PSO-based Generic Classifier Design and Weka Implementation Study
International Forum on Mechanical, Control and Automation (IFMCA 16) A PSO-based Generic Classifier Design and Weka Implementation Study Hui HU1, a Xiaodong MAO1, b Qin XI1, c 1 School of Economics and
More informationFace Recognition by Combining Kernel Associative Memory and Gabor Transforms
Face Recognition by Combining Kernel Associative Memory and Gabor Transforms Author Zhang, Bai-ling, Leung, Clement, Gao, Yongsheng Published 2006 Conference Title ICPR2006: 18th International Conference
More informationCHAPTER 4 FUZZY LOGIC, K-MEANS, FUZZY C-MEANS AND BAYESIAN METHODS
CHAPTER 4 FUZZY LOGIC, K-MEANS, FUZZY C-MEANS AND BAYESIAN METHODS 4.1. INTRODUCTION This chapter includes implementation and testing of the student s academic performance evaluation to achieve the objective(s)
More informationHigh Resolution Remote Sensing Image Classification based on SVM and FCM Qin LI a, Wenxing BAO b, Xing LI c, Bin LI d
2nd International Conference on Electrical, Computer Engineering and Electronics (ICECEE 2015) High Resolution Remote Sensing Image Classification based on SVM and FCM Qin LI a, Wenxing BAO b, Xing LI
More informationMultiple Classifier Fusion using k-nearest Localized Templates
Multiple Classifier Fusion using k-nearest Localized Templates Jun-Ki Min and Sung-Bae Cho Department of Computer Science, Yonsei University Biometrics Engineering Research Center 134 Shinchon-dong, Sudaemoon-ku,
More informationANALYSIS AND REASONING OF DATA IN THE DATABASE USING FUZZY SYSTEM MODELLING
ANALYSIS AND REASONING OF DATA IN THE DATABASE USING FUZZY SYSTEM MODELLING Dr.E.N.Ganesh Dean, School of Engineering, VISTAS Chennai - 600117 Abstract In this paper a new fuzzy system modeling algorithm
More informationFUZZY KERNEL K-MEDOIDS ALGORITHM FOR MULTICLASS MULTIDIMENSIONAL DATA CLASSIFICATION
FUZZY KERNEL K-MEDOIDS ALGORITHM FOR MULTICLASS MULTIDIMENSIONAL DATA CLASSIFICATION 1 ZUHERMAN RUSTAM, 2 AINI SURI TALITA 1 Senior Lecturer, Department of Mathematics, Faculty of Mathematics and Natural
More informationA Modified Fuzzy Min-Max Neural Network and Its Application to Fault Classification
A Modified Fuzzy Min-Max Neural Network and Its Application to Fault Classification Anas M. Quteishat and Chee Peng Lim School of Electrical & Electronic Engineering University of Science Malaysia Abstract
More informationFault Diagnosis of Wind Turbine Based on ELMD and FCM
Send Orders for Reprints to reprints@benthamscience.ae 76 The Open Mechanical Engineering Journal, 24, 8, 76-72 Fault Diagnosis of Wind Turbine Based on ELMD and FCM Open Access Xianjin Luo * and Xiumei
More informationGeneralized Fuzzy Clustering Model with Fuzzy C-Means
Generalized Fuzzy Clustering Model with Fuzzy C-Means Hong Jiang 1 1 Computer Science and Engineering, University of South Carolina, Columbia, SC 29208, US jiangh@cse.sc.edu http://www.cse.sc.edu/~jiangh/
More informationTraining-Free, Generic Object Detection Using Locally Adaptive Regression Kernels
Training-Free, Generic Object Detection Using Locally Adaptive Regression Kernels IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIENCE, VOL.32, NO.9, SEPTEMBER 2010 Hae Jong Seo, Student Member,
More informationA Fast Multivariate Nearest Neighbour Imputation Algorithm
A Fast Multivariate Nearest Neighbour Imputation Algorithm Norman Solomon, Giles Oatley and Ken McGarry Abstract Imputation of missing data is important in many areas, such as reducing non-response bias
More informationEqui-sized, Homogeneous Partitioning
Equi-sized, Homogeneous Partitioning Frank Klawonn and Frank Höppner 2 Department of Computer Science University of Applied Sciences Braunschweig /Wolfenbüttel Salzdahlumer Str 46/48 38302 Wolfenbüttel,
More informationFigure (5) Kohonen Self-Organized Map
2- KOHONEN SELF-ORGANIZING MAPS (SOM) - The self-organizing neural networks assume a topological structure among the cluster units. - There are m cluster units, arranged in a one- or two-dimensional array;
More informationA Modified Fuzzy C Means Clustering using Neutrosophic Logic
2015 Fifth International Conference on Communication Systems and Network Technologies A Modified Fuzzy C Means Clustering using Neutrosophic Logic Nadeem Akhtar Department of Computer Engineering Zakir
More informationClassification of Printed Chinese Characters by Using Neural Network
Classification of Printed Chinese Characters by Using Neural Network ATTAULLAH KHAWAJA Ph.D. Student, Department of Electronics engineering, Beijing Institute of Technology, 100081 Beijing, P.R.CHINA ABDUL
More informationPerformance Measure of Hard c-means,fuzzy c-means and Alternative c-means Algorithms
Performance Measure of Hard c-means,fuzzy c-means and Alternative c-means Algorithms Binoda Nand Prasad*, Mohit Rathore**, Geeta Gupta***, Tarandeep Singh**** *Guru Gobind Singh Indraprastha University,
More informationMulti prototype fuzzy pattern matching for handwritten character recognition
Multi prototype fuzzy pattern matching for handwritten character recognition MILIND E. RANE, DHABE P. S AND J. B. PATIL Dept. of Electronics and Computer, R.C. Patel Institute of Technology, Shirpur, Dist.
More informationUsing Natural Clusters Information to Build Fuzzy Indexing Structure
Using Natural Clusters Information to Build Fuzzy Indexing Structure H.Y. Yue, I. King and K.S. Leung Department of Computer Science and Engineering The Chinese University of Hong Kong Shatin, New Territories,
More informationMethods for Intelligent Systems
Methods for Intelligent Systems Lecture Notes on Clustering (II) Davide Eynard eynard@elet.polimi.it Department of Electronics and Information Politecnico di Milano Davide Eynard - Lecture Notes on Clustering
More informationGlobal Journal of Engineering Science and Research Management
A NOVEL HYBRID APPROACH FOR PREDICTION OF MISSING VALUES IN NUMERIC DATASET V.B.Kamble* 1, S.N.Deshmukh 2 * 1 Department of Computer Science and Engineering, P.E.S. College of Engineering, Aurangabad.
More informationApplication of Geometry Rectification to Deformed Characters Recognition Liqun Wang1, a * and Honghui Fan2
6th International Conference on Electronic, Mechanical, Information and Management (EMIM 2016) Application of Geometry Rectification to Deformed Characters Liqun Wang1, a * and Honghui Fan2 1 School of
More informationResearch Article K-Nearest Neighbor Intervals Based AP Clustering Algorithm for Large Incomplete Data
Mathematical Problems in Engineering Volume 2015, Article ID 535932, 9 pages http://dx.doi.org/10.1155/2015/535932 Research Article K-Nearest Neighbor Intervals Based AP Clustering Algorithm for Large
More informationA Robust Fuzzy Local Information C-means Clustering Algorithm
2 A Robust Fuzzy Local Information C-means Clustering Algorithm Stelios Krinidis and Vassilios Chatzis Abstract This paper presents a variation of fuzzy c-means FCM) algorithm that provides image clustering.
More informationS. Sreenivasan Research Scholar, School of Advanced Sciences, VIT University, Chennai Campus, Vandalur-Kelambakkam Road, Chennai, Tamil Nadu, India
International Journal of Civil Engineering and Technology (IJCIET) Volume 9, Issue 10, October 2018, pp. 1322 1330, Article ID: IJCIET_09_10_132 Available online at http://www.iaeme.com/ijciet/issues.asp?jtype=ijciet&vtype=9&itype=10
More informationDiagonal Principal Component Analysis for Face Recognition
Diagonal Principal Component nalysis for Face Recognition Daoqiang Zhang,2, Zhi-Hua Zhou * and Songcan Chen 2 National Laboratory for Novel Software echnology Nanjing University, Nanjing 20093, China 2
More informationIterative Removing Salt and Pepper Noise based on Neighbourhood Information
Iterative Removing Salt and Pepper Noise based on Neighbourhood Information Liu Chun College of Computer Science and Information Technology Daqing Normal University Daqing, China Sun Bishen Twenty-seventh
More informationWrapper Feature Selection using Discrete Cuckoo Optimization Algorithm Abstract S.J. Mousavirad and H. Ebrahimpour-Komleh* 1 Department of Computer and Electrical Engineering, University of Kashan, Kashan,
More informationA Modular k-nearest Neighbor Classification Method for Massively Parallel Text Categorization
A Modular k-nearest Neighbor Classification Method for Massively Parallel Text Categorization Hai Zhao and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University, 1954
More informationAvailable online Journal of Scientific and Engineering Research, 2019, 6(1): Research Article
Available online www.jsaer.com, 2019, 6(1):193-197 Research Article ISSN: 2394-2630 CODEN(USA): JSERBR An Enhanced Application of Fuzzy C-Mean Algorithm in Image Segmentation Process BAAH Barida 1, ITUMA
More information7. Nearest neighbors. Learning objectives. Centre for Computational Biology, Mines ParisTech
Foundations of Machine Learning CentraleSupélec Paris Fall 2016 7. Nearest neighbors Chloé-Agathe Azencot Centre for Computational Biology, Mines ParisTech chloe-agathe.azencott@mines-paristech.fr Learning
More informationKeywords Clustering, Goals of clustering, clustering techniques, clustering algorithms.
Volume 3, Issue 5, May 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Survey of Clustering
More informationCHAPTER 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 informationA 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 informationDetecting Clusters and Outliers for Multidimensional
Kennesaw State University DigitalCommons@Kennesaw State University Faculty Publications 2008 Detecting Clusters and Outliers for Multidimensional Data Yong Shi Kennesaw State University, yshi5@kennesaw.edu
More informationA Two-phase Distributed Training Algorithm for Linear SVM in WSN
Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science (EECSS 015) Barcelona, Spain July 13-14, 015 Paper o. 30 A wo-phase Distributed raining Algorithm for Linear
More informationCOMPARATIVE ANALYSIS OF PARALLEL K MEANS AND PARALLEL FUZZY C MEANS CLUSTER ALGORITHMS
COMPARATIVE ANALYSIS OF PARALLEL K MEANS AND PARALLEL FUZZY C MEANS CLUSTER ALGORITHMS 1 Juby Mathew, 2 Dr. R Vijayakumar Abstract: In this paper, we give a short review of recent developments in clustering.
More informationAn explicit feature control approach in structural topology optimization
th World Congress on Structural and Multidisciplinary Optimisation 07 th -2 th, June 205, Sydney Australia An explicit feature control approach in structural topology optimization Weisheng Zhang, Xu Guo
More informationKeywords - Fuzzy rule-based systems, clustering, system design
CHAPTER 7 Application of Fuzzy Rule Base Design Method Peter Grabusts In many classification tasks the final goal is usually to determine classes of objects. The final goal of fuzzy clustering is also
More informationRule Based Learning Systems from SVM and RBFNN
Rule Based Learning Systems from SVM and RBFNN Haydemar Núñez 1, Cecilio Angulo 2 and Andreu Català 2 1 Laboratorio de Inteligencia Artificial, Universidad Central de Venezuela. Caracas, Venezuela hnunez@strix.ciens.ucv.ve
More information9.1. K-means Clustering
424 9. MIXTURE MODELS AND EM Section 9.2 Section 9.3 Section 9.4 view of mixture distributions in which the discrete latent variables can be interpreted as defining assignments of data points to specific
More informationA Proposed Model For Forecasting Stock Markets Based On Clustering Algorithm And Fuzzy Time Series
Journal of Multidisciplinary Engineering Science Studies (JMESS) A Proposed Model For Forecasting Stock Markets Based On Clustering Algorithm And Fuzzy Time Series Nghiem Van Tinh Thai Nguyen University
More informationChapter 7 UNSUPERVISED LEARNING TECHNIQUES FOR MAMMOGRAM CLASSIFICATION
UNSUPERVISED LEARNING TECHNIQUES FOR MAMMOGRAM CLASSIFICATION Supervised and unsupervised learning are the two prominent machine learning algorithms used in pattern recognition and classification. In this
More informationECLT 5810 Clustering
ECLT 5810 Clustering What is Cluster Analysis? Cluster: a collection of data objects Similar to one another within the same cluster Dissimilar to the objects in other clusters Cluster analysis Grouping
More informationECLT 5810 Clustering
ECLT 5810 Clustering What is Cluster Analysis? Cluster: a collection of data objects Similar to one another within the same cluster Dissimilar to the objects in other clusters Cluster analysis Grouping
More informationFuzzy C-MeansC. By Balaji K Juby N Zacharias
Fuzzy C-MeansC By Balaji K Juby N Zacharias What is Clustering? Clustering of data is a method by which large sets of data is grouped into clusters of smaller sets of similar data. Example: The balls of
More informationSwarm 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 informationTexture Image Segmentation using FCM
Proceedings of 2012 4th International Conference on Machine Learning and Computing IPCSIT vol. 25 (2012) (2012) IACSIT Press, Singapore Texture Image Segmentation using FCM Kanchan S. Deshmukh + M.G.M
More informationThe Comparative Study of Machine Learning Algorithms in Text Data Classification*
The Comparative Study of Machine Learning Algorithms in Text Data Classification* Wang Xin School of Science, Beijing Information Science and Technology University Beijing, China Abstract Classification
More informationAvailable Online through
Available Online through www.ijptonline.com ISSN: 0975-766X CODEN: IJPTFI Research Article ANALYSIS OF CT LIVER IMAGES FOR TUMOUR DIAGNOSIS BASED ON CLUSTERING TECHNIQUE AND TEXTURE FEATURES M.Krithika
More informationESSENTIALLY, system modeling is the task of building
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, VOL. 53, NO. 4, AUGUST 2006 1269 An Algorithm for Extracting Fuzzy Rules Based on RBF Neural Network Wen Li and Yoichi Hori, Fellow, IEEE Abstract A four-layer
More informationAn Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid
An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid Demin Wang 2, Hong Zhu 1, and Xin Liu 2 1 College of Computer Science and Technology, Jilin University, Changchun
More informationTemperature Calculation of Pellet Rotary Kiln Based on Texture
Intelligent Control and Automation, 2017, 8, 67-74 http://www.scirp.org/journal/ica ISSN Online: 2153-0661 ISSN Print: 2153-0653 Temperature Calculation of Pellet Rotary Kiln Based on Texture Chunli Lin,
More informationLEARNING WEIGHTS OF FUZZY RULES BY USING GRAVITATIONAL SEARCH ALGORITHM
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 4, April 2013 pp. 1593 1601 LEARNING WEIGHTS OF FUZZY RULES BY USING GRAVITATIONAL
More informationAn adjustable p-exponential clustering algorithm
An adjustable p-exponential clustering algorithm Valmir Macario 12 and Francisco de A. T. de Carvalho 2 1- Universidade Federal Rural de Pernambuco - Deinfo Rua Dom Manoel de Medeiros, s/n - Campus Dois
More informationEstimating Error-Dimensionality Relationship for Gene Expression Based Cancer Classification
1 Estimating Error-Dimensionality Relationship for Gene Expression Based Cancer Classification Feng Chu and Lipo Wang School of Electrical and Electronic Engineering Nanyang Technological niversity Singapore
More informationNeural Network Weight Selection Using Genetic Algorithms
Neural Network Weight Selection Using Genetic Algorithms David Montana presented by: Carl Fink, Hongyi Chen, Jack Cheng, Xinglong Li, Bruce Lin, Chongjie Zhang April 12, 2005 1 Neural Networks Neural networks
More informationBased on Raymond J. Mooney s slides
Instance Based Learning Based on Raymond J. Mooney s slides University of Texas at Austin 1 Example 2 Instance-Based Learning Unlike other learning algorithms, does not involve construction of an explicit
More informationAn Algorithm based on SURF and LBP approach for Facial Expression Recognition
ISSN: 2454-2377, An Algorithm based on SURF and LBP approach for Facial Expression Recognition Neha Sahu 1*, Chhavi Sharma 2, Hitesh Yadav 3 1 Assistant Professor, CSE/IT, The North Cap University, Gurgaon,
More informationVideo Inter-frame Forgery Identification Based on Optical Flow Consistency
Sensors & Transducers 24 by IFSA Publishing, S. L. http://www.sensorsportal.com Video Inter-frame Forgery Identification Based on Optical Flow Consistency Qi Wang, Zhaohong Li, Zhenzhen Zhang, Qinglong
More information7. Nearest neighbors. Learning objectives. Foundations of Machine Learning École Centrale Paris Fall 2015
Foundations of Machine Learning École Centrale Paris Fall 2015 7. Nearest neighbors Chloé-Agathe Azencott Centre for Computational Biology, Mines ParisTech chloe agathe.azencott@mines paristech.fr Learning
More informationCreating Time-Varying Fuzzy Control Rules Based on Data Mining
Research Journal of Applied Sciences, Engineering and Technology 4(18): 3533-3538, 01 ISSN: 040-7467 Maxwell Scientific Organization, 01 Submitted: April 16, 01 Accepted: May 18, 01 Published: September
More informationCluster Analysis. Ying Shen, SSE, Tongji University
Cluster Analysis Ying Shen, SSE, Tongji University Cluster analysis Cluster analysis groups data objects based only on the attributes in the data. The main objective is that The objects within a group
More informationDigital Image Steganography Techniques: Case Study. Karnataka, India.
ISSN: 2320 8791 (Impact Factor: 1.479) Digital Image Steganography Techniques: Case Study Santosh Kumar.S 1, Archana.M 2 1 Department of Electronicsand Communication Engineering, Sri Venkateshwara College
More informationUniversity of Florida CISE department Gator Engineering. Clustering Part 2
Clustering Part 2 Dr. Sanjay Ranka Professor Computer and Information Science and Engineering University of Florida, Gainesville Partitional Clustering Original Points A Partitional Clustering Hierarchical
More informationArgha Roy* Dept. of CSE Netaji Subhash Engg. College West Bengal, India.
Volume 3, Issue 3, March 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Training Artificial
More informationData Cleaning and Prototyping Using K-Means to Enhance Classification Accuracy
Data Cleaning and Prototyping Using K-Means to Enhance Classification Accuracy Lutfi Fanani 1 and Nurizal Dwi Priandani 2 1 Department of Computer Science, Brawijaya University, Malang, Indonesia. 2 Department
More informationECM 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 informationFuzzy Hamming Distance in a Content-Based Image Retrieval System
Fuzzy Hamming Distance in a Content-Based Image Retrieval System Mircea Ionescu Department of ECECS, University of Cincinnati, Cincinnati, OH 51-3, USA ionescmm@ececs.uc.edu Anca Ralescu Department of
More informationCHAPTER 7 A GRID CLUSTERING ALGORITHM
CHAPTER 7 A GRID CLUSTERING ALGORITHM 7.1 Introduction The grid-based methods have widely been used over all the algorithms discussed in previous chapters due to their rapid clustering results. In this
More information