• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.15-20
• /
• 2015

In this paper, we propose a modified fuzzy clustering algorithm which can overcome the center deviation due to the Euclidean distance commonly used in fuzzy clustering. Among fuzzy clustering methods, Fuzzy C-Means (FCM) is the most well-known clustering algorithm and has been widely applied to various problems successfully. In FCM, however, cluster centers tend leaning to high density clusters because the Euclidean distance measure forces high density cluster to make more contribution to clustering result. Proposed is an enhanced algorithm which modifies the objective function of FCM by adding a center-scattering term to make centers not to be close due to the cluster density. The proposed method converges more to real centers with small number of iterations compared to FCM. All the strengths can be verified with experimental results.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.165-170
• /
• 2011

Due to advances in hardware performance, user-friendly interfaces are becoming one of the major concerns in information systems. Linguistic conversation is a very natural way of human communications. Fuzzy techniques have been employed to liaison the discrepancy between the qualitative linguistic terms and quantitative computerized data. This paper deals with linguistic queries using clustering results on data sets, which are intended to retrieve the close clusters or distant clusters from the clustering results. In order to support such queries, a fuzzy technique-based method is proposed. The method introduces distance membership functions, namely, close and distant membership functions which transform the metric distance between two objects into the degree of closeness or farness, respectively. In order to measure the degree of closeness or farness between two clusters, both cluster closeness measure and cluster farness measure which incorporate distance membership function and cluster memberships are considered. For the flexibility of clustering, fuzzy clusters are assumed to be formed. This allows us to linguistically query close or distant clusters by constructing fuzzy relation based on the measures.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.41-47
• /
• 2008

Cluster based fuzzy model tree has certain drawbacks to decrease performance of testinB data when over-fitting of training data exists. To reduce the sensitivity of performance due to over-fitting problem, we proposed a modified cluster based fuzzy model tree with node information. To construct model tree, cluster centers are calculated by fuzzy clustering method using all input and output attributes in advance. And then, linear models are constructed at internal nodes with fuzzy membership values between centers and input attributes. In the prediction step, membership values are calculated by using fuzzy distance between input attributes and all centers that passing the nodes from root to leaf nodes. Finally, data prediction is performed by the weighted average method with the linear models and fuzzy membership values. To show the effectiveness of the proposed method, we have applied our method to various dataset. Under various experiments, our proposed method shows better performance than conventional cluster based fuzzy model tree.

• Journal of Digital Convergence
• /
• v.14 no.1
• /
• pp.203-209
• /
• 2016

In this paper, we introduce a fuzzy inference systems for nonlinear inference using fuzzy cluster. Typically, the generation of fuzzy rules for nonlinear inference causes the problem that the number of fuzzy rules increases exponentially if the input vectors increase. To handle this problem, the fuzzy rules of fuzzy model are designed by dividing the input vector space in the scatter form using fuzzy clustering algorithm which expresses fuzzy cluster. From this method, complex nonlinear process can be modeled. The premise part of the fuzzy rules is determined by means of FCM clustering algorithm with fuzzy clusters. The consequence part of the fuzzy rules have four kinds of polynomial functions and the coefficient parameters of each rule are estimated by using the standard least-squares method. And we use the data widely used in nonlinear process for the performance and the nonlinear characteristics of the nonlinear process. Experimental results show that the non-linear inference is possible.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.6
• /
• pp.557-563
• /
• 2000

We introduce r-fuzzy $\delta$-cluster ($\theta$-cluster) points and r-fuzzy $\delta$-closure ($\theta$-closure) sets in smooth fuzzy topological spaces in a view of the definition of A.P. Sostak [13]. We study some properties of them.

• Speech Sciences
• /
• v.10 no.4
• /
• pp.159-166
• /
• 2003

To reduce the high dimensionality required for training of feature vectors in speaker identification, we propose an efficient GMM based on local PCA with Fuzzy clustering. The proposed method firstly partitions the data space into several disjoint clusters by fuzzy clustering, and then performs PCA using the fuzzy covariance matrix in each cluster. Finally, the GMM for speaker is obtained from the transformed feature vectors with reduced dimension in each cluster. Compared to the conventional GMM with diagonal covariance matrix, the proposed method needs less storage and shows faster result, under the same performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1039-1042
• /
• 2008

Wireless sensor networks enable pervasive, ubiquitous, and seamless communication with the physical world. In this paper, we are concerned for clustering sensors into groups, so that sensors communicate information only to cluster heads and then the cluster heads communicate the aggregated information to the sink node, that the network can save energy. In this paper, we propose the algorithm for electing the cluster head and fuzzy registration of cluster head in a dynamic cluster wireless sensor networks. For making decision for clustering we will use fuzzy logic system. In simulation, we could achieve power regulation of total consumption and also the stabilization of the networks energy efficiency.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.2
• /
• pp.44-57
• /
• 1995

In this paper GFI (Generalized Fuzzy Isodata) and FI (Fuzzy Isodata) algorithms are studied and applied to the tire tread pattern classification problem. GFI algorithm which repeatedly grouping the partitioned cluster depending on the fuzzy partition matrix is general form of GI algorithm. In the constructing the binary tree using GFI algorithm cluster validity, namely, whether partitioned cluster is feasible or not is checked and construction of the binary tree is obtained by FDH clustering algorithm. These algorithms show the good performance in selecting the prototypes of each patterns and classifying patterns. Directions of edge in the preprocessed image of tire tread pattern are selected as features of pattern. These features are thought to have useful information which well represents the characteristics of patterns.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.1 no.3
• /
• pp.4-19
• /
• 1991

In this paper, we propose a fuzzy neural network pattern classifier utilizing fuzzy information. This system works without any a priori information about the number of clusters or cluster centers. It classifies each input according to the distance between the weights and the normalized input using Bezdek's [1] fuzzy membership value equation. This model returns the correct membership value for each input vector and find several cluster centers. Some experimental studies of comparison with other algorithms will be presented for sample data sets.

• Korean Journal of Mathematics
• /
• v.10 no.1
• /
• pp.5-10
• /
• 2002

In this paper, we investigate the prefilter base on a fuzzy set and fuzzy net ${\varphi}$ on the fuzzy topological space (X,${\delta}$). And we show that the prefilter base $\mathcal{B}({\varphi})$ determines by the fuzzy net ${\varphi}$ converge to a fuzzy point $p$ iff the fuzzy net ${\varphi}$ converge to a fuzzy point $p$. Also we prove that if the prefilter base $\mathcal{B}$ converge to a fuzzy point $p$, then the $\mathcal{B}$ has the cluster point $p$.