• Title/Summary/Keyword: and clustering

Search Result 5,643, Processing Time 0.036 seconds

A Study on Korean isolated word recognition using LPC cepstrum and clustering (LPC Cepstrum과 집단화를 이용한 한국어 고립단어 인식에 관한 연구)

  • Kim, Jin-Yeong
    • The Journal of the Acoustical Society of Korea
    • /
    • v.6 no.4
    • /
    • pp.44-54
    • /
    • 1987
  • In this paper, the problem of LP-model and it's solution by liftering in cepstrum domain are investigated in speaker independent isolated-word recognition. And, clustering technique is discussed for obtaining the reference template. KMA (K-means iteration with average) method, which is transformed from UWA method and K-iteration method, has been suggested and compared with each other for clustering, the result of recognition experiments shows max. $95\%$ recognition rate when rasied-sign lifter and KMA clustering method is applied.

  • PDF

Shot-change Detection using Hierarchical Clustering (계층적 클러스터링을 이용한 장면 전환점 검출)

  • 김종성;홍승범;백중환
    • Proceedings of the IEEK Conference
    • /
    • 2003.07d
    • /
    • pp.1507-1510
    • /
    • 2003
  • We propose UPGMA(Unweighted Pair Group Method using Average distance) as hierarchical clustering to detect abrupt shot changes using multiple features such as pixel-by-pixel difference, global and local histogram difference. Conventional $\kappa$-means algorithm which is a method of the partitional clustering, has to select an efficient initial cluster center adaptively UPGMA that we propose, does not need initial cluster center because of agglomerative algorithm that it starts from each sample for clusters. And UPGMA results in stable performance. Experiment results show that the proposed algorithm works not only well but also stably.

  • PDF

Improvement on Fuzzy C-Means Using Principal Component Analysis

  • Choi, Hang-Suk;Cha, Kyung-Joon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.301-309
    • /
    • 2006
  • In this paper, we show the improved fuzzy c-means clustering method. To improve, we use the double clustering as principal component analysis from objects which is located on common region of more than two clusters. In addition we use the degree of membership (probability) of fuzzy c-means which is the advantage. From simulation result, we find some improvement of accuracy in data of the probability 0.7 exterior and interior of overlapped area.

  • PDF

Fuzzy Modeling based on FCM Clustering Algorithm (FCM 클러스터링 알고리즘에 기초한 퍼지 모델링)

  • 윤기찬;오성권
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.373-373
    • /
    • 2000
  • In this paper, we propose a fuzzy modeling algorithm which divides the input space more efficiently than convention methods by taking into consideration correlations between components of sample data. The proposed fuzzy modeling algorithm consists of two steps: coarse tuning, which determines consequent parameters approximately using FCRM clustering method, and fine tuning, which adjusts the premise and consequent parameters more precisely by gradient descent algorithm. To evaluate the performance of the proposed fuzzy mode, we use the numerical data of nonlinear function.

  • PDF

Torque Control of Brushless DC Motor Using a Clustering Adaptive Fuzzy Logic Controller (클러스터링 적응 퍼지 제어기를 이용한 브러시리스 직류 전동기의 토크 제어)

  • 권정진;한우용;이창구;김성중
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.349-349
    • /
    • 2000
  • A Clustering Adaptive Fuzzy Logic Controller(CAFLC) is applied to the torque control of a brushless do motor drive. Objective of this system includes elimination of torque ripple due to cogging at low speeds under loads. The CAFLC implemented has advantages of computational simplicity, and self-tuning characteristics. Simulation results showed that the torque ripple and dynamic response of the system using a CAFLC were superior to the model reference adaptive controlled system.

  • PDF

Results of Discriminant Analysis with Respect to Cluster Analyses Under Dimensional Reduction

  • Chae, Seong-San
    • Communications for Statistical Applications and Methods
    • /
    • v.9 no.2
    • /
    • pp.543-553
    • /
    • 2002
  • Principal component analysis is applied to reduce p-dimensions into q-dimensions ( $q {\leq} p$). Any partition of a collection of data points with p and q variables generated by the application of six hierarchical clustering methods is re-classified by discriminant analysis. From the application of discriminant analysis through each hierarchical clustering method, correct classification ratios are obtained. The results illustrate which method is more reasonable in exploratory data analysis.

Forecasting High-Level Ozone Concentration with Fuzzy Clustering (퍼지 클러스터링을 이용한 고농도오존예측)

  • 김재용;김성신;왕보현
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2001.05a
    • /
    • pp.191-194
    • /
    • 2001
  • The ozone forecasting systems have many problems because the mechanism of the ozone concentration is highly complex, nonlinear, and nonstationary. Also, the results of prediction are not a good performance so far, especially in the high-level ozone concentration. This paper describes the modeling method of the ozone prediction system using neuro-fuzzy approaches and fuzzy clustering. The dynamic polynomial neural network (DPNN) based upon a typical algorithm of GMDH (group method of data handling) is a useful method for data analysis, identification of nonlinear complex system, and prediction of a dynamical system.

  • PDF

Gene Screening and Clustering of Yeast Microarray Gene Expression Data (효모 마이크로어레이 유전자 발현 데이터에 대한 유전자 선별 및 군집분석)

  • Lee, Kyung-A;Kim, Tae-Houn;Kim, Jae-Hee
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.6
    • /
    • pp.1077-1094
    • /
    • 2011
  • We accomplish clustering analyses for yeast cell cycle microarray expression data. To reflect the characteristics of a time-course data, we screen the genes using the test statistics with Fourier coefficients applying a FDR procedure. We compare the results done by model-based clustering, K-means, PAM, SOM, hierarchical Ward method and Fuzzy method with the yeast data. As the validity measure for clustering results, connectivity, Dunn index and silhouette values are computed and compared. A biological interpretation with GO analysis is also included.

Clustering XML Documents Considering The Weight of Large Items in Clusters (클러스터의 주요항목 가중치 기반 XML 문서 클러스터링)

  • Hwang, Jeong-Hee
    • The KIPS Transactions:PartD
    • /
    • v.14D no.1 s.111
    • /
    • pp.1-8
    • /
    • 2007
  • As the web document of XML, an exchange language of data in the advanced Internet, is increasing, a target of information retrieval becomes the web documents. Therefore, there we researches on structure, integration and retrieval of XML documents. This paper proposes a clustering method of XML documents based on frequent structures, as a basic research to efficiently process query and retrieval. To do so, first, trees representing XML documents are decomposed and we extract frequent structures from them. Second, we perform clustering considering the weight of large items to adjust cluster creation and cluster cohesion, considering frequent structures as items of transactions. Third, we show the excellence of our method through some experiments which compare which the previous methods.

A New Approach to Spatial Pattern Clustering based on Longest Common Subsequence with application to a Grocery (공간적 패턴클러스터링을 위한 새로운 접근방법의 제안 : 슈퍼마켓고객의 동선분석)

  • Jung, In-Chul;Kwon, Young-S.
    • IE interfaces
    • /
    • v.24 no.4
    • /
    • pp.447-456
    • /
    • 2011
  • Identifying the major moving patterns of shoppers' movements in the selling floor has been a longstanding issue in the retailing industry. With the advent of RFID technology, it has been easier to collect the moving data for a individual shopper's movement. Most of the previous studies used the traditional clustering technique to identify the major moving pattern of customers. However, in using clustering technique, due to the spatial constraint (aisle layout or other physical obstructions in the store), standard clustering methods are not feasible for moving data like shopping path should be adjusted for the analysis in advance, which is time-consuming and causes data distortion. To alleviate this problems, we propose a new approach to spatial pattern clustering based on longest common subsequence (LCSS). Experimental results using the real data obtained from a grocery in Seoul show that the proposed method performs well in finding the hot spot and dead spot as well as in finding the major path patterns of customer movements.