• Title/Summary/Keyword: Clustering Strategy

Search Result 195, Processing Time 0.025 seconds

A New Identification Method of a Fuzzy System via Double Clustering (이중 클러스터링 기법을 이용한 퍼지 시스템의 새로운 동정법)

  • 김은태;김경욱;이지철;박민기;박민용
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.10a
    • /
    • pp.356-359
    • /
    • 1997
  • Recently many studies have been conducted of fuzzy modeling since it can describe a nonlinear system better than the conventional methods. A famous researcher, M. Sugeno, suggested a fuzzy model which superbly describes a nonlinear system. In this paper, we suggest a new identification method for Sugeno-typo fuzzy model. The suggested algorithm is much simpler than the original identification strategy adopted in [1]. The algorithm suggested in this paper is somewhat similar to that of [2]. that is, the algorithm suggested in this paper consists of two consists of two steps: coarse tuning and fine tuning. In this paper, double clustering strategy is proposed for coarse tuning. Finally, the results of computer simulation are given to demonstrate the validity of this algorithm.

  • PDF

Strategy for Visual Clustering (시각적 군집분석에 대한 전략)

  • 허문열
    • The Korean Journal of Applied Statistics
    • /
    • v.14 no.1
    • /
    • pp.177-190
    • /
    • 2001
  • 전통적으로 많이 사용하는 군집분석의 방법들은 개체간의 거리를 고려하여 이들을 분류해 내는 것이며, 따라서 거리 측정 방법에 따라 여러 형태의 군집분석 방법이 나타나게 된다. 어떤 방법을 적용하던 간에 그 결과는 고정된 수치로써 나타난다. 다차원 자료의 구조파악이 몇 개의 수치로 나타나게 되면 어쩔 수 없이 정보의 손실이 발생하게 된다. 이를 보완하기 위해 시각적 매체를 동원하여 다차원 자료의 구조를 파악하는 연구가 있었으며, 이를 시각적 군집분석이라고 명명하고 있다. 본 연구에서는 시각적 군집분석에 대한 기본적 개념과 이를 위한 통계 도형의 활용, 구현방법 등에 대해 살펴보기로 한다.

  • PDF

A Study on the On-Line Fuzzy ULTC Controller Design Based on Multiple Load Center Points (다중 부하중심점에 기반한 온라인 퍼지 ULTC 제어기 설계에 대한 연구)

  • Ko, Yun-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.55 no.12
    • /
    • pp.514-521
    • /
    • 2006
  • The existing ULTC operation control strategy based on the measured data deteriorates the voltage compensation capability making the efficient corresponding to the load variation difficult by following the fixed load center point voltage. Accordingly, this paper proposes a new on-line fuzzy ULTC controller based on the designed multiple load center points which can improve the voltage compensation capability of ULTC and minimize voltage deviation by moving in real-time the load center point according to the load variation to an adequate position among the multiple load center points designed using the clustering technique. The Max-Min distance technique is adopted as the clustering technique for the decision of multiple load points from measured MTr load current and PTr voltage, and the minimum distance classifier is adopted for the decision of fuzzy output membership function. To verify the effectiveness of the proposed strategy, Visual C++ MFC-based simulation environments is developed. Finally, the superiority the proposed strategy is proved by comparing the fuzzy ULTC operation control results based on multiple load center points with the existing ULTC operation control results based on fixed load center point using the data for three day.

Optimal LEACH Protocol with Improved Bat Algorithm in Wireless Sensor Networks

  • Cai, Xingjuan;Sun, Youqiang;Cui, Zhihua;Zhang, Wensheng;Chen, Jinjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2469-2490
    • /
    • 2019
  • A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT's Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs).

A Study on Sitting Posture Recognition using Machine Learning (머신러닝을 이용한 앉은 자세 분류 연구)

  • Ma, Sangyong;Hong, Sangpyo;Shim, Hyeon-min;Kwon, Jang-Woo;Lee, Sangmin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.9
    • /
    • pp.1557-1563
    • /
    • 2016
  • According to recent studies, poor sitting posture of the spine has been shown to lead to a variety of spinal disorders. For this reason, it is important to measure the sitting posture. We proposed a strategy for classification of sitting posture using machine learning. We retrieved acceleration data from single tri-axial accelerometer attached on the back of the subject's neck in 5-types of sitting posture. 6 subjects without any spinal disorder were participated in this experiment. Acceleration data were transformed to the feature vectors of principle component analysis. Support vector machine (SVM) and K-means clustering were used to classify sitting posture with the transformed feature vectors. To evaluate performance, we calculated the correct rate for each classification strategy. Although the correct rate of SVM in sitting back arch was lower than that of K-means clustering by 2.0%, SVM's correct rate was higher by 1.3%, 5.2%, 16.6%, 7.1% in a normal posture, sitting front arch, sitting cross-legged, sitting leaning right, respectively. In conclusion, the overall correction rates were 94.5% and 88.84% in SVM and K-means clustering respectively, which means that SVM have more advantage than K-means method for classification of sitting posture.

Lossless Compression for Hyperspectral Images based on Adaptive Band Selection and Adaptive Predictor Selection

  • Zhu, Fuquan;Wang, Huajun;Yang, Liping;Li, Changguo;Wang, Sen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.8
    • /
    • pp.3295-3311
    • /
    • 2020
  • With the wide application of hyperspectral images, it becomes more and more important to compress hyperspectral images. Conventional recursive least squares (CRLS) algorithm has great potentiality in lossless compression for hyperspectral images. The prediction accuracy of CRLS is closely related to the correlations between the reference bands and the current band, and the similarity between pixels in prediction context. According to this characteristic, we present an improved CRLS with adaptive band selection and adaptive predictor selection (CRLS-ABS-APS). Firstly, a spectral vector correlation coefficient-based k-means clustering algorithm is employed to generate clustering map. Afterwards, an adaptive band selection strategy based on inter-spectral correlation coefficient is adopted to select the reference bands for each band. Then, an adaptive predictor selection strategy based on clustering map is adopted to select the optimal CRLS predictor for each pixel. In addition, a double snake scan mode is used to further improve the similarity of prediction context, and a recursive average estimation method is used to accelerate the local average calculation. Finally, the prediction residuals are entropy encoded by arithmetic encoder. Experiments on the Airborne Visible Infrared Imaging Spectrometer (AVIRIS) 2006 data set show that the CRLS-ABS-APS achieves average bit rates of 3.28 bpp, 5.55 bpp and 2.39 bpp on the three subsets, respectively. The results indicate that the CRLS-ABS-APS effectively improves the compression effect with lower computation complexity, and outperforms to the current state-of-the-art methods.

A Computational Intelligence Based Online Data Imputation Method: An Application For Banking

  • Nishanth, Kancherla Jonah;Ravi, Vadlamani
    • Journal of Information Processing Systems
    • /
    • v.9 no.4
    • /
    • pp.633-650
    • /
    • 2013
  • All the imputation techniques proposed so far in literature for data imputation are offline techniques as they require a number of iterations to learn the characteristics of data during training and they also consume a lot of computational time. Hence, these techniques are not suitable for applications that require the imputation to be performed on demand and near real-time. The paper proposes a computational intelligence based architecture for online data imputation and extended versions of an existing offline data imputation method as well. The proposed online imputation technique has 2 stages. In stage 1, Evolving Clustering Method (ECM) is used to replace the missing values with cluster centers, as part of the local learning strategy. Stage 2 refines the resultant approximate values using a General Regression Neural Network (GRNN) as part of the global approximation strategy. We also propose extended versions of an existing offline imputation technique. The offline imputation techniques employ K-Means or K-Medoids and Multi Layer Perceptron (MLP)or GRNN in Stage-1and Stage-2respectively. Several experiments were conducted on 8benchmark datasets and 4 bank related datasets to assess the effectiveness of the proposed online and offline imputation techniques. In terms of Mean Absolute Percentage Error (MAPE), the results indicate that the difference between the proposed best offline imputation method viz., K-Medoids+GRNN and the proposed online imputation method viz., ECM+GRNN is statistically insignificant at a 1% level of significance. Consequently, the proposed online technique, being less expensive and faster, can be employed for imputation instead of the existing and proposed offline imputation techniques. This is the significant outcome of the study. Furthermore, GRNN in stage-2 uniformly reduced MAPE values in both offline and online imputation methods on all datasets.

Clustering Method of Weighted Preference Using K-means Algorithm and Bayesian Network for Recommender System (추천시스템을 위한 k-means 기법과 베이시안 네트워크를 이용한 가중치 선호도 군집 방법)

  • Park, Wha-Beum;Cho, Young-Sung;Ko, Hyung-Hwa
    • Journal of Information Technology Applications and Management
    • /
    • v.20 no.3_spc
    • /
    • pp.219-230
    • /
    • 2013
  • Real time accessiblity and agility in Ubiquitous-commerce is required under ubiquitous computing environment. The Research has been actively processed in e-commerce so as to improve the accuracy of recommendation. Existing Collaborative filtering (CF) can not reflect contents of the items and has the problem of the process of selection in the neighborhood user group and the problems of sparsity and scalability as well. Although a system has been practically used to improve these defects, it still does not reflect attributes of the item. In this paper, to solve this problem, We can use a implicit method which is used by customer's data and purchase history data. We propose a new clustering method of weighted preference for customer using k-means clustering and Bayesian network in order to improve the accuracy of recommendation. To verify improved performance of the proposed system, we make experiments with dataset collected in a cosmetic internet shopping mall.

Character Recognition of Vehicle Number Plate using Modular Neural Network (모듈라 신경망을 이용한 자동차 번호판 문자인식)

  • Park, Chang-Seok;Kim, Byeong-Man;Seo, Byung-Hoon;Lee, Kwang-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.4
    • /
    • pp.409-415
    • /
    • 2003
  • Recently, the modular learning are very popular and receive much attention for pattern classification. The modular learning method based on the "divide and conquer" strategy can not only solve the complex problems, but also reach a better result than a single classifier′s on the learning quality and speed. In the neural network area, some researches that take the modular learning approach also have been made to improve classification performance. In this paper, we propose a simple modular neural network for characters recognition of vehicle number plate and evaluate its performance on the clustering methods of feature vectors used in constructing subnetworks. We implement two clustering method, one is grouping similar feature vectors by K-means clustering algorithm, the other grouping unsimilar feature vectors by our proposed algorithm. The experiment result shows that our algorithm achieves much better performance.

Analyzing Offshore Wind Power Patent Portfolios by Using Data Clustering

  • Chang, Shu-Hao;Fan, Chin-Yuan
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.1
    • /
    • pp.107-115
    • /
    • 2014
  • Offshore wind power has been extremely popular in recent years, and in the energy technology field, relevant research has been increasingly conducted. However, research regarding patent portfolios is still insufficient. The purpose of this research is to study the status of mainstream offshore wind power technology and patent portfolios and to investigate major assignees and countries to obtain a thorough understanding of the developmental trends of offshore wind power technology. The findings may be used by the government and industry for designing additional strategic development proposals. Data mining methods, such as multiple correspondence analyses and k-means clustering, were implemented to explore the competing technological and strategic-group relationships within the offshore wind power industry. The results indicate that the technological positions and patent portfolios of the countries and manufacturers are different. Additional technological development strategy recommendations were proposed for the offshore wind power industry.