• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.928-938
• /
• 2008

This study presents an approach for approximation an unknown function from a numerical data set based on the synthesis of a neuro-fuzzy model. An adaptive input data space parting method, which is used for building hyperbox-shaped clusters in the input data space, is proposed. Each data cluster is implemented here as a fuzzy set using a membership function MF with a hyperbox core that is constructed from a min vertex and a max vertex. The focus of interest in proposed approach is to increase degree of fit between characteristics of the given numerical data set and the established fuzzy sets used to approximate it. A new cutting procedure, named NCP, is proposed. The NCP is an adaptive cutting procedure using a pure function $\Psi$ and a penalty function $\tau$ for direction the input data space parting process. New algorithms named CSHL, HLM1 and HLM2 are presented. The first new algorithm, CSHL, built based on the cutting procedure NCP, is used to create hyperbox-shaped data clusters. The second and the third algorithm are used to establish adaptive neuro- fuzzy inference systems. A series of numerical experiments are performed to assess the efficiency of the proposed approach.

• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.761-769
• /
• 2012

In this paper, a setting method of initial cluster centers and color image segmentation using superpixels and Fuzzy C-means(FCM) algorithm is proposed. Generally, the FCM can be widely used to segment color images, and an element is assigned to any cluster with each membership values in the FCM. However the algorithm has a problem of local convergence by determining the initial cluster centers. So the selection of initial cluster centers is very important, we proposed an effective method to determine the initial cluster centers using superpixels. The superpixels can be obtained by grouping of some pixels having similar characteristics from original image, and it is projected $La^*b^*$ feature space to obtain the initial cluster centers. The proposed method can be speeded up because number of superpixels are extremely smaller than pixels of original image. To evaluate the proposed method, several color images are used for computer simulation, and we know that the proposed method is superior to the conventional algorithm by the experimental results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.3
• /
• pp.81-88
• /
• 1996

Cluster analysis is based on partitioning a collection of data points into a number of clusters, where the data points in side a cluster have a certain degree of similarity and it is a fundamental process of data analysis. So, it has been playing an important role in solving many problems in pattern recognition and image processing. For these many clustering algorithms depending on distance criteria have been developed and fuzzy set theory has been introduced to reflect the description of real data, where boundaries might be fuzzy. If fuzzy cluster analysis is tomake a significant contribution to engineering applications, much more attention must be paid to fundamental questions of cluster validity problem which is how well it has identified the structure that is present in the data. Several validity functionals such as partition coefficient, claasification entropy and proportion exponent, have been used for measuring validity mathematically. But the issue of cluster validity involves complex aspects, it is difficult to measure it with one measuring function as the conventional study. In this paper, we propose four performance indices and the way to measure the quality of clustering formed by given learning strategy.

• International journal of advanced smart convergence
• /
• v.5 no.1
• /
• pp.66-72
• /
• 2016

In this paper, we proposed the clustering algorithm using fuzzy inference system for improving adaptability the cluster head selection of TEEN. The stochastic selection method cannot guarantee available of cluster head. Furthermore, because the formation of clusters is not optimized, the network lifetime is impeded. To improve this problem, we propose the algorithm that gathers attributes of sensor node to evaluate probability to be cluster head.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.2
• /
• pp.58-69
• /
• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1692-1711
• /
• 2016

Energy is a scarce resource in wireless sensor networks (WSNs). A variety of clustering protocols for WSNs, such as the zone-based stable election protocol-enhanced (ZSEP-E), have been developed for energy optimization. The ZSEP-E is a heterogeneous zone-based clustering protocol that focuses on unbalanced energy consumption with parallel formation of clusters in zones and election of cluster heads (CHs). Most ZSEP-E research has assumed probabilistic election of CHs in the zones by considering the maximum residual energy of nodes. However, studies of the diverse CH election parameters are lacking. We investigated the performance of the ZSEP-E in such scenarios using a fuzzy logic approach based on three descriptors, i.e., energy, density, and the distance from the node to the base station. We proposed an efficient ZSEP-E scheme to adapt and elect CHs in zones using fuzzy variables and evaluated its performance for different energy levels in the zones.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.2
• /
• pp.138-143
• /
• 2006

In this paper, we have presented a Sequential Agglomerative Hierarchical Nested (SAHN) algorithm-based data clustering method in fuzzy inference system to achieve optimal performance of fuzzy model. SAHN-based algorithm is used to give possible range of number of clusters with cluster centers for the system identification. The axes of membership functions of this fuzzy model are optimized by using cluster centers obtained from clustering method and the consequence parameters of the fuzzy model are identified by standard least square method. Finally, in this paper, we have observed our model's output performance using the Box and Jenkins's gas furnace data and Sugeno's non-linear process data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.608-615
• /
• 2006

This paper proposes a fuzzy model tree consisting of local linear models using fuzzy cluster for data modeling. First, cluster centers are calculated by fuzzy clustering method using all input and output attributes. And then, linear models are constructed at internal nodes with fuzzy membership values between centers and input attributes. The expansion of internal node is determined by comparing errors calculated in parent node with ones in child node, respectively. As a final step, data prediction is performed with a linear model having the highest fuzzy membership value between input attributes and cluster centers in leaf nodes. 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 model tree and artificial neural networks.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.431-434
• /
• 2003

In this paper we introduce a modified objective function for fuzzy c-means clustering with logistic regression model in the presence of noise cluster. The logistic regression model is commonly used to describe the effect of one or several explanatory variables on a binary response variable. In real application there is very often no sharp boundary between clusters so that fuzzy clustering is often better suited for the data.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.199-210
• /
• 1994

Most of clustering methods usually employ a center or predefined shape of a cluster to assign the input data into the cluster. When there is no information about data set, it is impossible to predict how many clusters are to be or what shape clusters take. (the shape of clusters could not be easily represented by the center or predefined shape of clusters) Therefore, it is difficult to assign input data into a proper cluster using previous methods. In this paper, to overcome such a difficulty a cluster is to be represented as a collection of several subclusters representing boundary of the cluster. And membership functions are used to represent how much input data bllongs to subclusters. Then the position of the nearest subcluster is adaptively corrected for expansion of cluster, which the subcluster belongs to by use of a competitive learning neural network. To show the validity of the proposed method a numerical example is illustrated where FMMC(Fuzzy Min-Max Clustering) algorithm is compared with the proposed method.