• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.724-730
• /
• 1993

Most of clustering methods usually employ the center of a cluster to assign the input data into a cluster. When the shape of a cluster could not be easily represented by the center of cluster, however, 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. And membership functions are used to represent how much input data belong to subclusters. Then the position of each subcluster is adoptively corrected 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.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.118-124
• /
• 2004

This paper proposes an approach to deriving a fuzzy classifier based on evolutionary supervised clustering, which identifies the optimal clusters necessary to classify classes. The clusters are formed by multi-dimensional weighted Euclidean distance, which allows clusters of varying shapes and sizes. A cluster induces a Gaussian fuzzy antecedent set with unique variance in each dimension, which reflects the tightness of the cluster. The fuzzy classifier is com-posed of as many classification rules as classes. The clusters identified for each class constitute fuzzy sets, which are joined by an "and" connective in the antecedent part of the corresponding rule. The approach is evaluated using six data sets. The comparative results with different classifiers are given.are given.

• Journal of Korean Society for Quality Management
• /
• v.24 no.1
• /
• pp.126-136
• /
• 1996

In multi-item production system, GT(Group Technology) is used effectively in order to cluster various parts into groups. GT is based on clustering parts which have similar features, and these features are classified into two properties, namely crisp(quantitative) feature and fuzzy(qualitative) feature. Especially, many difficult problems are often faced that have to evaluate the properties of parts with the crisp and fuzzy feature together. As the basis of determining the similarity of inter-parts, in this method, one aggregate value is calculated on each part. However, because the above aggregate value is only gained from simple additive weighted sum, there is one problem in this method that has been handled the combination effect of inter-parts. For these reasons, in this paper, a proposed method is suggested for representing combination effect in order to cluster parts that have crisp and fuzzy properties into groups using ${\lambda}$-fuzzy measure and fuzzy integral.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.16-19
• /
• 2001

This paper presents a type-2 fuzzy C-means (FCM) algorithm that is an extension of the conventional fuzzy C-means algorithm. In our proposed method, the membership values for each pattern are extended as type-2 fuzzy memberships by assigning membership grades to the type-1 memberships. In doing so, cluster centers that are estimated by type-2 memberships may converge to a more desirable location than cluster centers obtained by a type-1 FCM method in the presence of noise.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.191-196
• /
• 1997

Fuzzy clustering has been playing an important role in solving many problems. Fuzzy c-Means(FCM) algorithm is most frequently used for fuzzy clustering. But some fixed point of FCM algorithm, know as Tucker's counter example, is not a reasonable solution. Moreover, FCM algorithm is impossible to perform the on-line learning since it is basically a batch learning scheme. This paper presents unsupervised learning networks as an attempt to improve shortcomings of the conventional clustering algorithm. This model integrates optimization function of FCM algorithm into unsupervised learning networks. The learning rule of the proposed scheme is a result of formal derivation based on the gradient descent procedure of a fuzzy objective function. Using the result of formal derivation, two algorithms of fuzzy cluster analysis, the batch learning version and on-line learning version, are devised. They are tested on several data sets and compared with FCM. The experimental results show that the proposed algorithms find out the reasonable solution on Tucker's counter example.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.5
• /
• pp.513-519
• /
• 2000

In this paper, we investigate some properties of fuzzy r-cluster points and fuzzy r-limit points in smooth fuzzy topological spaces. We define fuzzy r-convergent nets and investigate some of their properties.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.255-263
• /
• 2006

In this paper, we introduce the concepts of ${\gamma}$-fuzzy feebly open and ${\gamma}$-fuzzy feebly closed sets in Sostak's fuzzy topological spaces and by using them, we explain the notions of ${\gamma}$-fuzzy F-closed spaces. Also, we give some characterization of ${\gamma}$-fuzzy F-closedness in terms of fuzzy filterbasis and ${\gamma}$-fuzzy feebly-${\theta}$-cluster points.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.455-460
• /
• 2003

A new cluster validity index is proposed that determines the optimal partition and optimal number of clusters for fuzzy partitions obtained from the fuzzy c-means algorithm. The proposed validity index exploits an overlap measure and a separation measure between clusters. The overlap measure is obtained by computing an inter-cluster overlap. The separation measure is obtained by computing a distance between fuzzy clusters. A good fuzzy partition is expected to have a low degree of overlap and a larger separation distance. Testing of the proposed index and nine previously formulated indexes on well-known data sets showed the superior effectiveness and reliability of the proposed index in comparison to other indexes.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.4
• /
• pp.334-340
• /
• 2002

This paper proposes a self-organizing fuzzy modeling which can create a new hyperplane-shaped cluster by applying multiple regression to input/output data with relatively large fuzzy entropy, add the new cluster to fuzzy rule base and adjust parameters of the fuzzy model in repetition. Tn the coarse tuning, weighted recursive least squared algorithm and fuzzy C-regression model clustering are used and in the fine tuning, gradient descent algorithm is used to adjust parameters of the fuzzy model precisely And learning rates are optimized by utilizing meiosis-genetic algorithm. To check the effectiveness and feasibility of the suggested algorithm, four representative examples for system identification are examined and the performance of the identified fuzzy model is demonstrated in comparison with that of the conventional fuzzy models.

• The KIPS Transactions:PartB
• /
• v.13B no.5 s.108
• /
• pp.541-546
• /
• 2006

Data Mining is the process of finding hidden patterns inside a large data set. Cluster analysis has been used as a popular technique for data mining. It is a fundamental process of data analysis and it has been Playing an important role in solving many problems in pattern recognition and image processing. If fuzzy cluster analysis is to make a significant contribution to engineering applications, much more attention must be paid to fundamental decision on the number of clusters in data. It is related to cluster validity problem which is how well it has identified the structure that Is present in the data. In this paper, we design an adaptive data mining model using fuzzy performance measures. It discovers clusters through an unsupervised neural network model based on a fuzzy objective function and evaluates clustering results by a fuzzy performance measure. We also present the experimental results on newsgroup data. They show that the proposed model can be used as a document classifier.