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

Search Result 770, Processing Time 0.026 seconds

Integrated Clustering Method based on Syntactic Structure and Word Similarity for Statistical Machine Translation (문장구조 유사도와 단어 유사도를 이용한 클러스터링 기반의 통계기계번역)

  • Kim, Hankyong;Na, Hwi-Dong;Li, Jin-Ji;Lee, Jong-Hyeok
    • Annual Conference on Human and Language Technology
    • /
    • 2009.10a
    • /
    • pp.44-49
    • /
    • 2009
  • 통계기계번역에서 도메인에 특화된 번역을 시도하여 성능향상을 얻는 방법이 있다. 이를 위하여 문장의 유형이나 장르에 따라 클러스터링을 수행한다. 그러나 기존의 연구 중 문장의 유형 정보와 장르에 따른 정보를 동시에 사용한 경우는 없었다. 본 논문에서는 문장 사이의 문법적 구조 유사성으로 문장을 유형별로 분류하는 새로운 기법을 제시하였고, 단어 유사도 정보로 문서의 장르를 구분하여 기존의 두 기법을 통합하였다. 이렇게 분류된 말뭉치에서 추출한 모델과 전체 말뭉치에서 추출된 모델에서 보간법(interpolation)을 사용하여 통계기계번역의 성능을 향상하였다. 문장구조의 유사성과 단어 유사도 계산을 위하여 각각 커널과 코사인 유사도를 적용하였으며, 두 유사도를 적용하여 말뭉치를 분류하는 과정은 K-Means 알고리즘과 유사한 기계학습 기법을 사용하였다. 이를 일본어-영어의 특허문서에서 실험한 결과 최선의 경우 약 2.5%의 상대적인 성능 향상을 얻었다.

  • PDF

Real-Time Closed-Loop Degaussing Technique for a Minesweeper (소해함을 위한 실시간 폐회로 소자 기법)

  • Kang, Byungsu;Kim, Dong-Hun;Yang, Chang-Seob;Chung, Hyun-Ju;Kim, Dong-Wook
    • Journal of the Korean Magnetics Society
    • /
    • v.27 no.3
    • /
    • pp.98-103
    • /
    • 2017
  • In this paper, an efficient closed-loop degaussing technique is proposed to control real-time degaussing currents required for a minesweeper. To achieve this, new principle and algorithm for controling degaussing currents are presented, and they are compared to conventional ones. To validate the proposed method, a minesweeper mockup is tested by means of a rigorous numerical simulation. Results show that the method successfully yields satisfactory degaussing performances for several course angle changes of the mockup.

Sweet Spot Search of Array Antenna Beam (Array 안테나 빔의 스위트 스폿 탐색)

  • Eom, Ki-Hwan;Kang, Seong-Ho;Lee, Chang-Young;NamKung, Wook;Hyun, Kyo-Hwan
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2005.08a
    • /
    • pp.115-119
    • /
    • 2005
  • In this paper, we propose a method that search the sweet spot of array antenna beam, and keep it for fast speed transmission in millimeter wave on single array antenna link. We use TDD(Time Division Duplex) as transfer method, and it transfers the control data of antenna. The proposed method is the modified genetic algorithm which selects a superior initial group through slave-processing in order to resolve the local solution of genetic algorithm. The efficiency of the proposed method is verified by means of simulations with white Gaussian noise and not on single array antenna link.

  • PDF

Analysis of Research Trends Related to drug Repositioning Based on Machine Learning (머신러닝 기반의 신약 재창출 관련 연구 동향 분석)

  • So Yeon Yoo;Gyoo Gun Lim
    • Information Systems Review
    • /
    • v.24 no.1
    • /
    • pp.21-37
    • /
    • 2022
  • Drug repositioning, one of the methods of developing new drugs, is a useful way to discover new indications by allowing drugs that have already been approved for use in people to be used for other purposes. Recently, with the development of machine learning technology, the case of analyzing vast amounts of biological information and using it to develop new drugs is increasing. The use of machine learning technology to drug repositioning will help quickly find effective treatments. Currently, the world is having a difficult time due to a new disease caused by coronavirus (COVID-19), a severe acute respiratory syndrome. Drug repositioning that repurposes drugsthat have already been clinically approved could be an alternative to therapeutics to treat COVID-19 patients. This study intends to examine research trends in the field of drug repositioning using machine learning techniques. In Pub Med, a total of 4,821 papers were collected with the keyword 'Drug Repositioning'using the web scraping technique. After data preprocessing, frequency analysis, LDA-based topic modeling, random forest classification analysis, and prediction performance evaluation were performed on 4,419 papers. Associated words were analyzed based on the Word2vec model, and after reducing the PCA dimension, K-Means clustered to generate labels, and then the structured organization of the literature was visualized using the t-SNE algorithm. Hierarchical clustering was applied to the LDA results and visualized as a heat map. This study identified the research topics related to drug repositioning, and presented a method to derive and visualize meaningful topics from a large amount of literature using a machine learning algorithm. It is expected that it will help to be used as basic data for establishing research or development strategies in the field of drug repositioning in the future.

A Study on Modified Mask for Edge Detection in AWGN Environment (AWGN 환경에서 에지 검출을 위한 변형된 마스크에 관한 연구)

  • Lee, Chang-Young;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.9
    • /
    • pp.2199-2205
    • /
    • 2013
  • In modern society the image processing has been applied to various digital devices such as smartphone, digital camera, and digital TV. In the field of image processing the edge detection is one of the important parts in the image processing procedure. The image edge means point that the pixel value is changed between background and object rapidly, and includes the important information such as magnitude, location, and orientation. The performance of the existing edge detection method is insufficient for the image degraded by AWGN(additive white Gaussian noise) because it detects edges by using small weighted masks. Therefore, in this paper, to detect edge in AWGN environment effectively, we proposed an algorithm that detects edge as calculated gradient of sorting vector which is transformed by estimated mask from new pixel according to each region.

Fast VQ Codebook Design by Sucessively Bisectioning of Principle Axis (주축의 연속적 분할을 통한 고속 벡터 양자화 코드북 설계)

  • Kang, Dae-Seong;Seo, Seok-Bae;Kim, Dai-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.4
    • /
    • pp.422-431
    • /
    • 2000
  • This paper proposes a new codebook generation method, called a PCA-Based VQ, that incorporates the PCA (Principal Component Analysis) technique into VQ (Vector Quantization) codebook design. The PCA technique reduces the data dimensions by transforming input image vectors into the feature vectors. The cluster of feature vectors in the transformed domain is bisectioned into two subclusters by an optimally chosen partitioning hyperplane. We expedite the searching of the optimal partitioning hyperplane that is the most time consuming process by considering that (1) the optimal partitioning hyperplane is perpendicular to the first principal axis of the feature vectors, (2) it is located on the equilibrium point of the left and right cluster's distortions, and (3) the left and right cluster's distortions can be adjusted incrementally. This principal axis bisectioning is successively performed on the cluster whose difference of distortion between before and after bisection is the maximum among the existing clusters until the total distortion of clusters becomes as small as the desired level. Simulation results show that the proposed PCA-based VQ method is promising because its reconstruction performance is as good as that of the SOFM (Self-Organizing Feature Maps) method and its codebook generation is as fast as that of the K-means method.

  • PDF

(A) study on location correction method of indoor/outdoor 3D model through data integration of BIM and GIS (BIM과 GIS 데이터 융합을 통한 실내외 3차원 모델 위치보정 방안 연구)

  • Kim, Ji-Eun;Hong, Chang-Hee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.3
    • /
    • pp.56-62
    • /
    • 2017
  • As the need for 3D spatial information increases, many local governments and related industries are establishing map-based 3D spatial information services and offering them to users. In these services, positional accuracy is one of the most important factors determining their applicability to specific tasks. This study studied the location correction method between indoor and outdoor 3D spatial information through the construction of modeling data on a BIM/GIS platform. First, we selected the sites and processed the BIM/GIS data construction with 3 steps. When connecting the BIM model including indoor spatial data and 3D texturing model based on ortho images, mismatches occurred, so we proposed a location correction method. Using the conversion algorithm, the relative coordinate-based BIM data were converted to the absolute positions and then relocated by means of the texturing data on the BIM/GIS platform.

Implementation of Multiple Sensor Data Fusion Algorithm for Fire Detection System

  • Park, Jung Kyu;Nam, Kihun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.7
    • /
    • pp.9-16
    • /
    • 2020
  • In this paper, we propose a prototype design and implementation of a fire detection algorithm using multiple sensors. The proposed topic detection system determines fire by applying rules based on data from multiple sensors. The fire takes about 3 to 5 minutes, which is the optimal time for fire detection. This means that timely identification of potential fires is important for fire management. However, current fire detection devices are very vulnerable to false alarms because they rely on a single sensor to detect smoke or heat. Recently, with the development of IoT technology, it is possible to integrate multiple sensors into a fire detector. In addition, the fire detector has been developed with a smart technology that can communicate with other objects and perform programmed tasks. The prototype was produced with a success rate of 90% and a false alarm rate of 10% based on 10 actual experiments.

Design of Optimized Pattern Recognizer by Means of Fuzzy Neural Networks Based on Individual Input Space (개별 입력 공간 기반 퍼지 뉴럴 네트워크에 의한 최적화된 패턴 인식기 설계)

  • Park, Keon-Jun;Kim, Yong-Kab;Kim, Byun-Gon;Hoang, Geun-Chang
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.181-189
    • /
    • 2013
  • In this paper, we introduce the fuzzy neural network based on the individual input space to design the pattern recognizer. The proposed networks configure the network by individually dividing each input space. The premise part of the networks is independently composed of the fuzzy partition of individual input spaces and the consequence part of the networks is represented by polynomial functions. The learning of fuzzy neural networks is realized by adjusting connection weights of the neurons in the consequent part of the fuzzy rules and it follows a back-propagation algorithm. In addition, in order to optimize the parameters of the proposed network, we use real-coded genetic algorithms. Finally, we design the optimized pattern recognizer using the experimental data for pattern recognition.

A Study on Bicycle Route Selection Considering Topographical Characteristics (지형적 특성을 고려한 자전거 경로 선정에 관한 연구)

  • Yang, Jung Lan;Jun, Chul Min
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.21 no.3
    • /
    • pp.3-9
    • /
    • 2013
  • As interest in green growth picks up, the importance of bicycles which are an environment friendly means of communication has been magnified. However, bicycle routes which are the base of bicycles are designed without considering topographic elements and thus many users are experiencing inconvenience in using bicycles. The present study presents a routing technique to select optimal routes when selecting routes in commuting to school utilizing bicycles. To this end, a formula for optimum route calculation considering slope and intersections was drawn and a method to select optimum routes by applying modified Dijkstra Algorithms was studied. According to the results, the bicycle routes for commuting to school should be selected by the shortest time rather than the shortest distances to the destination, because it required reach the destination faster. Therefore when selecting the routes, it must be based on the shortest time considering waiting time due to crosswalks or crossroads and speed variations due to slopes.