• Journal of Korean Neurosurgical Society
• /
• 제52권5호
• /
• pp.466-471
• /
• 2012

Objective : The aim of this study was to devise an objective clustering method for magnetoencephalography (MEG) interictal spike sources, and to identify the prognostic value of the new clustering method in adult epilepsy patients with cortical dysplasia (CD). Methods : We retrospectively analyzed 25 adult patients with histologically proven CD, who underwent MEG examination and surgical resection for intractable epilepsy. The mean postoperative follow-up period was 3.1 years. A hierarchical clustering method was adopted for MEG interictal spike source clustering. Clustered sources were then tested for their prognostic value toward surgical outcome. Results : Postoperative seizure outcome was Engel class I in 6 (24%), class II in 3 (12%), class III in 12 (48%), and class IV in 4 (16%) patients. With respect to MEG spike clustering, 12 of 25 (48%) patients showed 1 cluster, 2 (8%) showed 2 or more clusters within the same lobe, 10 (40%) showed 2 or more clusters in a different lobe, and 1 (4%) patient had only scattered spikes with no clustering. Patients who showed focal clustering achieved better surgical outcome than distributed cases (p=0.017). Conclusion : This is the first study that introduces an objective method to classify the distribution of MEG interictal spike sources. By using a hierarchical clustering method, we found that the presence of focal clustered spikes predicts a better postoperative outcome in epilepsy patients with CD.

• 기술사
• /
• 제29권2호
• /
• pp.71-79
• /
• 1996

This paper evaluates the clustering performance of a neural network and a statistical method. Algorithms which are used in this paper are the GLVQ(Generalized Loaming vector Quantization) for a neural method and the k -means algorithm for a statistical clustering method. For comparison of two methods, we calculate the Rand's c statistics. As a result, the mean of c value obtained with the GLVQ is higher than that obtained with the k -means algorithm, while standard deviation of c value is lower. Experimental data sets were the Fisher's IRIS data and patterns extracted from handwritten numerals.

• 한국지능시스템학회논문지
• /
• 제11권7호
• /
• pp.579-583
• /
• 2001

In the area of data clustering in high dimensional space, one of the difficulties is the time-consuming process for computing vector similarities. It becomes worse in the case of the agglomerative algorithm with the group-average link and mean centroid method, because the cluster similarity must be recomputed whenever the cluster center moves after the merging step. As a solution of this problem, we present an incremental method of similarity computation, which substitutes the scalar calculation for the time-consuming calculation of vector similarity with several measures such as the squared distance, inner product, cosine, and minimum variance. Experimental results show that it makes clustering speed significantly fast for very high dimensional data.

• 전자공학회논문지S
• /
• 제34S권3호
• /
• pp.97-107
• /
• 1997

Image segmentation is teh important step in image infromation extraction for computer vison sytems. Fuzzy clustering methods have been used extensively in color image segmentation. Most analytic fuzzy clustering approaches are derived from the fuzzy c-means (FCM) algorithm. The FCM algorithm uses th eprobabilistic constraint that the memberships of a data point across classes sum to 1. However, the memberships resulting from the FCM do not always correspond to the intuitive concept of degree of belongingor compatibility. moreover, the FCM algorithm has considerable trouble above under noisy environments in the feature space. Recently, the possibilistic C-mean (PCM) for solving growing for color image segmentation. In the PCM, the membersip values may be interpreted as degrees of possibility of the data points belonging to the classes. So, the problems in the FCM can be solved by the PCM. The clustering results by just PCM are not smoothly bounded, and they often have holes. So, the region growing was used as a postprocessing. In our experiments, we illustrated that the proposed method is reasonable than the FCM in noisy enviironments.

• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• pp.267-271
• /
• 2007

본 논문은 원본이미지와 은닉이미지의 좋은 압축률과 만족할만한 이미지의 질, 그리고 외부공격에 강인한 이미지은닉의 한 방법으로 특이치 분해와 퍼지 군집화를 이용한 벡터양자화를 이용한 워터마킹 방법을 소개하였다. 실험에서는 은닉된 이미지의 비가시성과 외부공격에 대한 강인성을 증명하였다.

• 산업경영시스템학회지
• /
• 제32권3호
• /
• pp.99-109
• /
• 2009

Negative binomial yield model for semiconductor manufacturing consists of two parameters which are the average number of defects per die and the clustering parameter. Estimating the clustering parameter is quite complex because the parameter has not clear closed form. In this paper, a Bayesian approach using Markov Chain Monte Carlo is proposed to estimate the clustering parameter. To find an appropriate estimation method for the clustering parameter, two typical estimators, the method of moments estimator and the maximum likelihood estimator, and the proposed Bayesian estimator are compared with respect to the mean absolute deviation between the real yield and the estimated yield. Experimental results show that both the proposed Bayesian estimator and the maximum likelihood estimator have excellent performance and the choice of method depends on the purpose of use.

• 전기학회논문지
• /
• 제58권5호
• /
• pp.911-917
• /
• 2009

This paper introduces a sequential clustering technique as a tool for an effective grouping of transmission systems. The interconnected network system retains information about the location of each line. With this information, this paper aims to carry out initial clustering through the transmission usage rate, compare the similarity measures of regional information with the similarity measures of location price, and introduce the techniques of the clustering method. This transmission usage rate uses power flow based on congestion costs and similarity measurements using the FCM(Fuzzy C-Mean) algorithm. This paper also aims to prove the propriety of the proposed clustering method by comparing it with existing clustering methods that use the similarity measurement system. The proposed algorithm is demonstrated through the IEEE 39-bus RTS and Korea power system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제13권4호
• /
• pp.254-268
• /
• 2013

For real-world clustering tasks, the input data is typically not easily separable due to the highly complex data structure or when clusters vary in size, density and shape. Kernel-based clustering has proven to be an effective approach to partition such data. In this paper, we provide an overview of several fuzzy kernel clustering algorithms. We focus on methods that optimize an fuzzy C-mean-type objective function. We highlight the advantages and disadvantages of each method. In addition to the completely unsupervised algorithms, we also provide an overview of some semi-supervised fuzzy kernel clustering algorithms. These algorithms use partial supervision information to guide the optimization process and avoid local minima. We also provide an overview of the different approaches that have been used to extend kernel clustering to handle very large data sets.

• 경영과정보연구
• /
• 제14권
• /
• pp.51-65
• /
• 2004

We consider the Fuzzy clustering which is devised for partitioning a set of objects into a certain number of groups by assigning the membership probabilities to each object. The researches carried out in this field before show that the Fuzzy clustering concept is involved so much that for a certain set of data, the main purpose of the clustering cannot be attained as desired. Thus we Propose a new objective function, named as Fuzzy-Entroppy Function in order to satisfy the main motivation of the clustering which is classifying the data clearly. Also we suggest Mean Field Annealing Algorithm as an optimization algorithm rather than the ISODATA used traditionally in this field since the objective function is changed. We show the Mean Field Annealing Algorithm works pretty well not only for the new objective function but also for the classical Fuzzy objective function by indicating that the local minimum problem resulted from the ISODATA can be improved.

• 한국멀티미디어학회논문지
• /
• 제8권7호
• /
• pp.906-915
• /
• 2005

본 논문에서는 영상검색 방법의 하나인 내용에 기반을 둔 검색방법으로 순차영역분할과 투영정보를 이용 한 영상검색 방법을 제안한다. 제안한 방법은 순차 분할된 영역의 색상평균값과 각 영역의 투영정보를 이용한 방법으로 영상의 공간정보와 컬러정보를 효과적으로 결합한 방법이다. 실험결과 제안한 방법이 기존의 방법 보다 검색효율이 $11.6\%$ 증가됨을 알 수 있었다. 또한 영상의 밝기변화, 회전, 카메라의 위치 및 확대, 축소에 따른 영상의 공간변화에도 매우 강인한 것으로 나타났다.