• 한국정보시스템학회지:정보시스템연구
• /
• 제14권3호
• /
• pp.17-22
• /
• 2005

Location management is very important in location-based services to provide services to the mobile users like banking, city guides and many more. Ubiquitous and mobile devices are the source of data in location management and its significant operations are update and search method. Some studies to improve these were presented by using optimal sequential paging, location area scheme and hierarchical database scheme. In addition, not all location services have the same access methods on data and it lead to difficulties of providing services. A proposed location management of multi-agent architecture is presented in this study. It shows the coordination of the agents on the distributed database of location-based services. The proposal focuses on the location management of the mobile object presented in a hierarchical search and update. Also, it uses a nearest neighbor technique for efficient search method of mobile objects.

• 정보교육학회논문지
• /
• 제11권3호
• /
• pp.281-288
• /
• 2007

협동적 필터링은 사용자가 좋아할 만한 항목을 예측하기 위하여 비슷한 선호도를 가지는 다른 사람들의 평가 항목에 근거하여 추천하는 방법이다. 이러한 협동적 필터링 기법은 오늘날과 같이 대규모의 정보가 효과적으로 축적되고 이용 가능하게 된 정보화된 사회에서는 현명한 의사결정을 하도록 도와주는 역할을 한다. 본 논문에서는 대학생들이 수강과목의 취사선택을 용이하게 할 수 있도록 수강과목 추천 시스템을 설계하고 구현하였으며 실험적으로 평가하였다. 먼저, 학생들은 과거 자신이 수강하였던 과목에 대한 과목 선호도를 데이터베이스에 입력한다. 과목 선호도의 패턴이 유사한 학생들은 유사 그룹으로 간주된다. 성향이 유사한 사용자를 찾기 위해 일반적으로 사용되고 있는 피어슨 상관계수에 의한 유사도를 이용하였다. 수강 과목을 예측하려는 학생과 가장 유사한 패턴을 보이는 K 명의 학생들의 수강 과목에서 가장 높은 선호도를 보이는 과목들의 순서화된 리스트를 추천 과목으로 제시한다. 설문 조사를 통한 실험 데이터를 이용하였으며 평균 절대 에러를 사용하여 제안한 방법의 정확도를 평가하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.620-626
• /
• 2004

For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2018년도 춘계 종합학술대회 논문집
• /
• pp.9-10
• /
• 2018

모바일 기기의 대중화 및 위치 인식 기술의 발달로 다양한 위치 기반 서비스가 제공되고 있다. 많은 위치 기반 서비스에서는 현재 위치에서 가장 가까운 k개의 아이템을 찾는 k-최근접 질의가 빈번하게 활용되고 있다. 본 논문에서는 효율적인 k-최근접 분산 질의 처리를 질의 할당 기법을 제안한다. 질의 처리 할당을 위해 질의 통계 값을 활용한 질의 모형을 정의하고 규칙 기반의 질의 할당을 수행한다. 성능 평가를 통해 제안하는 기법의 우수성을 보인다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2008년도 한국컴퓨터종합학술대회논문집 Vol.35 No.1 (C)
• /
• pp.456-461
• /
• 2008

클래스별 원형상(prototype)의 분포가 선형분리 불가능하고 동시에 분산이 서로 다르고 희박한 분포의 원형상에 있어서 입력패턴에 대한 고정밀도의 식별을 행하기 위해 클래스별 최근방 원형상과 그 k 근방 원형상에 있어서 노름(norm) 평균에 기초한 최근방 결정법에 의한 패턴식별방법을 제안한다. 제안하는 방법의 유효성을 평가하기위해 인공적인 패턴과 실제 패턴에 대해 일반적인 k-NN법, 매해라노비스 거리(maharanobis distance), CAP, kCAP, SVM의 각각에 기초한 방법과 제안하는 방법을 적용하여 식별률에 의한 평가를 행하였다. 그 결과 특히, 원형상의 분포가 희박한 경우 제안하는 방법이 다른 방법들에 비해 높은 식별률을 나타냈다.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2004년도 추계학술대회
• /
• pp.221-229
• /
• 2004

Recently, there has been enormous growth in the amount of commercial and scientific data, such as protein sequences, retail transactions, and web-logs. Such datasets consist of sequence data that have an inherent sequential nature. However, only a few of the existing clustering algorithms consider sequentiality. This study presents a method for clustering such sequence datasets. The similarity between sequences must be decided before clustering the sequences. This study proposes a new similarity measure to compute the similarity between two sequences using a sequence element. Two clustering algorithms using the proposed similarity measure are proposed: a hierarchical clustering algorithm and a scalable clustering algorithm that uses sampling and a k-nearest neighbor method. Using a splice dataset and synthetic datasets, we show that the quality of clusters generated by our proposed clustering algorithms is better than that of clusters produced by traditional clustering algorithms.

• Communications for Statistical Applications and Methods
• /
• 제30권3호
• /
• pp.331-341
• /
• 2023

Handling missing values in data analysis is essential in constructing a good prediction model. The easiest way to handle missing values is to use complete case data, but this can lead to information loss within the data and invalid conclusions in data analysis. Imputation is a technique that replaces missing data with alternative values obtained from information in a dataset. Conventional imputation methods include K-nearest-neighbor imputation and multiple imputations. Recent methods include missForest, missRanger, and mixgb ,all which use machine learning algorithms. This paper compares the imputation techniques for datasets with mixed datatypes in various situations, such as data size, missing ratios, and missing mechanisms. To evaluate the performance of each method in mixed datasets, we propose a new imputation performance measure (IPM) that is a unified measurement applicable to numerical and categorical variables. We believe this metric can help find the best imputation method. Finally, we summarize the comparison results with imputation performances and computational times.

• Communications for Statistical Applications and Methods
• /
• 제8권2호
• /
• pp.499-505
• /
• 2001

Kim and Baek (2000) tested the spatial randomness for he earthquake occurrence in the Korean Peninsula by using the nearest-neighbor test statistics and empirical distribution functions. The K-function, however, has obvious advantages over the methods used in Kim and Baek (2000), such as it does not depend on the shape of the study region and is an effective summary of spatial dependence over a wide range of scales. We applied the K-function method for testing the randomness to both of the historical and the instrumental seismicity data. It was found that he earthquake occurrences for historical and instrumental seismicity data are not random and clustered rather than scattered.

• 방송공학회논문지
• /
• 제26권3호
• /
• pp.283-295
• /
• 2021

본 논문은 자기 조직화 지도 기법을 기반으로 라이다 기반으로 생성된 깊이 맵과 컬러 이미지의 정보를 기반으로 고밀도 깊이 맵을 생성하는 방법을 제안한다. 제안하는 깊이 맵 업샘플링 방법은 라이다에서 취득되지 않은 공간에 대한 초기 깊이 예측 단계와 초기 깊이 필터링 단계로 구성된다. 초기 깊이 예측 단계에서는 두 장의 컬러 이미지에 대해 스테레오 매칭을 수행하여 초기 깊이 값을 예측한다. 깊이 맵 필터링 단계에서는 예측된 초기 깊이 값의 오차를 감소시키고자 예측 깊이 픽셀에 대하여 주변의 실측 깊이 값을 이용하여 자기 조직화 지도 기법을 수행한다. 자기 조직화 기법 수행 시 예측 깊이 픽셀과 실측 깊이 픽셀의 거리와, 각 픽셀에 대응되는 컬러 값의 차이에 따라 가중치를 결정한다. 본 논문에서는 성능 비교를 위하여 깊이 맵 업샘플링 방법으로 널리 사용되고 있는 양방향 필터 및 k-최근접 이웃 알고리즘과 비교를 진행하였다. 제안하는 방법은 양방향 필터 방법 및 k-최근접 이웃 알고리즘 대비 MAE 관점에서 각각 약 6.4%, 8.6%이 감소하였고 RMSE 관점에서 각각 약 10.8%, 14.3%이 감소하였다.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2015년도 춘계 종합학술대회 논문집
• /
• pp.53-54
• /
• 2015

Optical music recognition (OMR) systems have been developed in recent years. However, chord symbols that play a role in a music sheet have been still disregarded. Therefore, we aimed to develop a proper approach to recognize these chord symbols. First, we divide the image of chord symbol into small segments in horizontal by a method based on vertical projection. Then, the optimal combination of these segments is found by using a lexicon-driven word scoring technique and a nearest neighbor classifier. The word that corresponds to the optimal combination is the result of recognition. The experiment gives an impressive result with accuracy 97.32%.