• 제목/요약/키워드: Clustering identification

검색결과 244건 처리시간 0.048초

Identification of Plastic Wastes by Using Fuzzy Radial Basis Function Neural Networks Classifier with Conditional Fuzzy C-Means Clustering

  • Roh, Seok-Beom;Oh, Sung-Kwun
    • Journal of Electrical Engineering and Technology
    • /
    • 제11권6호
    • /
    • pp.1872-1879
    • /
    • 2016
  • The techniques to recycle and reuse plastics attract public attention. These public attraction and needs result in improving the recycling technique. However, the identification technique for black plastic wastes still have big problem that the spectrum extracted from near infrared radiation spectroscopy is not clear and is contaminated by noise. To overcome this problem, we apply Raman spectroscopy to extract a clear spectrum of plastic material. In addition, to improve the classification ability of fuzzy Radial Basis Function Neural Networks, we apply supervised learning based clustering method instead of unsupervised clustering method. The conditional fuzzy C-Means clustering method, which is a kind of supervised learning based clustering algorithms, is used to determine the location of radial basis functions. The conditional fuzzy C-Means clustering analyzes the data distribution over input space under the supervision of auxiliary information. The auxiliary information is defined by using k Nearest Neighbor approach.

이중 클러스터링 기법을 이용한 퍼지 시스템의 새로운 동정법 (A new identification method of a fuzzy system via double clustering)

  • 김은태;이기철;이희진;박민용
    • 전자공학회논문지C
    • /
    • 제35C권7호
    • /
    • pp.92-100
    • /
    • 1998
  • In this paper, we suggest a new identification method for sugeno-type fuzzy model via new data clustering strategy. The suggested algorithm is much simpelr than the original identification strategy adopted in. The algorithm suggested in this paper is somewhat similar to that of [2] and [6], that is the algorithm suggested in this paper consists of two steps: coarse tuning and fine tuning. In this paper, double clustering strategy is proposed for coarse tunign. Finally, the resutls of computer simulation are given to demonstrate the validity of this algorithm.

  • PDF

국부 퍼지 클러스터링 PCA를 갖는 GMM을 이용한 화자 식별 (Speaker Identification Using GMM Based on Local Fuzzy PCA)

  • 이기용
    • 음성과학
    • /
    • 제10권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.

  • PDF

경계 차감 클러스터링에 기반한 클러스터 개수 추정 화자식별 (Speaker Identification with Estimating the Number of Cluster Based on Boundary Subtractive Clustering)

  • 이윤정;최민정;서창우;한헌수
    • 한국음향학회지
    • /
    • 제26권5호
    • /
    • pp.199-206
    • /
    • 2007
  • 본 논문에서는 화자식별을 위한 특징벡터의 새로운 클러스터링 방법을 제안한다. 제안된 방법은 클러스터 센터에 대한 초기값 설정과 클러스터 개수에 대한 사전 정보 없이 클러스터링이 가능하다. 각 클러스터 센터는 경계 차감 클러스터링 알고리즘으로 한 번에 한 개의 클러스터 센터가 추가됨으로써 순차적으로 구해지며, 클러스터 개수는 클러스터간의 상호관계를 조사하여 결정된다. 인공 생성 데이터 및 TIMIT 음성을 이용하여 실험한 결과로부터 제안된 방법이 기존의 방법보다 우수함을 확인하였다.

화자적응과 군집화를 이용한 화자식별 시스템의 성능 및 속도 향상 (Adaptation and Clustering Method for Speaker Identification with Small Training Data)

  • 김세현;오영환
    • 대한음성학회지:말소리
    • /
    • 제58호
    • /
    • pp.83-99
    • /
    • 2006
  • One key factor that hinders the widespread deployment of speaker identification technologies is the requirement of long enrollment utterances to guarantee low error rate during identification. To gain user acceptance of speaker identification technologies, adaptation algorithms that can enroll speakers with short utterances are highly essential. To this end, this paper applies MLLR speaker adaptation for speaker enrollment and compares its performance against other speaker modeling techniques: GMMs and HMM. Also, to speed up the computational procedure of identification, we apply speaker clustering method which uses principal component analysis (PCA) and weighted Euclidean distance as distance measurement. Experimental results show that MLLR adapted modeling method is most effective for short enrollment utterances and that the GMMs performs better when long utterances are available.

  • PDF

A Study on the Gustafson-Kessel Clustering Algorithm in Power System Fault Identification

  • Abdullah, Amalina;Banmongkol, Channarong;Hoonchareon, Naebboon;Hidaka, Kunihiko
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권5호
    • /
    • pp.1798-1804
    • /
    • 2017
  • This paper presents an approach of the Gustafson-Kessel (GK) clustering algorithm's performance in fault identification on power transmission lines. The clustering algorithm is incorporated in a scheme that uses hybrid intelligent technique to combine artificial neural network and a fuzzy inference system, known as adaptive neuro-fuzzy inference system (ANFIS). The scheme is used to identify the type of fault that occurs on a power transmission line, either single line to ground, double line, double line to ground or three phase. The scheme is also capable an analyzing the fault location without information on line parameters. The range of error estimation is within 0.10 to 0.85 relative to five values of fault resistances. This paper also presents the performance of the GK clustering algorithm compared to fuzzy clustering means (FCM), which is particularly implemented in structuring a data. Results show that the GK algorithm may be implemented in fault identification on power system transmission and performs better than FCM.

유전자적 최적 정보 입자 기반 퍼지 추론 시스템 (Genetically Optimized Information Granules-based FIS)

  • 박건준;오성권;이영일
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.146-148
    • /
    • 2005
  • In this paper, we propose a genetically optimized identification of information granulation(IG)-based fuzzy model. To optimally design the IG-based fuzzy model we exploit a hybrid identification through genetic alrogithms(GAs) and Hard C-Means (HCM) clustering. An initial structure of fuzzy model is identified by determining the number of input, the seleced input variables, the number of membership function, and the conclusion inference type by means of GAs. Granulation of information data with the aid of Hard C-Means(HCM) clustering algorithm help determine the initial paramters of fuzzy model such as the initial apexes of the membership functions and the initial values of polyminial functions being used in the premise and consequence part of the fuzzy rules. And the inital parameters are tuned effectively with the aid of the genetic algorithms and the least square method. And also, we exploite consecutive identification of fuzzy model in case of identification of structure and parameters. Numerical example is included to evaluate the performance of the proposed model.

  • PDF

유전자 알고리즘에 의한 IG기반 퍼지 모델의 최적 동정 (Optimal Identification of IG-based Fuzzy Model by Means of Genetic Algorithms)

  • 박건준;이동윤;오성권
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.9-11
    • /
    • 2005
  • We propose a optimal identification of information granulation(IG)-based fuzzy model to carry out the model identification of complex and nonlinear systems. To optimally identity we use genetic algorithm (GAs) sand Hard C-Means (HCM) clustering. An initial structure of fuzzy model is identified by determining the number of input, the selected input variables, the number of membership function, and the conclusion inference type by means of GAs. Granulation of information data with the aid of Hard C-Means(HCM) clustering algorithm help determine the initial parameters of fuzzy model such as the initial apexes of the membership functions and the initial values of polynomial functions being used in the premise and consequence part of the fuzzy rules. And the initial parameters are tuned effectively with the aid of the genetic algorithms(GAs) and the least square method. Numerical example is included to evaluate the performance of the proposed model.

  • PDF

클러스터링에 기반 도메인 분석을 통한 컴포넌트 식별 (Component Identification using Domain Analysis based on Clustering)

  • Haeng-Kon Kim;Jeon-Geun Kang
    • 한국컴퓨터산업학회논문지
    • /
    • 제4권4호
    • /
    • pp.479-490
    • /
    • 2003
  • 컴포넌트 기반 소프트웨어개발 (CBD: Component Based Development)은 재사용 부품을 기반하여 소프트웨어 개발, 수정, 유지보수를 용이하게 지원한다. 따라서 컴포넌트는 강한 응집력과 양한 결합력으로 개발되어야 한다. 본 논문에서는use case와 클래스를 간에 유사성을 통한 클러스터링 분석에 기반 하여 컴포넌트 식별에 대해 연구한다. 컴포넌트 참조 모델과 프레임워크를 제시하여 사례를 통해 검증한다. 컴포넌트 식별 방법은 추출, 명세 및 아키?쳐를 지원한다. 이들 방법론은 기존의 객체지향 방법론을 참조하며 분석에서 구현까지의 추적성을 지원하며 재사용 컴포넌트의 모듈성 지원을 위해 강한 응집력과 약한 결합력을 반영한다.

  • PDF

절리군 분석을 위한 퍼지 클러스터링 기법 (Fuzzy Clustering Method for the Identification of Joint Sets)

  • 정용복;전석원
    • 터널과지하공간
    • /
    • 제13권4호
    • /
    • pp.294-303
    • /
    • 2003
  • 터널이나 사면과 같은 암반 구조물의 거동은 불연속면에 의해 지배적인 영향을 받는다. 따라서 암반내 존재하는 불연속면 자료의 조사 및 분석은 암반구조물 설계 및 시공에 있어서 상당히 큰 중요성을 가진다. 이러한 불연속면의 조사 및 분석 작업 중에서 반드시 거처야 할 작업 중 하나가 절리군을 분별하는 것이다. 기존의 절리군 분석 작업은 대부분 시각적인 방법으로 행해지고 있다. 이 경우 분석자의 주관에 따라 차이를 보일 수 있으며 절리의 방향 정보 외의 다른 추가적인 정보들은 사용하기 힘든 단점이 있다. 본 연구에서는 절리군 분석을 돕기 위하여 퍼지 클러스터링 기법을 이용한 프로그램을 개발하였으며 이를 두 가지 형태의 절리 자료에 대한 절리군 분석에 적용하였다. 적용 결과 퍼지 클러스터링 기법이 다수의 절리 자료에 대한 절리군 분석, 평균방향 및 밀집도 추정에 효과적이며 타당한 방법임을 확인하였다.