• Title/Summary/Keyword: Nearest Neighbor Index Analysis

Search Result 29, Processing Time 0.021 seconds

COMPARATIVE ANALYSIS ON MACHINE LEARNING MODELS FOR PREDICTING KOSPI200 INDEX RETURNS

  • Gu, Bonsang;Song, Joonhyuk
    • The Pure and Applied Mathematics
    • /
    • v.24 no.4
    • /
    • pp.211-226
    • /
    • 2017
  • In this paper, machine learning models employed in various fields are discussed and applied to KOSPI200 stock index return forecasting. The results of hyperparameter analysis of the machine learning models are also reported and practical methods for each model are presented. As a result of the analysis, Support Vector Machine and Artificial Neural Network showed a better performance than k-Nearest Neighbor and Random Forest.

The Performance Analysis of Nearest Neighbor Query Process using Circular Search Distance (순환검색거리를 이용하는 최대근접 질의처리의 성능분석)

  • Seon, Hwi-Joon;Kim, Won-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.1
    • /
    • pp.83-90
    • /
    • 2010
  • The number of searched nodes and the computation time in an index should be minimized for optimizing the processing cost of the nearest neighbor query. The Measurement of search distance considered a circular location property of objects is required to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we propose the processing method of the nearest neighbor query be considered a circular location property of object where the search space consists of a circular domain and show its performance by experiments. The proposed method uses the circular minimum distance and the circular optimal distance which are the search measurements for optimizing the processing cost of the nearest neighbor query.

Evaluation of Raingauge Network using Area Average Rainfall Estimation and the Estimation Error (면적평균강우량 산정을 통한 강우관측망 평가 및 추정오차)

  • Lee, Ji Ho;Jun, Hwan Don
    • Journal of Wetlands Research
    • /
    • v.16 no.1
    • /
    • pp.103-112
    • /
    • 2014
  • Area average rainfall estimation is important to determine the exact amount of the available water resources and the essential input data for rainfall-runoff analysis. Like that, the necessary criterion for accurate area average rainfall estimate is the uniform spatial distribution of raingauge network. In this study, we suggest the spatial distribution evaluation methodology of raingauge network to estimate better area average rainfall and after the suggested method is applied to Han River and Geum River basin. The spatial distribution of rainfall network can be quantified by the nearest neighbor index. In order to evaluate the effects of the spatial distribution of rainfall network by each basin, area average rainfall was estimated by arithmetic mean method, the Thiessen's weighting method and estimation theory for 2013's rainfall event, and evaluated the involved errors by each cases. As a result, it can be found that the estimation error at the best basin of spatial distribution was lower than the worst basin of spatial distribution.

Efficient Nearest Neighbor Search on Moving Object Trajectories (이동객체궤적에 대한 효율적인 최근접이웃검색)

  • Kim, Gyu-Jae;Park, Young-Hee;Cho, Woo-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.12
    • /
    • pp.2919-2925
    • /
    • 2014
  • Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

Efficient Nearest Neighbor Search on Moving Object Trajectories (이동객체궤적에 대한 효율적인 최근접 이웃 검색)

  • KIm, Gyu-Jae;Park, Young-Hee;Cho, Woo-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.418-421
    • /
    • 2014
  • Because of the rapid growth of mobile communication and wireless communication, Location-based services are handled in many applications. So, the management and analysis of spatio-temporal data are a hot issue in database research. Index structure and query processing of such contents are very important for these applications. This paper addressees algorithms that make index structure by using Douglas-Peucker Algorithm and process nearest neighbor search query efficiently on moving objects trajectories. We compare and analyze our algorithms by experiments. Our algorithms make small size of index structure and process the query more efficiently.

  • PDF

Grid-based Index Generation and k-nearest-neighbor Join Query-processing Algorithm using MapReduce (맵리듀스를 이용한 그리드 기반 인덱스 생성 및 k-NN 조인 질의 처리 알고리즘)

  • Jang, Miyoung;Chang, Jae Woo
    • Journal of KIISE
    • /
    • v.42 no.11
    • /
    • pp.1303-1313
    • /
    • 2015
  • MapReduce provides high levels of system scalability and fault tolerance for large-size data processing. A MapReduce-based k-nearest-neighbor(k-NN) join algorithm seeks to produce the k nearest-neighbors of each point of a dataset from another dataset. The algorithm has been considered important in bigdata analysis. However, the existing k-NN join query-processing algorithm suffers from a high index-construction cost that makes it unsuitable for the processing of bigdata. To solve the corresponding problems, we propose a new grid-based, k-NN join query-processing algorithm. Our algorithm retrieves only the neighboring data from a query cell and sends them to each MapReduce task, making it possible to improve the overhead data transmission and computation. Our performance analysis shows that our algorithm outperforms the existing scheme by up to seven-fold in terms of the query-processing time, while also achieving high extent of query-result accuracy.

The spatial distribution characteristics of Automatic Weather Stations in the mountainous area over South Korea (우리나라 산악기상관측망의 공간분포 특성)

  • Yoon, Sukhee;Jang, Keunchang;Won, Myoungsoo
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.20 no.1
    • /
    • pp.117-126
    • /
    • 2018
  • The purpose of this study is to analyze the spatial distribution characteristics and spatial changes of Automatic Weather Stations (AWS) in mountainous areas with altitude more than 200 meters in South Korea. In order to analyze the spatial distribution patterns, spatial analysis was performed on 203 Automatic Mountain Meteorology Observation Station (AMOS) points from 2012 to 2016 by Euclidean distance analysis, nearest neighbor index analysis, and Kernel density analysis methods. As a result, change of the average distance between 2012 and 2016 decreased up to 16.4km. The nearest neighbor index was 0.666632 to 0.811237, and the result of Z-score test was -4.372239 to -5.145115(P<0.01). The spatial distributions of AMOSs through Kernel density analysis were analyzed to cover 129,719ha/a station in 2012 and 50,914ha/a station in 2016. The result of a comparison between 2012 and 2016 on the spatial distribution has decreased about 169,399ha per a station for the past 5 years. Therefore it needs to be considered the mountainous regions with low density when selecting the site of AMOS.

A Comparative Study using Bibliometric Analysis Method on the Reformed Theology and Evangelicalism (개혁신학과 복음주의에 관한 계량서지학적 비교 연구)

  • Yoo, Yeong Jun;Lee, Jae Yun
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.29 no.3
    • /
    • pp.41-63
    • /
    • 2018
  • This study aimed at analyzing journals and index terms, authors of the reformed theology and evangelicalism, neutral theological position by using bibliometrical analyzing methods. The analyzing methods are average linkage and neighbor centralities, profile cosine similarities. Especially, when analyzing the relationship between authors, we interpreted the research topic by finding the key shared index terms between the authors. In the journal analysis results, 9 journals were largely clustered together in the two clusters of the reformed theology and evangelicalism, but Presbyterian Theological Quarterly that is thought to be a reformed journal was clustered in evangelical cluster. In the index terms analysis results of the clusters, the reformed theology and evangelicalism were key words representing the two clusters. In the authors' analysis results, we had 9 clusters and the Presbyterian theologian studying the reformed theology had the four clusters and the non-Presbyterian theologian had the 5 clusters. Therefore, we consistently had the two clusters of the reformed theology and evangelicalism in all the analysis of the journals and the index terms, the authors.

A Study on the Trade Area Analysis Model based on GIS - A Case of Huff probability model - (GIS 기반의 상권분석 모형 연구 - Huff 확률모형을 중심으로 -)

  • Son, Young-Gi;An, Sang-Hyun;Shin, Young-Chul
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.10 no.2
    • /
    • pp.164-171
    • /
    • 2007
  • This research used GIS spatial analysis model and Huff probability model and achieved trade area analysis of area center. we constructed basic maps that were surveyed according to types of business, number of households etc. using a land registration map of LMIS(Land Management Information System) in Bokdae-dong, Cheongju-si. Kernel density function and NNI(Nearest Neighbor Index) was used to estimate store distribution center area in neighborhood life zones. The center point of area and scale were estimated by means of the center area. Huff probability model was used in abstracting trade areas according to estimated center areas, those was drew map. Therefore, this study describes method that can apply in Huff probability model through kernel density function and NNI of GIS spatial analysis techniques. A trade area was abstracted more exactly by taking advantage of this method, which will can aid merchant for the foundation of small sized enterprises.

  • PDF

Implementation of Crime Pattern Analysis Algorithm using Big Data (빅 데이터를 이용한 범죄패턴 분석 알고리즘의 구현)

  • Cha, Gyeong Hyeon;Kim, Kyung Ho;Hwang, Yu Min;Lee, Dong Chang;Kim, Sang Ji;Kim, Jin Young
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.4
    • /
    • pp.57-62
    • /
    • 2014
  • In this paper, we proposed and implemented a crime pattern analysis algorithm using big data. The proposed algorithm uses crime-related big data collected and published in the supreme prosecutors' office. The algorithm analyzed crime patterns in Seoul city from 2011 to 2013 using the spatial statistics analysis like the standard deviational ellipse and spatial density analysis. Using crime frequency, We calculated the crime probability and danger factors of crime areas, time, date, and places. Through a result we analyzed spatial statistics. As the result of the proposed algorithm, we could grasp differences in crime patterns of Seoul city, and we calculated degree of risk through analysis of crime pattern and danger factor.