• Title/Summary/Keyword: Clustering identification

Search Result 247, Processing Time 0.027 seconds

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
    • /
    • v.11 no.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 (이중 클러스터링 기법을 이용한 퍼지 시스템의 새로운 동정법)

  • 김은태;이기철;이희진;박민용
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.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

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

  • Lee, Ki-Yong
    • 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.

  • PDF

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

  • Lee, Youn-Jeong;Choi, Min-Jung;Seo, Chang-Woo;Hahn, Hern-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.26 no.5
    • /
    • pp.199-206
    • /
    • 2007
  • In this paper we propose a new clustering algorithm that performs clustering the feature vectors for the speaker identification. Unlike typical clustering approaches, the proposed method performs the clustering without the initial guesses of locations of the cluster centers and a priori information about the number of clusters. Cluster centers are obtained incrementally by adding one cluster center at a time through the boundary subtractive clustering algorithm. The number of clusters is obtained from investigating the mutual relationship between clusters. The experimental results for artificial datum and TIMIT DB show the effectiveness of the proposed algorithm as compared with the conventional methods.

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

  • Kim Se-Hyun;Oh Yung-Hwan
    • MALSORI
    • /
    • no.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
    • /
    • v.12 no.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 (유전자적 최적 정보 입자 기반 퍼지 추론 시스템)

  • Park, Keon-Jun;Oh, Sung-Kwun;Lee, Young-Il
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • 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

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

  • Park, Keon-Jun;Lee, Dong-Yoon;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2005.05a
    • /
    • 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
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.4
    • /
    • pp.479-490
    • /
    • 2003
  • CBD is a software development approach based on reusable component and supports easy modification and evolution of software. For the success of this approach, a component must be developed with high cohesion and low coupling. In this paper, we propose the two types of clustering analysis technique based on affinity between use-cases and classes and propose component identification method applying to this technique. We also propose component reference model and CBD methodology framework and perform a ease study to demonstrate how the affinity-based clustering technique is used in component identification method. Component identification method contains three tasks such as component extraction, component specification and component architecting. This method uses object-oriented concept for identifying component, which improves traceability from analysis to implementation and can automatically extract component. This method reflects the low coupling-high cohesion principle for good modularization about reusable component.

  • PDF

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

  • 정용복;전석원
    • Tunnel and Underground Space
    • /
    • v.13 no.4
    • /
    • pp.294-303
    • /
    • 2003
  • The structural behaviour of rock mass structure, such as tunnel or slope is critically dependent on the various characteristics of discontinuities. Therefore, it is important to survey and analyze discontinuities correctly for the design and construction of rock mass structure. One inevitable Procedure of discontinuity survey and analysis is joint set identification from a lot of raw directional joint data. The identification procedure is generally done by a graphical method. This type of analysis has some shortcomings such as subjective identification results, inability to use extra information on discontinuity, and so on. In this study, a computer program for joint set identification based on the fuzzy clustering algorithm was implemented and tested using two kinds of joint data. It was confirmed that fuzzy clustering method is effective and valid for joint set identification and estimation of mean direction and degree of clustering of huge joint data through the applications.