• Title/Summary/Keyword: K-means 알고리즘

Search Result 770, Processing Time 0.033 seconds

Latent Semantic Indexing Analysis of K-Means Document Clustering for Changing Index Terms Weighting (색인어 가중치 부여 방법에 따른 K-Means 문서 클러스터링의 LSI 분석)

  • Oh, Hyung-Jin;Go, Ji-Hyun;An, Dong-Un;Park, Soon-Chul
    • The KIPS Transactions:PartB
    • /
    • v.10B no.7
    • /
    • pp.735-742
    • /
    • 2003
  • In the information retrieval system, document clustering technique is to provide user convenience and visual effects by rearranging documents according to the specific topics from the retrieved ones. In this paper, we clustered documents using K-Means algorithm and present the effect of index terms weighting scheme on the document clustering. To verify the experiment, we applied Latent Semantic Indexing approach to illustrate the clustering results and analyzed the clustering results in 2-dimensional space. Experimental results showed that in case of applying local weighting, global weighting and normalization factor, the density of clustering is higher than those of similar or same weighting schemes in 2-dimensional space. Especially, the logarithm of local and global weighting is noticeable.

Improvement of Cognitive Rehabilitation Method using K-means Algorithm (K-MEANS 알고리즘을 이용한 인지 재활 훈련 방법의 개선)

  • Cho, Ha-Yeon;Lee, Hyeok-Min;Moon, Ho-Sang;Shin, Sung-Wook;Chung, Sung-Taek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.6
    • /
    • pp.259-268
    • /
    • 2018
  • The purpose of this study is to propose a training method customized to the level of cognitive abilities to increase users' interest and engagement while using cognitive function training contents. The level of cognitive ability of the users was based on the clustering based on the users' information and Mini-Mental Statue Examination-Korea Child test score using the K-means algorithm applied collaborative filtering. The results were applied to the integrated cognitive function training system, and the contents order and difficulty level of the cognitive function training area were recommended to the user's cognitive ability level. Particularly, the contents difficulty control was designed to give a high immersion feeling by applying the 'flow theory' method that users can repeatedly feel tension and comfort. In conclusion, the user-customized cognitive function training method proposed in this paper can be expected to be more effective and rehabilitative results than existing therapists' subjective setting of contents order and difficulty level.

OrdinalEncoder based DNN for Natural Gas Leak Prediction (천연가스 누출 예측을 위한 OrdinalEncoder 기반 DNN)

  • Khongorzul, Dashdondov;Lee, Sang-Mu;Kim, Mi-Hye
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.10
    • /
    • pp.7-13
    • /
    • 2019
  • The natural gas (NG), mostly methane leaks into the air, it is a big problem for the climate. detected NG leaks under U.S. city streets and collected data. In this paper, we introduced a Deep Neural Network (DNN) classification of prediction for a level of NS leak. The proposed method is OrdinalEncoder(OE) based K-means clustering and Multilayer Perceptron(MLP) for predicting NG leak. The 15 features are the input neurons and the using backpropagation. In this paper, we propose the OE method for labeling target data using k-means clustering and compared normalization methods performance for NG leak prediction. There five normalization methods used. We have shown that our proposed OE based MLP method is accuracy 97.7%, F1-score 96.4%, which is relatively higher than the other methods. The system has implemented SPSS and Python, including its performance, is tested on real open data.

Speaker-Independent Isolated Word Recognition Using A Modified ISODATA Method (Modified ISODATA 집단화방법을 이용한 불특정화자 단독어 인식)

  • 황우근
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1987.11a
    • /
    • pp.66-69
    • /
    • 1987
  • 본 논문은 불특정화자의 한국어 단독음인식에 관한 연구로써 새로운 집단화 방법인 Modified-ISODATA 집단화방법을 제안한다.본 알고리즘의 목적은 종래의 ISODATA 알고리즘에서 외부 고립점 처리 및 분리과정을 단순화 하고, Lumping 과정을 제거하여 정확하고도 자동화된 집단의 중심점을 찾는 것이다. 본 알고리즘을 적용한 결과, 10명의 남성 화자와 4명의 여성 화자가 발음한 11개의 ltnt자음에 대하여, 최근에 발표된 Modified K-means 방법보다 좋은 인식율을 나타내어, 보다 정확한 집단의 중심점을 찾아 내었음을 입증해보였다.

  • PDF

Areal Image Clustering using SOM with 2 Phase Learning (SOM의 2단계학습을 이용한 항공영상 클러스터링)

  • Lee, Kyunghee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.995-998
    • /
    • 2013
  • Aerial imaging is one of the most common and versatile ways of obtaining information from the Earth surface. In this paper, we present an approach by SOM(Self Organization Map) algorithm with 2 phase learning to be applied successfully to aerial images clustering due to its signal-to-noise independency. A comparison with other classical method, such as K-means and traditional SOM, of real-world areal image clustering demonstrates the efficacy of our approach.

  • PDF

Centroid Neural Network with Bhattacharyya Kernel (Bhattacharyya 커널을 적용한 Centroid Neural Network)

  • Lee, Song-Jae;Park, Dong-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.861-866
    • /
    • 2007
  • A clustering algorithm for Gaussian Probability Distribution Function (GPDF) data called Centroid Neural Network with a Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive Centroid Neural Network (CNN) and employs a kernel method for data projection. The kernel method adopted in the proposed BK-CNN is used to project data from the low dimensional input feature space into higher dimensional feature space so as the nonlinear problems associated with input space can be solved linearly in the feature space. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. With the incorporation of the kernel method, the proposed BK-CNN is capable of dealing with nonlinear separation boundaries and can successfully allocate more code vector in the region that GPDF data are densely distributed. When applied to GPDF data in an image classification probleml, the experiment results show that the proposed BK-CNN algorithm gives 1.7%-4.3% improvements in average classification accuracy over other conventional algorithm such as k-means, Self-Organizing Map (SOM) and CNN algorithms with a Bhattacharyya distance, classed as Bk-Means, B-SOM, B-CNN algorithms.

Design of Optimized pRBFNNs-based Night Vision Face Recognition System Using PCA Algorithm (PCA알고리즘을 이용한 최적 pRBFNNs 기반 나이트비전 얼굴인식 시스템 설계)

  • Oh, Sung-Kwun;Jang, Byoung-Hee
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.1
    • /
    • pp.225-231
    • /
    • 2013
  • In this study, we propose the design of optimized pRBFNNs-based night vision face recognition system using PCA algorithm. It is difficalt to obtain images using CCD camera due to low brightness under surround condition without lighting. The quality of the images distorted by low illuminance is improved by using night vision camera and histogram equalization. Ada-Boost algorithm also is used for the detection of face image between face and non-face image area. The dimension of the obtained image data is reduced to low dimension using PCA method. Also we introduce the pRBFNNs as recognition module. The proposed pRBFNNs consists of three functional modules such as the condition part, the conclusion part, and the inference part. In the condition part of fuzzy rules, input space is partitioned by using Fuzzy C-Means clustering. In the conclusion part of rules, the connection weights of pRBFNNs is represented as three kinds of polynomials such as linear, quadratic, and modified quadratic. The essential design parameters of the networks are optimized by means of Differential Evolution.

Cannie Cataract Extraction and Analysis from Pet Image by Using FCM Algorithm (FCM 알고리즘을 이용한 애견 영상에서의 백내장 추출 및 분석)

  • Kim, Min Seok;Choi, Myung Jun;Kim, Baek Cheon;Kim, Kwang Beak
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.94-96
    • /
    • 2016
  • 본 논문에서는 기존의 백내장 추출 방법을 개선하기 위해 FCM(Fuzzy C_Means) 알고리즘을 적용하여 백내장을 추출하고 분석하는 방법을 제안한다. 제안된 방법은 애견 안구 영상에서 ROI 영역을 추출한다. 추출된 ROI 영역에서 Fuzzy Stretching 기법을 적용하여 픽셀의 상한 값과 하한 값을 조정한다. 퍼지 스트레칭 기법이 적용된 ROI 영역에 Max-Min 기반 평균 이진화 기법을 적용하여 ROI 영역을 이진화한다. 그리고 퍼지 스트레칭 기법이 적용된 ROI 영역에 FCM 알고리즘을 적용하여 양자화한 후에 양자화된 ROI 영역에서 밝기 평균 이진화 기법을 적용하여 이진화한다. 따라서 Max-Min 기반 이진화 기법을 적용하여 이진화된 ROI 영역과 밝기 평균 이진화 기법을 적용하여 이진화된 ROI 영역을 AND 연산을 적용하여 백내장의 후보 영역을 추출한다. 추출된 백내장의 후보 영역에서 침식, 팽창 기법을 적용하여 ROI 영역의 픽셀 크기를 확대 또는 축소하고 타원 형태를 가진 객체 중에서 ROI의 전체 영역의 크기가 1/5보다 적은 객체를 잡음으로 간주하여 제거한다. 잡음이 제거된 백내장의 후보 영역에서 크기가 3/5이상인 영역을 백내장 영역으로 추출한다. 제안된 방법의 성능을 분석하기 위하여 기존의 백내장 추출 방법과 제안된 백내장 추출 방법을 15개의 백내장 영상을 대상으로 실험한 결과, 제안된 방법이 기존의 백내장 추출 방법보다 백내장 추출률이 개선된 것을 확인하였다.

  • PDF

Improvement of Reduction method for Ringing Artifacts in color moving-pictures using K-means algorithm (K-means 알고리즘을 사용한 칼라 동영상 링잉 노이즈 감쇄 방법의 개선)

  • Kim, Byung-Hyun;Jang, Jun-Young;Jang, Won-Woo;Choi, Hyun-Chul;Kang, Bong-Soon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.3
    • /
    • pp.576-582
    • /
    • 2011
  • In this paper, we proposed the improved Advanced Detail Enhancement algorithm that improve the blurring by the lossy compression with CODEC and reduce the ringing artifacts in restoration. The conventional algorithm needs much amount of the process by the use of RGB color space. To improve this, we only used the luminance value in YCbCr color space. We verified that the performance of the improved algorithm with Y color value, the luminance value, is equal to the conventional algorithm with RGB color value and that the operation time of the improved is shorter about 24% than the conventional through the measurement of the operation time with Kodak standard images.

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