• Title/Summary/Keyword: K-Means clustering algorithm

Search Result 548, Processing Time 0.022 seconds

A Study on Fault Diagnosis of Boiler Tube Leakage based on Neural Network using Data Mining Technique in the Thermal Power Plant (데이터마이닝 기법을 이용한 신경망 기반의 화력발전소 보일러 튜브 누설 고장 진단에 관한 연구)

  • Kim, Kyu-Han;Lee, Heung-Seok;Jeong, Hee-Myung;Kim, Hyung-Su;Park, June-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.10
    • /
    • pp.1445-1453
    • /
    • 2017
  • In this paper, we propose a fault detection model based on multi-layer neural network using data mining technique for faults due to boiler tube leakage in a thermal power plant. Major measurement data related to faults are analyzed using statistical methods. Based on the analysis results, the number of input data of the proposed fault detection model is simplified. Then, each input data is clustering with normal data and fault data by applying K-Means algorithm, which is one of the data mining techniques. fault data were trained by the neural network and tested fault detection for boiler tube leakage fault.

Generalized Fuzzy Modeling

  • Hwang, Hee-Soo;Joo, Young-Hoon;Woo, Kwang-Bang
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1145-1150
    • /
    • 1993
  • In this paper, two methods of fuzzy modeling are prsented to describe the input-output relationship effectively based on relation characteristics utilizing simplified reasoning and neuro-fuzzy reasoning. The methods of modeling by the simplified reasoning and the neuro-fuzzy reasoning are used when the input-output relation of a system is 'crisp' and 'fuzzy', respectively. The structure and the parameter identification in the modeling method by the simplified reasoning are carried out by means of FCM clustering and the proposed GA hybrid scheme, respectively. The structure and the parameter identification in the modeling method by the neuro-fuzzy reasoning are carried out by means of GA and BP algorithm, respectively. The feasibility of the proposed methods are evaluated through simulation.

  • PDF

KNN/PFCM Hybrid Algorithm for Indoor Location Determination in WLAN (WLAN 실내 측위 결정을 위한 KNN/PFCM Hybrid 알고리즘)

  • Lee, Jang-Jae;Jung, Min-A;Lee, Seong-Ro
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.6
    • /
    • pp.146-153
    • /
    • 2010
  • For the indoor location, wireless fingerprinting is most favorable because fingerprinting is most accurate among the technique for wireless network based indoor location which does not require any special equipments dedicated for positioning. As fingerprinting method,k-nearest neighbor(KNN) has been widely applied for indoor location in wireless location area networks(WLAN), but its performance is sensitive to number of neighborsk and positions of reference points(RPs). So possibilistic fuzzy c-means(PFCM) clustering algorithm is applied to improve KNN, which is the KNN/PFCM hybrid algorithm presented in this paper. In the proposed algorithm, through KNN,k RPs are firstly chosen as the data samples of PFCM based on signal to noise ratio(SNR). Then, thek RPs are classified into different clusters through PFCM based on SNR. Experimental results indicate that the proposed KNN/PFCM hybrid algorithm generally outperforms KNN and KNN/FCM algorithm when the locations error is less than 2m.

Cluster analysis of city-level carbon mitigation in South Korea

  • Zhuo Li
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.7
    • /
    • pp.189-198
    • /
    • 2023
  • The phenomenon of climate change is deteriorating which increased heatwaves, typhoons and heavy snowfalls in recent years. Followed by the 25th United nations framework convention on climate change(COP25), the world countries have achieved a consensus on achieving carbon neutrality. City plays a crucial role in achieving carbon mitigation as well as economic development. Considering economic and environmental factors, we selected 63 cities in South Korea to analyze carbon emission situation by Elbow method and K-means clustering algorithm. The results reflected that cities in South Korea can be categorized into 6 clusters, which are technology-intensive cities, light-manufacturing intensive cities, central-innovation intensive cities, heavy-manufacturing intensive cities, service-intensive cities, rural and household-intensive cities. Specific suggestions are provided to improve city-level carbon mitigation development.

Equalizationof nonlinear digital satellite communicatio channels using a complex radial basis function network (Complex radial basis function network을 이용한 비선형 디지털 위성 통신 채널의 등화)

  • 신요안;윤병문;임영선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.9
    • /
    • pp.2456-2469
    • /
    • 1996
  • A digital satellite communication channel has a nonlinearity with memory due to saturation characeristis of the high poer amplifier in the satellite and transmitter/receiver linear filter used in the overall system. In this paper, we propose a complex radial basis function network(CRBFN) based adaptive equalizer for compensation of nonlinearities in digital satellite communication channels. The proposed CRBFN untilizes a complex-valued hybrid learning algorithm of k-means clustering and LMS(least mean sequare) algorithm that is an extension of Moody Darken's algorithm for real-valued data. We evaluate performance of CRBFN in terms of symbol error rates and mean squared errors nder various noise conditions for 4-PSK(phase shift keying) digital modulation schemes and compare with those of comples pth order inverse adaptive Volterra filter. The computer simulation results show that the proposed CRBFN ehibits good equalization, low computational complexity and fast learning capabilities.

  • PDF

Local Projective Display of Multivariate Numerical Data

  • Huh, Myung-Hoe;Lee, Yong-Goo
    • The Korean Journal of Applied Statistics
    • /
    • v.25 no.4
    • /
    • pp.661-668
    • /
    • 2012
  • For displaying multivariate numerical data on a 2D plane by the projection, principal components biplot and the GGobi are two main tools of data visualization. The biplot is very useful for capturing the global shape of the dataset, by representing $n$ observations and $p$ variables simultaneously on a single graph. The GGobi shows a dynamic movie of the images of $n$ observations projected onto a sequence of unit vectors floating on the $p$-dimensional sphere. Even though these two methods are certainly very valuable, there are drawbacks. The biplot is too condensed to describe the detailed parts of the data, and the GGobi is too burdensome for ordinary data analyses. In this paper, "the local projective display(LPD)" is proposed for visualizing multivariate numerical data. Main steps of the LDP are 1) $k$-means clustering of the data into $k$ subsets, 2) drawing $k$ principal components biplots of individual subsets, and 3) sequencing $k$ plots by Hurley's (2004) endlink algorithm for cognitive continuity.

Detection of Traffic Anomalities using Mining : An Empirical Approach (마이닝을 이용한 이상트래픽 탐지: 사례 분석을 통한 접근)

  • Kim Jung-Hyun;Ahn Soo-Han;Won You-Jip;Lee Jong-Moon;Lee Eun-Young
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.3
    • /
    • pp.201-217
    • /
    • 2006
  • In this paper, we collected the physical traces from high speed Internet backbone traffic and analyze the various characteristics of the underlying packet traces. Particularly, our work is focused on analyzing the characteristics of an anomalous traffic. It is found that in our data, the anomalous traffic is caused by UDP session traffic and we determined that it was one of the Denial of Service attacks. In this work, we adopted the unsupervised machine learning algorithm to classify the network flows. We apply the k-means clustering algorithm to train the learner. Via the Cramer-Yon-Misses test, we confirmed that the proposed classification method which is able to detect anomalous traffic within 1 second can accurately predict the class of a flow and can be effectively used in determining the anomalous flows.

Automatic Color Palette Extraction for Paintings Using Color Grouping and Clustering (색상 그룹핑과 클러스터링을 이용한 회화 작품의 자동 팔레트 추출)

  • Lee, Ik-Ki;Lee, Chang-Ha;Park, Jae-Hwa
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.7
    • /
    • pp.340-353
    • /
    • 2008
  • A computational color palette extraction model is introduced to describe paint brush objectively and efficiently. In this model, a color palette is defined as a minimum set of colors in which a painting can be displayed within error allowance and extracted by the two step processing of color grouping and major color extraction. The color grouping controls the resolution of colors adaptively and produces a basic color set of given painting images. The final palette is obtained from the basic color set by applying weighted k-means clustering algorithm. The extracted palettes from several famous painters are displayed in a 3-D color space to show the distinctive palette styles using RGB and CIE LAB color models individually. And the two experiments of painter classification and color transform of photographic image has been done to check the performance of the proposed method. The results shows the possibility that the proposed palette model can be a computational color analysis metric to describe the paint brush, and can be a color transform tool for computer graphics.

Determination of representative emotional style of speech based on k-means algorithm (k-평균 알고리즘을 활용한 음성의 대표 감정 스타일 결정 방법)

  • Oh, Sangshin;Um, Se-Yun;Jang, Inseon;Ahn, Chung Hyun;Kang, Hong-Goo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.38 no.5
    • /
    • pp.614-620
    • /
    • 2019
  • In this paper, we propose a method to effectively determine the representative style embedding of each emotion class to improve the global style token-based end-to-end speech synthesis system. The emotion expressiveness of conventional approach was limited because it utilized only one style representative per each emotion. We overcome the problem by extracting multiple number of representatives per each emotion using a k-means clustering algorithm. Through the results of listening tests, it is proved that the proposed method clearly express each emotion while distinguishing one emotion from others.

An optimal feature selection algorithm for the network intrusion detection system (네트워크 침입 탐지를 위한 최적 특징 선택 알고리즘)

  • Jung, Seung-Hyun;Moon, Jun-Geol;Kang, Seung-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.342-345
    • /
    • 2014
  • Network intrusion detection system based on machine learning methods is quite dependent on the selected features in terms of accuracy and efficiency. Nevertheless, choosing the optimal combination of features from generally used features to detect network intrusion requires extensive computing resources. For instance, the number of possible feature combinations from given n features is $2^n-1$. In this paper, to tackle this problem we propose a optimal feature selection algorithm. Proposed algorithm is based on the local search algorithm, one of representative meta-heuristic algorithm for solving optimization problem. In addition, the accuracy of clusters which obtained using selected feature components and k-means clustering algorithm is adopted to evaluate a feature assembly. In order to estimate the performance of our proposed algorithm, comparing with a method where all features are used on NSL-KDD data set and multi-layer perceptron.

  • PDF