• Water for future
• /
• v.50 no.6
• /
• pp.31-40
• /
• 2017

• The Journal of the Korea Contents Association
• /
• v.20 no.6
• /
• pp.556-578
• /
• 2020

There are many different researches about how to analyze issues based on real-time news streams. But, there are few researches which analyze issues hierarchically from news articles and even a previous research of hierarchical issue analysis make clustering speed slower as the increment of news articles. In this paper, we propose a hierarchical and incremental clustering for semi real-time issue analysis on news articles. We trained siamese neural network based weighted cosine similarity model, applied this model to k-means algorithm which is used to make word clusters and converted news articles to document vectors by using these word clusters. Finally, we initialized an issue cluster tree from document vectors, updated this tree whenever news articles happen, and analyzed issues in semi real-time. Through the experiment and evaluation, we showed that up to about 0.26 performance has been improved in terms of NMI. Also, in terms of speed of incremental clustering, we also showed about 10 times faster than before.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.31-38
• /
• 2009

Lens distortion is inevitable phenomenon in machine vision system. More and more distortion phenomenon is occurring in order to choice of lens for minimizing cost and system size. As shown above, correction of lens distortion is critical issue. However previous lens correction methods using camera model have problem such as nonlinear property and complicated operation. And recent lens correction methods using neural network also have accuracy and efficiency problem. In this study, I propose new algorithms for correction of lens distortion. Distorted image is divided based on the distortion quantity using k-means. And each divided image region is corrected by using neural network. As a result, the proposed algorithms have better accuracy than previous methods without image division.

• Journal of Korea Water Resources Association
• /
• v.34 no.4
• /
• pp.303-316
• /
• 2001

In this study, Radial Basis Function(RBF) Neural Networks Model, a kind of Hybrid Neural Networks was applied to hydrological forecasting in a small watershed. RBF Neural Networks Model has four kinds of parameters in it and consists of unsupervised and supervised training patterns. And Gaussian Kernel Function(GKF) was used among many kinds of Radial Basis Functions(RBFs). K-Means clustering algorithm was applied to optimize centers and widths which ate the parameters of GKF. The parameters of RBF Neural Networks Model such as centers, widths weights and biases were determined by the training procedures of RBF Neural Networks Model. And, with these parameters the validation procedures of RBF Neural Networks Model were carried out. RBF Neural Networks Model was applied to Wi-Stream basin which is one of the IHP Representative basins in South Korea. 10 rainfall events were selected for training and validation of RBF Neural Networks Model. The results of RBF Neural Networks Model were compared with those of Elman Neural Networks(ENN) Model. ENN Model is composed of One Step Secant BackPropagation(OSSBP) and Resilient BackPropagation(RBP) algorithms. RBF Neural Networks shows better results than ENN Model. RBF Neural Networks Model spent less time for the training of model and can be easily used by the hydrologists with little background knowledge of RBF Neural Networks Model.

• The Journal of the Korea Contents Association
• /
• v.7 no.9
• /
• pp.127-138
• /
• 2007

Due to the development of internet technology and the steady increase of turnover at B2C market many companies put a lot of work into maintaining a good relationship with internet customers. Particularly, analyzing and understanding specific customer groups are essential for effective CRM and marketing strategy Thus, this paper proposes the method to define the customers of online bookstore into several meaningful groups. Five important factors and factor scores for each respondent are obtained by Factor Analysis. Six groups are classified by Cluster Analysis and Analysis of Variance(ANOVA) is used to verify the difference between each group.

• Journal of Intelligence and Information Systems
• /
• v.7 no.2
• /
• pp.95-115
• /
• 2001

We propose classifying the venture firms into four types of knowledge management. For this purpose, we collected questionnaire data from 101 venture firms listed in KOSDAQ, and applied a unsupervised neural network algorithm SOM to obtain four clusters representing knowledge management types-High Tech Type, Organizational Knowledge Type, Information Technology Type, and Beginner Type. Based on the results, we conclude that the venture firms listed in KOSDAQ should first know its own knowledge management type, and then apply appropriate strategies to take advantage of the knowledge management impacts on the competitiveness.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2016.05a
• /
• pp.300-300
• /
• 2016

지점빈도해석은 해당 지점에서 기록된 수문자료를 바탕으로 확률론적 방법을 이용하여 해당 지역의 수문학적 현상을 해석하는 방법이다. 최근 이상 기후현상을 통해 극치 사상이 발생하고 있다. 이러한 극치 사상은 지점빈도해석을 이용하여 확률수문량을 추정하는데 많은 영향을 미친다. 특히 해당 지점의 표본 크기가 작을수록 이러한 영향은 좀 더 크게 반영 될 수 있다. 반면 지역빈도해석은 지점의 표본 수가 적거나 수문자료의 수집이 불가능한 미계측지점인 경우, 해당 지점과 수문학적으로 동질하다고 여겨지는 주변 지점들의 자료를 확보하여 확률수문량을 추정함으로써 상대적으로 지점빈도해석 보다 roubst한 추정값을 얻을 수 있다. 따라서 최근 확률수문량 산정 기법으로 지역빈도해석 방법에 관한 관심이 높아지고 있는 실정이다. 지역구분은 지역빈도해석이 지점빈도해석과 구분 될 수 있는 큰 특징이고 지역구분 결과 따라 지역의 표본 크기가 결정되기 때문에 수문학적으로 동질한 지역을 나누는 방법은 매우 중요하다고 볼 수 있다. 본 연구에서는 한강유역을 대상으로 인공신경망을 이용한 군집분석을 수행하고 구분된 지역을 이용하여 지역빈도 해석을 수행하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3C
• /
• pp.374-386
• /
• 2004

The mammogram provides the way to observe detailed internal organization of breasts to radiologists for the early detection. This paper is mainly focused on efficiently detecting the Microcalcification's Region Of Interest(ROI)s. Breast cancers can be caused from either microcalcifications or masses. Microcalcifications are appeared in a digital mammogram as tiny dots that have a little higher gray levels than their surrounding pixels. We can roughly determine the area which possibly contain microcalifications. In general, it is very challenging to find all the microcalcifications in a digital mammogram, because they are similar to some tissue parts of a breast. To efficiently detect microcalcifications ROI, we used four sequential processes; preprocessing for breast area detection, modified multilevel thresholding, ROI selection using simple thresholding filters and final ROI selection with two stages of neural networks. The filtering process with boundary conditions removes easily-distinguishable tissues while keeping all microcalcifications so that it cleans the thresholded mammogram images and speeds up the later processing by the average of 86％. The first neural network shows the average of 96.66％ recognition rate. The second neural network performs better by showing the average recognition rate 98.26％. By removing all tissues while keeping microcalcifications as much as possible, the next parts of a CAD system for detecting breast cancers can become much simpler.

• The Korean Journal of Applied Statistics
• /
• v.15 no.2
• /
• pp.251-267
• /
• 2002

Self Organizing Maps(SOM) by Kohonen is very fast algorithm in neural networks. But it doesn't show sure rules of training results. In this paper, we introduce to Bayesian Learning for Self Organizing Maps(BLSOM) which combines self organizing maps with Bayesian learning. So it supports explanatory power of models and improves prediction. BLSOM has global optima anywhere but SOM has not. This is proved by experiment in this paper.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.58-64
• /
• 2007

In pattern recognition field, there are many optimization problems having exponential search spaces. To solve of sequential search algorithms seeking sub-optimal solutions have been used. The algorithms have limitations of stopping at local optimums. Recently lots of researches attempt to solve the problems using genetic algorithms. This paper explains the huge search spaces of typical problems such as feature selection, classifier ensemble selection, neural network pruning, and clustering, and it reviews the genetic algorithms for solving them. Additionally we present several subjects worthy of noting as future researches.