• 한국CDE학회논문집
• /
• 제11권3호
• /
• pp.211-222
• /
• 2006

In collaborative environment, it is necessary that the participants in collaboration should share the same understanding about the semantics of terms. For example, they should know that 'COMPONENT' and 'ITEM' are different word-expressions for the same meaning. In order to handle such problems in information sharing, an information system needs to automatically recognize that the terms have the same semantics. So we develop an algorithm mapping two terms based on their ontological definitions and their similarities. The proposed algorithm consists of four steps: the character matching, the inferencing, the definition comparing and the similarity checking. In the similarity checking step, we consider relation similarity and hierarchical similarity. The algorithm is very primitive, but it shows the possibility of semi-automatic mapping using ontology. In addition, we design a mapping procedure for a mapping system, called SOM (semantic ontology mapper).

• 대한기계학회논문집
• /
• 제17권12호
• /
• pp.3063-3072
• /
• 1993

The layout is an important and difficult problem in industrial applications like sheet metal manufacturing, garment making, circuit layout, plant layout, and land development. The module layout problem is known to be non-deterministic polynomial time complete(NP-complete). To efficiently find an optimal layout from a large number of candidate layout configuration a heuristic algorithm could be used. In recent years, a number of researchers have investigated the combinatorial optimization problems by using neural network principles such as traveling salesman problem, placement and routing in circuit design. This paper describes the application of Self-organizing Feature Maps(SOM) of the Kohonen network and Simulated Annealing Algorithm(SAA) to the layout problem of the two-dimensional rectangular shapes.

• 전기전자학회논문지
• /
• 제12권4호
• /
• pp.217-224
• /
• 2008

This paper provides a framework for semantic correspondence of heterogeneous databases using self- organizing map. It solves the problem of overlapping between different databases due to their different schemas. Clustering technique using self-organizing maps (SOM) is tested and evaluated to assess its performance when using different kinds of data. Preprocessing of database is performed prior to clustering using edit distance algorithm, principal component analysis (PCA), and normalization function to identify the features necessary for clustering.

• 디지털산업정보학회논문지
• /
• 제12권4호
• /
• pp.33-40
• /
• 2016

Previous works for detecting arrhythmia have mostly used nonlinear method to increase classification accuracy. Most methods require accurate detection of ECG signal, higher computational cost and larger processing time. But it is difficult to analyze the ECG signal because of various noise types. Also in the healthcare system based IOT that must continuously monitor people's situation, it is necessary to process ECG signal in realtime. Therefore it is necessary to design efficient algorithm that classifies different arrhythmia in realtime and decreases computational cost by extrating minimal feature. In this paper, we propose R wave detection considering complexity and arrhythmia classification based on binary coding. For this purpose, we detected R wave through SOM and then RR interval from noise-free ECG signal through the preprocessing method. Also, we classified arrhythmia in realtime by converting threshold variability of feature to binary code. R wave detection and PVC, PAC, Normal classification is evaluated by using 39 record of MIT-BIH arrhythmia database. The achieved scores indicate the average of 99.41%, 97.18%, 94.14%, 99.83% in R wave, PVC, PAC, Normal.

• Journal of Information Processing Systems
• /
• 제14권3호
• /
• pp.694-708
• /
• 2018

China possesses a passenger dedicated line system of large scale, passenger flow intensity with uneven distribution, and passenger nodes with complicated relations. Consequently, the significance of passenger nodes shall be considered and the dissimilarity of passenger nodes shall be analyzed in compiling passenger train operation and conducting transportation allocation. For this purpose, the passenger nodes need to be hierarchically divided. Targeting at problems such as hierarchical dividing process vulnerable to subjective factors and local optimum in the current research, we propose a clustering approach based on self-organizing map (SOM) and k-means, and then, harnessing the new approach, hierarchical dividing of passenger dedicated line passenger nodes is effectuated. Specifically, objective passenger nodes parameters are selected and SOM is used to give a preliminary passenger nodes clustering firstly; secondly, Davies-Bouldin index is used to determine the number of clusters of the passenger nodes; and thirdly, k-means is used to conduct accurate clustering, thus getting the hierarchical dividing of passenger nodes. Through example analysis, the feasibility and rationality of the algorithm was proved.

• 한국정밀공학회지
• /
• 제12권7호
• /
• pp.32-45
• /
• 1995

In this paper, we present a new method to tool path planning problem for rough cut of pocket milling operations. The key idea is to formulate the tool path problem into a TSP (Travelling Salesman Problem) so that the powerful neural network approach can be effectively applied. Specifically, our method is composed of three procedures: a) discretization of the pocket area into a finite number of tool points, b) neural network approach (called SOM-Self Organizing Map) for path finding, and c) postprocessing for path smoothing and feedrate adjustment. By the neural network procedure, an efficient tool path (in the sense of path length and tool retraction) can be robustly obtained for any arbitrary shaped pockets with many islands. In the postprocessing, a) the detailed shape of the path is fine tuned by eliminating sharp corners of the path segments, and b) any cross-overs between the path segments and islands. With the determined tool path, the feedrate adjustment is finally performed for legitimate motion without requiring excessive cutting forces. The validity and powerfulness of the algorithm is demonstrated through various computer simulations and real machining.

• 한국컴퓨터정보학회논문지
• /
• 제23권12호
• /
• pp.43-48
• /
• 2018

In this paper, more efficient classification result could be obtained by applying the combination of the Hidden Markov Model and SVM Model to HMSV algorithm gene expression data which simulated the stochastic flow of gene data and clustering it. In this paper, we verified the HMSV algorithm that combines independently learned algorithms. To prove that this paper is superior to other papers, we tested the sensitivity and specificity of the most commonly used classification criteria. As a result, the K-means is 71% and the SOM is 68%. The proposed HMSV algorithm is 85%. These results are stable and high. It can be seen that this is better classified than using a general classification algorithm. The algorithm proposed in this paper is a stochastic modeling of the generation process of the characteristics included in the signal, and a good recognition rate can be obtained with a small amount of calculation, so it will be useful to study the relationship with diseases by showing fast and effective performance improvement with an algorithm that clusters nodes by simulating the stochastic flow of Gene Data through data mining of BigData.

• 정보관리학회지
• /
• 제25권2호
• /
• pp.49-68
• /
• 2008

지금까지의 정보검색 연구에서 데이터 융합 기법을 이용한 문서 검색은 하나의 알고리즘에 의한 검색에 비하여 많은 경우에 효율성이 높은 결과를 얻을 수 있었다. 하지만 이미지 검색에서 상이한 알고리즘을 이용한 다수의 검색 결과를 합쳐 하나의 검색결과를 얻는 데이터 융합 기법의 사용은 많지 않았다. 이 연구에서는 소벨 연산자를 이용한 윤곽선 검출과 자기조직화 지도 알고리즘에 의한 두 검색 결과를 융합하여 각각의 알고리즘에 의한 검색결과 보다 높은 효율성을 보여주는 방법을 제시하였다. 이 연구에서는 상용 클립아트 이미지를 이용하여 사람의 주관적인 적합성 판단을 배제한 검색 실험 데이터를 만들어 사용하였다.

• 한국통신학회논문지
• /
• 제31권2C호
• /
• pp.208-218
• /
• 2006

본 논문에서는 최신의 공격 유형을 잘 분류해 내고, 기존 공격의 변형이나 새로운 공격에도 탐지 가능하도록 데이터 마이닝 기법을 이용한 공격 탐지 모델 생성 방법들을 소개하고, 다양한 실험을 통해 탐지율 및 탐지 시간 측면에서 이 모델들의 성능을 비교한다. 이러한 탐지 모델을 생성하는데 중요한 요소로 데이터, 속성, 탐지 알고리즘을 꼽을 수 있는데, 실제 네트워크에서 수집된 NetFlow 데이터와 대량의 KDD Cup 1999 데이터를 사용하였다. 또한 탐지 알고리즘으로서 단일 지도/비지도학습 데이터 마이닝 기법 및 결합된 방법을 이용하여 탐지 모델을 생성, 비교 실험하였다. 시험 결과, 결합된 지도학습 알고리즘을 사용한 경우 모델링 시간은 길었지만 가장 탐지율이 높았고, 모든 경우 탐지 시간이 1초 내외로 실시간 탐지 가능성을 입증할 수 있었다. 또한 새로운 공격에 대한 이상탐지 결과로도 92$\%$ 이상의 탐지율을 보임으로 탐지 가능성을 입증할 수 있었고, SOM 기법을 사용하는 경우에는 새로운 공격이 기존 어느 공격에 유사한 특성을 갖는지에 대한 부과적인 정보도 제공하였다.

• 컴퓨터교육학회논문지
• /
• 제6권4호
• /
• pp.37-47
• /
• 2003

본 논문에서는 영상의 소유권 보호를 위해 DCT계수들의 자기유사성(self-similarity)을 이용한 새로운 디지털 워터마킹 기법을 제시한다. 신경회로망 중 SOM(Self-Organizing Map)을 이용하여 유사한 계수를 분류하고 클러스터들 중 선택된 클러스터에 워터마크를 삽입한다. 일반적으로 영상의 고주파 영역에 삽입된 워터마크는 JPEG압축 같은 압축처리에 의해 쉽게 제거된다. 그리고 저주파 영역에 삽입된 워터마크는 영상의 화질을 훼손시킨다. 따라서 중간주파수 영역에서 많은 계수들을 가지는 클러스터에 워터마크를 삽입한다. 이 알고리즘은 선택된 클러스터 내의 계수들의 개수에 따라 워터마크를 영상에 삽입함으로써 영상의 훼손을 줄여준다. 워터마크가 삽입된 영상으로부터 워터마크를 검출하기위해 원영상없이 선택된 클러스터를 이용한다. 실험을 통해 새로 제안된 알고리즘은 영상의 좋은 화질과 JPEG 압축, 필터링과 같은 영상처리, 축소와 학대, 잘라내기 같은 기하학적 변환, 자음과 같은 공격에 아주 강인하다.