• 제목/요약/키워드: State clustering

검색결과 230건 처리시간 0.018초

입출력 부공간에서의 데이터 클러스터링에 의한 퍼지제어 시스템 설계 (Fuzzy control system design by data clustering in the input-output subspaces)

  • 김민수;공성곤
    • 전자공학회논문지S
    • /
    • 제34S권12호
    • /
    • pp.30-40
    • /
    • 1997
  • This paper presents a design method of fuzzy control systems by clustering the data in the subspace of the input-output produyct space. In the case of servo control, most input-outputdata are concentrated in thye steady-state region, and the the clustering will result in only steady-state fuzzy rules. To overcome this problem, we divide the input-output product space into some subspaces according to the state of input variables. The fuzzy control system designed by the subspace clustering showed good transient response and smaller steady-state error, which is comparable with the reference fuzzy system.

  • PDF

Distributed and Weighted Clustering based on d-Hop Dominating Set for Vehicular Networks

  • Shi, Yan;Xu, Xiang;Lu, Changkai;Chen, Shanzhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권4호
    • /
    • pp.1661-1678
    • /
    • 2016
  • Clustering is one of the key technologies in vehicular networks. Constructing and maintaining stable clusters is a challenging task in high mobility environments. DWCM (Distributed and Weighted Clustering based on Mobility Metrics) is proposed in this paper based on the d-hop dominating set of the network. Each vehicle is assigned a priority that describes the cluster relationship. The cluster structure is determined according to the d-hop dominating set, where the vehicles in the d-hop dominating set act as the cluster head nodes. In addition, cluster maintenance handles the cluster structure changes caused by node mobility. The rationality of the proposed algorithm is proven. Simulation results in the NS-2 and VanetMobiSim integrated environment demonstrate the performance advantages.

Recovery Levels of Clustering Algorithms Using Different Similarity Measures for Functional Data

  • Chae, Seong San;Kim, Chansoo;Warde, William D.
    • Communications for Statistical Applications and Methods
    • /
    • 제11권2호
    • /
    • pp.369-380
    • /
    • 2004
  • Clustering algorithms with different similarity measures are commonly used to find an optimal clustering or close to original clustering. The recovery level of using Euclidean distance and distances transformed from correlation coefficients is evaluated and compared using Rand's (1971) C statistic. The C values present how the resultant clustering is close to the original clustering. In simulation study, the recovery level is improved by applying the correlation coefficients between objects. Using the data set from Spellman et al. (1998), the recovery levels with different similarity measures are also presented. In general, the recovery level of true clusters was increased by using the correlation coefficients.

A Determination of an Optimal Clustering Method Based on Data Characteristics

  • Kim, Jeong-Hun;Yoo, Kwan-Hee;Nasridinov, Aziz
    • 예술인문사회 융합 멀티미디어 논문지
    • /
    • 제7권8호
    • /
    • pp.305-314
    • /
    • 2017
  • Clustering is a method that collects data objects into groups based on their similary. Performance of the state-of-the-art clustering methods is different according to the data characteristics. There have been numerous studies that performed experiments to compare the accuracy of the state-of-the-art clustering methods by applying various kinds of datasets. A common problem of these studies is that they only consider clustering algorithms that yield the most accurate results for a particular dataset. They do not consider what factors affect the execution time of each clustering method and how they are affected. Nevertheless, execution time is an important factor in clustering performance if there is no significant difference in accuracy. In order to solve the problems of the existing research, through a series of experiments using various types of datasets, we compare the accuracy of four representative clustering methods. In addition, we perform practical clustering performance comparisons by deriving time complexity and identifying factors that influences to its performance.

가변어휘 핵심어 검출 성능 향상을 위한 비핵심어 모델 (Non-Keyword Model for the Improvement of Vocabulary Independent Keyword Spotting System)

  • 김민제;이정철
    • 한국음향학회지
    • /
    • 제25권7호
    • /
    • pp.319-324
    • /
    • 2006
  • 본 논문에서는 화자독립 가변어휘 핵심어 검출기의 성능을 개선하기 위하여 두 가지의 새로운 비핵심어 모델링 방법을 제안한다. 첫째는 K-means 알고리즘 기반 monophone 군집화 방법을 개선하기 위해 monophone을 state단위로 결정트리를 기반으로 군집화하여 비핵심어를 모델링하는 방법이다. 둘째는 single state multiple mixture 방법을 개선하기 위해 음절단위 multi-state multiple mixture 방법으로 모델링하는 방법이다. 실험에서 ETRI 표준 한국어 공통음성 단어 DB를 이용하여 트라이폰 모델을 훈련하였고, 훈련에 사용하지 않은 음성데이터를 이용하여 핵심어 검출closed 테스트를 수행하였다. 그리고 사무실 환경에서 4명의 화자가 각각 100문장씩 발성한 400문장의 음성데이터를 이용하여 100단어 핵심어 검출 open 테스트를 수행하였다. 실험 결과 결정트리기반 상태 군집화 방법이 기존의 K-means 알고리듬 기반 monophone clustering 방법보다 핵심어 검출 성능이 28%/29%(closed/open test) 향상되었다 그리고 음절단위 multi-state multiple mixture 방법이 비핵심어 전체를 single state 모델로 구성하는 방법보다 핵심어 검출 성능이 22%/2%(closed/open test) 향상됨으로써 본 논문에서 제안한 두 가지 알고리듬이 우수한 결과를 나타내었다

Microblog User Geolocation by Extracting Local Words Based on Word Clustering and Wrapper Feature Selection

  • Tian, Hechan;Liu, Fenlin;Luo, Xiangyang;Zhang, Fan;Qiao, Yaqiong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권10호
    • /
    • pp.3972-3988
    • /
    • 2020
  • Existing methods always rely on statistical features to extract local words for microblog user geolocation. There are many non-local words in extracted words, which makes geolocation accuracy lower. Considering the statistical and semantic features of local words, this paper proposes a microblog user geolocation method by extracting local words based on word clustering and wrapper feature selection. First, ordinary words without positional indications are initially filtered based on statistical features. Second, a word clustering algorithm based on word vectors is proposed. The remaining semantically similar words are clustered together based on the distance of word vectors with semantic meanings. Next, a wrapper feature selection algorithm based on sequential backward subset search is proposed. The cluster subset with the best geolocation effect is selected. Words in selected cluster subset are extracted as local words. Finally, the Naive Bayes classifier is trained based on local words to geolocate the microblog user. The proposed method is validated based on two different types of microblog data - Twitter and Weibo. The results show that the proposed method outperforms existing two typical methods based on statistical features in terms of accuracy, precision, recall, and F1-score.

Fiscal Policy Effectiveness Assessment Based on Cluster Analysis of Regions

  • Martynenko, Valentyna;Kovalenko, Yuliia;Chunytska, Iryna;Paliukh, Oleksandr;Skoryk, Maryna;Plets, Ivan
    • International Journal of Computer Science & Network Security
    • /
    • 제22권7호
    • /
    • pp.75-84
    • /
    • 2022
  • The efficiency of the regional fiscal policy implementation is based on the achievement of target criteria in the formation and distribution of own financial resources of local budgets, reducing their deficit and reducing dependence on transfers. It is also relevant to compare the development of financial autonomy of regions in the course of decentralisation of fiscal relations. The study consists in the cluster analysis of the effectiveness of fiscal policy implementation in the context of 24 regions and the capital city of Kyiv (except for temporarily occupied territories) under conditions of fiscal decentralisation. Clustering of the regions of Ukraine by 18 indicators of fiscal policy implementation efficiency was carried out using Ward's minimum variance method and k-means clustering algorithm. As a result, the regions of Ukraine are grouped into 5 homogeneous clusters. For each cluster measures were developed to increase own revenues and minimize dependence on official transfers to increase the level of financial autonomy of the regions. It has been proved that clustering algorithms are an effective tool in assessing the effectiveness of fiscal policy implementation at the regional level and stimulating further expansion of financial decentralisation of regions.

Grouping stocks using dynamic linear models

  • Sihyeon, Kim;Byeongchan, Seong
    • Communications for Statistical Applications and Methods
    • /
    • 제29권6호
    • /
    • pp.695-708
    • /
    • 2022
  • Recently, several studies have been conducted using state space model. In this study, a dynamic linear model with state space model form is applied to stock data. The monthly returns for 135 Korean stocks are fitted to a dynamic linear model, to obtain an estimate of the time-varying 𝛽-coefficient time-series. The model formula used for the return is a capital asset pricing model formula explained in economics. In particular, the transition equation of the state space model form is appropriately modified to satisfy the assumptions of the error term. k-shape clustering is performed to classify the 135 estimated 𝛽 time-series into several groups. As a result of the clustering, four clusters are obtained, each consisting of approximately 30 stocks. It is found that the distribution is different for each group, so that it is well grouped to have its own characteristics. In addition, a common pattern is observed for each group, which could be interpreted appropriately.

Clustering and Recommendation for Semantic Web Service in Time Series

  • Yu, Lei;Wang, Zhili;Meng, Luoming;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권8호
    • /
    • pp.2743-2762
    • /
    • 2014
  • Promoted by cloud technology and new websites, plenty and variety of Web services are emerging in the Internet. Meanwhile some Web services become outdated even obsolete due to new versions, and a normal phenomenon is that some services work well only with other services of older versions. These laggard or improper services are lowering the performance of the composite service they involved in. In addition, using current technology to identify proper semantic services for a composite service is time-consuming and inaccurate. Thus, we proposed a clustering method and a recommendation method to deal with these problems. Clustering technology is used to classify semantic services according to their topics, functionality and other aspects from plenty of services. Recommendation technology is used to predict the possible preference of a composite service, and recommend possible component services to the composite service according to the history information of invocations and similar composite services. The experiments show that our clustering method with the help of Ontology and TF/IDF technology is more accurate than others, and our recommendation method has less average error than others in the series of missing rate.

무선 센서 네트워크에서의 에너지 효율적인 불균형 클러스터링 알고리즘 (An Energy Efficient Unequal Clustering Algorithm for Wireless Sensor Networks)

  • 이성주;김성천
    • 정보처리학회논문지C
    • /
    • 제16C권6호
    • /
    • pp.783-790
    • /
    • 2009
  • 무선 센서 네트워크의 필요성이 증가함에 따라 관련된 연구 또한 활발히 진행되고 있다. 특히, 에너지 제약적인 무선 센서 네트워크의 생존 시간을 증가시키고자 하는 클러스터링 기법들이 많이 연구되고 있다. 대표적인 LEACH와는 달리, 최근의 클러스터링 기법들은 다중 홉으로 데이터를 전송하기 때문에 데이터 병목 현상 문제가 발생한다. 불균형 클러스터링(unequal clustering) 기법들은 라우팅 경로를 증가시켜 데이터 병목 현상 문제를 해결하였다. 불균형 클러스터링 기법들의 대부분은 BS(Base Station)와의 거리만을 고려하여 클러스터의 크기를 결정하였기 때문에, 클러스터 헤드의 에너지 소모가 커지는 문제점이 있다. 본 논문에서는 클러스터 헤드의 에너지 소모를 최소화하고, 데이터 병목 현상 문제도 해결할 수 있는 불균형 클러스터링 알고리즘을 제안하였다. 기본 아이디어는 적절한 클러스터 헤드를 선출한 이후, BS와의 거리와 노드의 에너지 상태, 이웃 노드의 수를 고려하여 클러스터의 크기를 결정하고, 동시에 클러스터 헤드의 전송기능을 분담하는 노드를 선정하는 것이다. 이처럼 클러스터 헤드의 에너지 소모를 최소화함으로써 클러스터링의 반복횟수를 감소시킬 수 있었으며, 더불어 전체 네트워크의 에너지 소모도 감소시킬 수 있었다.