• The Korean Journal of Applied Statistics
• /
• v.36 no.5
• /
• pp.473-488
• /
• 2023

Gangwon-do is one of Korea's most popular tourist destinations, with varying tourism demands and trends across its subregions. It is crucial to identify the characteristics of tourism in each area and compare the tourism patterns over time to devise policies that revitalize tourism in each local government and promote balanced development across regions. In this paper, we classify the regions in Gangwon-do based on tourism data from the last four years and analyze the tourism pattern of each region using the non-Euclidean additive model proposed by Jeon et al. (2021). The model incorporates the proportions of visitors by age groups and the proportions of navigation searches by destination types as two covariates, and the proportions of tourism expenditure types as a response variable. We estimate the model using the smooth-backfitting method and coordinate-wise bandwidth selection. The results are visualized in ternary plots, and changes in tourism patterns over time are analyzed by comparing the ratios of prediction errors to fitting errors.

• Journal of Korean Society of Transportation
• /
• v.36 no.2
• /
• pp.98-111
• /
• 2018

Truck platooning, which is a cluster of trucks in support of vehicle-to-vehicle communication and automated longitudinal vehicle control, is a promising method to both operational efficiency and prevent traffic crashes. Although a variety of studies have been conducted to identify the effects of vehicle platooning on traffic stream, we are not aware of any study attempting to identify promising road segments for vehicle platooning. This study aims to develop a methodology for determining the priority of freeway segments that would potentially lead to maximize the effectiveness of truck platooning. Evaluation measures derived in this study includes truck crash rates, the percentage of truck traffic, segment length, and the number of entry and exit points. Weighting values obtained from an analytical hierarchical process (AHP) method were applied to compute the proposed priority score to determine better freeway segment for truck platooning. Results suggested that a 46.9km freeway segment, from Sacheon IC to Sanin JC, was the most promising segment for maximizing the effectiveness of truck platooning. It is expected that the outcome of this study would be effectively used as a fundamental to establish operational strategies for truck platooning.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.319-326
• /
• 2009

PSO(Particle Swarm Optimization) is an optimization algorithm in which simple particles search an optimal solution using shared information acquired through their own experiences. PSO applications are so numerous and diverse. Lots of researches have been made mainly on the parameter settings, topology, particle's movement in order to achieve fast convergence to proper regions of search space for optimization. In standard PSO, since each particle uses only information of its and best neighbor, swarm does not explore diverse regions and intended to premature to local optima. In this paper, we propose a new particle's movement strategy in order to explore diverse regions of search space. The strategy is that each particle moves according to relative weights of several better neighbors. The strategy of exploring diverse regions is effective and produces less local optimizations and accelerating of the optimization speed and higher success rates than standard PSO. Also, in order to raise success rates, we propose a strategy for checking whether swarm falls into local optimum. The new PSO algorithm with these two strategies shows the improvement in the search speed and success rate in the test of benchmark functions.

• The Journal of the Korea Contents Association
• /
• v.7 no.5
• /
• pp.16-26
• /
• 2007

Because it is difficult on existing document retrieval systems to visualize the search result, search results show document titles and short summaries of the parts that include the search keywords. If the result list is long, it is difficult to examine all the documents at once and to find a relation among them. This study uses clustering to classify similar documents into groups to make it easy to grasp the relations among the searched documents. Also, this study proposes a two-level visualization algorithm such that, first, the center of clusters is projected to low-dimensional space by using multi-dimensional scaling to help searchers grasp the relation among clusters at a glance, and second, individual documents are drawn in low-dimensional space based on the center of clusters using the orbital model as a basis to easily confirm similarities among individual documents. This study is tested on the benchmark data and the real data, and it shows that it is possible to visualize search results in real time.

• The KIPS Transactions:PartB
• /
• v.16B no.3
• /
• pp.195-202
• /
• 2009

In this paper, we propose the regions segmentation method of the white matter and the gray matter for brain MR image by using the ant colony optimization algorithm. Ant Colony Optimization (ACO) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. This algorithm finds the expected pixel for image as the real ant finds the food from nest to food source. Then ants deposit pheromone on the pixels, and the pheromone will affect the motion of next ants. At each iteration step, ants will change their positions in the image according to the transition rule. Finally, we can obtain the segmentation results through analyzing the pheromone distribution in the image. We compared the proposed method with other threshold methods, viz. the Otsu' method, the genetic algorithm, the fuzzy method, and the original ant colony optimization algorithm. From comparison results, the proposed method is more exact than other threshold methods for the segmentation of specific region structures in MR brain image.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.511-511
• /
• 2023

기후변화로 동절기 기온 저하에 따른 수도계량기의 동파는 지속적으로 심화되고 있으며, 이는 계량기 교체 비용, 누수, 누수량 동결에 의한 2차 피해, 단수 등 사회적 문제를 야기한다. 이와같은 문제를 해결하고자 구조적 대책으로 개별 가정에서 동파 방지형 계량기를 설치할 수 있으나 이를 위한 비용발생이 상당하고, 비구조적 대책으로는 기상청의 동파 지도 알림 서비스를 활용하여 사전적으로 대응하고자 하나, 기상청자료는 대기 온도를 중심으로 제공하고 있기 때문에 해당서비스만으로는 계량기의 동파를 예측하는데 필요한 추가적인 다양한 변수를 활용하는데 한계가 있다. 최근 정부와 공공부문에서 22개 지역, 110개소 이상의 수도계량기함내 IoT 온도센서를 시범 설치하여 계량기 함내의 상태 등을 확인할 수 있는 사업을 수행했다. 전국적인 계량기 상태의 예측과 진단을 위해서는 추가적인 센서 설치가 필요할 것이나, IoT센서 설치 비용 등의 문제로 추가 설치가 더딘 실정이다. 본 연구에서는 겨울 동파 예방을 위해 실제 온도센서를 기반으로 가상센서를 구축하고, 이를 혼합한 하이브리드 방식으로 동파위험 기준에 따라 전국 동파위험 지도를 구축하였다. 가상센서 개발을 위해 독립변수로 위경도, 고도, 음·양지, 보온재 여부 및 기상정보(기온, 강수량, 풍속, 습도)를 활용하고, 종속변수로 실제 센서의 온도를 사용하여 기계학습 모델을 개발하였다. 지역 특성에 따라 정확한 모델을 구축하기 위해 위치정보 및 보온재여부 등의 변수를 활용하여 K-means 방법으로 군집화 하였으며, 각 군집별로 3가지의 기계학습 회귀모델을 적용하였다. 최적의 군집 수를 검토한 결과 4개가 적정한 것으로 판단되었다. 군집의 특성은 지역별 구분과 유사한 패턴을 보이며, 모든 군집에서 Gradient Boosting 회귀모델을 적용하는 것이 적합한 것으로 나타났다. 본 연구에서 개발한 모델을 바탕으로 조건에 따라 동파 예측 알람서비스에 실무적으로 활용할 수 있도록 양호·주의·위험·매우위험 총 4개의 기준을 설정하였다. 실제 본 연구에서 개발된 알고리즘을 국가상수도정보 시스템에 반영하여 테스트 수행중에 있으며, 향후 지속 검증을 할 예정에 있다. 이를 통해 동파 예방 및 피해 최소화, 물절약 등 직간접적 편익이 기대된다.

• Journal of Practical Engineering Education
• /
• v.14 no.3
• /
• pp.565-572
• /
• 2022

Card sorting is a useful data collection method for understanding users' perceptions of relationships between items. In general, card sorting is an intuitive and cost-effective technique that is very useful for user research and evaluation. In this study, the core competencies of each field were used as competency cards used in the next stage of card sorting for course development, and the clustering results were derived by applying the K-means algorithm to cluster the results. As a result of card sorting, competency clustering for core competencies for each occupation in each field was verified based on Participant-Centric Analysis (PCA). For the number of core competency cards for each occupation, the number of participants who agreed appropriately for clustering and the degree of card similarity were derived compared to the number of sorting participants.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.340-345
• /
• 2009

기존 파일 시스템의 검색은 검색결과를 제목과 요약문의 텍스트 형태로 제공함으로써 검색 결과가 많은 경우에 한눈에 결과를 살펴보는데 불편할 뿐 아니라 사용자가 직접 수많은 검색결과의 표제나 저자, 목차, 요약문을 확인하여 적합한 정보를 일일이 판별해야 하는 불편이 있다. 이에 정보들간의 유사도를 계산하여 군집화하고, 키워드와 검색결과들 간의 적합도와 검색결과들 간의 연관성 정보를 3D 공간 상에 디스플레이 하는 'DocuSynth' 시스템을 개발하였다. 이 연관성 정보들은 실세계 상의 3 차원 메타포인 '거리'로 변환되어 디스플레이 된다. 즉, 사용자로 하여금 정보간의 거리가 가까울수록 연관도가 높다고 직관적으로 인지할 수 있는 화면으로 설계하였다. 또한 3D 환경의 사용성을 높이기 위해 네비게이션 컨트롤러와 컨트롤 변수에 대한 사용성 평가를 실시하여 시스템 변수로 적용하였다. 본 연구결과는 향후 도래할 3D Web 에 대한 아이디어 제시와 구현 가이드라인으로 활용될 것으로 예상된다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.130-133
• /
• 2010

본 논문에서는 유전 알고리즘의 성능 향상을 위해 교배(Crossover) 기법의 중요 매개변수인 교배 교차점(Crossover Point)의 수를 개체군(Population)의 진화 과정 중에 적응적으로 변화 할 수 있는 자기-적응형(Self-Adaptive) 교배 기법을 제안한다. 이를 위해 제안 교배 기법은 전체 개체군을 다수개의 작은 개체군들로 군집화(Grouping)하여 일차적으로 서로 다른 교차점을 갖는 교배 기법을 적용시키고, 그 후 각 군집의 개체(Individual)들의 선택률을 기반으로 군집들간의 경쟁을 수행한다. 이는 유전 알고리즘이 개체군의 진화 과정 중에 문제에 적합한 교차점을 갖는 교배 기법을 적응적으로 사용할 수 있도록 한다. 또한 제안 교배 기법은 진화 과정 중에 교차점이 지속적으로 변화되므로 알고리즘 초반에는 높은 탐색 능력을 보유하게 되고 후반에는 높은 부분-해(Building-Block) 보존 능력을 지니게 되어, 최적 해(Optimal Solution)로의 수렴 능력이 향상된다. Deceptive 문제를 통해 제안 자기-적응형 교배 기법과 기존 (고정 교차점) 교배 기법의 성능을 비교 하였으며, 실험 결과로부터 제안 교배의 성능 우위를 확인하였다.

• Journal of the Korean Society for information Management
• /
• v.22 no.1 s.55
• /
• pp.65-85
• /
• 2005

This study proposes a new site selection model which reflects integrated opinions of several groups and identifies sites through objectivity of selection procedure. The proposed model consists of two parts, Analytic Hierarchy Process(AHP) and Geographic Information(GIS). This model was applied to Seocho-gu in Seoul. First, library site selection criteria were determined through literature study. Hierarchical relationship based on the questionnaire was determined and refined to be suited to Seocho-gu case. A survey was conducted with three groups, namely, library users, librarians, and public worker. A few inconsistent answers to the survey questionnaire were excluded and the relative importance of each criterion was measured. Next, an overlay method was used and the relative importance was used as a weight for selecting candidates. This process excluded the areas where a library was unable to be built, for example, rivers, military areas, other restricted areas by law, etc. and resulted in seventy-five sites. Five groups of candidates were identified according to the similarity of criteria. Finally, four groups, after eliminating one lowly fitted group, were determined.