• Title/Summary/Keyword: spatial neighbor

Search Result 170, Processing Time 0.022 seconds

Estimating Farmland Prices Using Distance Metrics and an Ensemble Technique (거리척도와 앙상블 기법을 활용한 지가 추정)

  • Lee, Chang-Ro;Park, Key-Ho
    • Journal of Cadastre & Land InformatiX
    • /
    • v.46 no.2
    • /
    • pp.43-55
    • /
    • 2016
  • This study estimated land prices using instance-based learning. A k-nearest neighbor method was utilized among various instance-based learning methods, and the 10 distance metrics including Euclidean distance were calculated in k-nearest neighbor estimation. One distance metric prediction which shows the best predictive performance would be normally chosen as final estimate out of 10 distance metric predictions. In contrast to this practice, an ensemble technique which combines multiple predictions to obtain better performance was applied in this study. We applied the gradient boosting algorithm, a sort of residual-fitting model to our data in ensemble combining. Sales price data of farm lands in Haenam-gun, Jeolla Province were used to demonstrate advantages of instance-based learning as well as an ensemble technique. The result showed that the ensemble prediction was more accurate than previous 10 distance metric predictions.

An Efficient Range Search and Nearest Neighbor Search Algorithm for Action Parts of Active Systems in Sparse Area (능동 시스템에서 위치관련 액션 수행을 위한 희소공간 공간객체의 효율적인 영역질의와 최근접질의)

  • Kim, Jung-Il;Hong, Dong-Kweon
    • The KIPS Transactions:PartD
    • /
    • v.8D no.2
    • /
    • pp.125-131
    • /
    • 2001
  • Various kind of disasters happens in our society. Most of them require immediate treatment to save life or to protect valuable products. When an accident happens in a place, it is reported to the headquarter of emergency measures system. According to the nature of accident several treatments orders are transmitted to the related authorities. In this paper, we introduce an intelligent emergency measures system that uses trigger mechanism of active databases. The system responds to various events spontaneously without intervention of mankind by triggering proper rules. The most important part of an action in the system is the capability of searching places to apply adequate treatments quickly. We have developed a new method for range queries and nearest neighbor queries which utilize the z-ordering technique to get fast responses. Those new methods are further extended to handle more realistic actual distance of road among positions.

  • PDF

The Optimized Detection Range of RFID-based Positioning System using k-Nearest Neighbor Algorithm

  • Kim, Jung-Hwan;Heo, Joon;Han, Soo-Hee;Kim, Sang-Min
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2008.10a
    • /
    • pp.297-302
    • /
    • 2008
  • The positioning technology for a moving object is an important and essential component of ubiquitous computing environment and applications, for which Radio Frequency Identification(RFID) has been considered as a core technology. RFID-based positioning system calculates the position of moving object based on k-nearest neighbor(k-nn) algorithm using detected k-tags which have known coordinates and kcan be determined according to the detection range of RFID system. In this paper, RFID-based positioning system determines the position of moving object not using weight factor which depends on received signal strength but assuming that tags within the detection range always operate and have same weight value. Because the latter system is much more economical than the former one. The geometries of tags were determined with considerations in huge buildings like office buildings, shopping malls and warehouses, so they were determined as the line in I-Dimensional space, the square in 2-Dimensional space. In 1-Dimensional space, the optimal detection range is determined as 125% of the tag spacing distance through the analytical and numerical approach. Here, the analytical approach means a mathematical proof and the numerical approach means a simulation using matlab. But the analytical approach is very difficult in 2-Dimensional space, so through the numerical approach, the optimal detection range is determined as 134% of the tag spacing distance in 2-Dimensional space. This result can be used as a fundamental study for designing RFID-based positioning system.

  • PDF

Change in Spatial Dispersion of Daphnia magna(Cladocera: Daphniidae) Populations Exposed to Organophosphorus Insecticide, Diazinon (유기인계 살충제 (다이아지논)에 대한 물벼룩, Daphnia magna (Cladocera: Daphniidae) 개체군의 공간분산 변이)

  • Lee, Sang-Hee;Ji, Chang-Woo;Chon, Tae-Soo
    • Environmental Analysis Health and Toxicology
    • /
    • v.24 no.3
    • /
    • pp.231-240
    • /
    • 2009
  • We explored collective behaviors of indicator species to elucidate the effect of the chemical stress. After the treatments of an insecticide, diazinon, at low concentrations (1.0 and 10.0 ${\mu}g/L$), spatial dispersion patterns of Daphnia magna were checked in a test chamber. The I-index was used to characterize the movement data before (0~1 h) and after (1~2 h) the treatments in laboratory conditions. The slopes of the frequency distribution of I-index in semi-log scale decreased significantly, and the test populations appeared to be more dispersed with a lower degree of aggregation after the treatments. The index was feasible in indicating decrease in the ability of the specimens to keep desirable distances with neighbor individuals under chemical stress and showed a possibility of monitoring presence of toxic chemicals in environment through group behavior measurement.

Dynamic Distributed Grid Scheme to Manage the Location-Information of Moving Objects in Spatial Networks (공간 네트워크에서 이동객체의 위치정보 관리를 위한 동적 분산 그리드 기법)

  • Kim, Young-Chang;Hong, Seung-Tae;Jo, Kyung-Jin;Chang, Jae-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.948-952
    • /
    • 2009
  • Recently, a new distributed grid scheme, called DS-GRID(distributed S-GRID), has been proposed to manage the location information of moving objects in a spatial network[1]. However, because DS-GRID uses uniform grid cells, it cannot handle skewed data which frequently occur in the real application. To solve this problem, we propose a dynamic distributed grid scheme which splits a grid cell dynamically based on the density of moving objects. In addition, we propose a k-nearest neighbor processing algorithm for the proposed scheme. Finally, it is shown from the performance analysis that our scheme achieves better retrieval and update performance than the DS-GRID when the moving objects are skewed.

Pattern Analysis for Urban Spatial Distribution of Traffic Accidents in Jinju (진주시 교통사고의 도시공간분포패턴 분석)

  • Sung, Byeong Jun;Yoo, Hwan Hee
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.22 no.3
    • /
    • pp.99-105
    • /
    • 2014
  • Since traffic accidents account for the highest proportion of the artificial disasters which occur in urban areas along with fire, more scientific an analysis on the causes of traffic accidents and various prevention measures against traffic accidents are needed. In this study, the research selected Jinju-si, which belongs to local small and medium-sized cities as a research target to analyze the characteristics of temporal and spacial distribution of traffic accidents by associating the data of traffic accidents, occurred in 2013 with the causes of traffic accidents and location information that includes occurrence time and seasonal features. It subsequently examines the spatial correlation between traffic accidents and the characteristics of urban space development according to the plans of land using. As a result, the characteristics of accident distribution according to the types of accidents reveal that side right-angle collisions (car versus car) and pedestrian-crossing accident (car versus man) showed the highest clustering in the density analysis and average nearest neighbor analysis. In particular, traffic accidents occurred the most on roads which connect urban central commercial areas, high-density residential areas, and industrial areas. In addition, human damage in damage conditions, clear day in weather condition, dry condition in the road condition, and three-way intersection in the road way showed the highest clustering.

Design and Implementation of a Spatial-Operation-Trigger for Supporting the Integrity of Meet-Spatial-Objects (상접한 공간 객체의 무결성 지원을 위한 공간 연산 트리거의 설계 및 구현)

  • Ahn, Jun-Soon;Cho, Sook-Kyoung;Chung, Bo-Hung;Lee, Jae-Dong;Bae, Hae-Young
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.2
    • /
    • pp.127-140
    • /
    • 2002
  • In a spatial database system, the semantic integrity should be supported for maintaining the data consistency. In the real world, spatial objects In boundary layer should always meet neighbor objects, and they cannot hold the same name. This characteristic is an implied concept in real world. So, when this characteristic is disobeyed due to the update operations of spatial objects, it is necessary to maintain the integrity of a layer. In this thesis, we propose a spatial-operation-trigger for supporting the integrity of spatial objects. The proposed method is defined a spatial-operation-trigger based on SQL-3 and executed when the constraint condition is violated. A spatial-operation-trigger have the strategy of execution. Firstly, for one layer, the spatial and aspatial data triggers are executed respectively. Secondly, the aspatial data trigger for the other layers is executed. Spatial-operation-trigger for one layer checks whether the executed operation updates only spatial data, aspatial data, or both of them, and determines the execution strategy of a spatial-operation-trigger. Finally, the aspatial data trigger for the other layers is executed. A spatial-operation-trigger is executed in three steps for the semantic integrity of the meet-property of spatial objects. And, it provides the semantic integrity of spatial objects and the convenience for users using automatic correcting operation.

Design and Implementation of a Trajectory-based Index Structure for Moving Objects on a Spatial Network (공간 네트워크상의 이동객체를 위한 궤적기반 색인구조의 설계 및 구현)

  • Um, Jung-Ho;Chang, Jae-Woo
    • Journal of KIISE:Databases
    • /
    • v.35 no.2
    • /
    • pp.169-181
    • /
    • 2008
  • Because moving objects usually move on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. But, because FNR-tree and MON-tree are stored by the unit of the moving object's segment, they can't support the whole moving objects' trajectory. In this paper, we propose an efficient trajectory index structure, named Trajectory of Moving objects on Network Tree(TMN Tree), for moving objects. For this, we divide moving object data into spatial and temporal attribute, and preserve moving objects' trajectory. Then, we design index structure which supports not only range query but trajectory query. In addition, we divide user queries into spatio-temporal area based trajectory query, similar-trajectory query, and k-nearest neighbor query. We propose query processing algorithms to support them. Finally, we show that our trajectory index structure outperforms existing tree structures like FNR-Tree and MON-Tree.

SQR-Tree : A Hybrid Index Structure for Efficient Spatial Query Processing (SQR-Tree : 효율적인 공간 질의 처리를 위한 하이브리드 인덱스 구조)

  • Kang, Hong-Koo;Shin, In-Su;Kim, Joung-Joon;Han, Ki-Joon
    • Spatial Information Research
    • /
    • v.19 no.2
    • /
    • pp.47-56
    • /
    • 2011
  • Typical tree-based spatial index structures are divided into a data-partitioning index structure such as R-Tree and a space-partitioning index structure such as KD-Tree. In recent years, researches on hybrid index structures combining advantages of these index structures have been performed extensively. However, because the split boundary extension of the node to which a new spatial object is inserted may extend split boundaries of other neighbor nodes in existing researches, overlaps between nodes are increased and the query processing cost is raised. In this paper, we propose a hybrid index structure, called SQR-Tree that can support efficient processing of spatial queries to solve these problems. SQR-Tree is a combination of SQ-Tree(Spatial Quad- Tree) which is an extended Quad-Tree to process non-size spatial objects and R-Tree which actually stores spatial objects associated with each leaf node of SQ-Tree. Because each SQR-Tree node has an MBR containing sub-nodes, the split boundary of a node will be extended independently and overlaps between nodes can be reduced. In addition, a spatial object is inserted into R-Tree in each split data space and SQ-Tree is used to identify each split data space. Since only R-Trees of SQR-Tree in the query area are accessed to process a spatial query, query processing cost can be reduced. Finally, we proved superiority of SQR-Tree through experiments.

Mapping Burned Forests Using a k-Nearest Neighbors Classifier in Complex Land Cover (k-Nearest Neighbors 분류기를 이용한 복합 지표 산불피해 영역 탐지)

  • Lee, Hanna ;Yun, Konghyun;Kim, Gihong
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.43 no.6
    • /
    • pp.883-896
    • /
    • 2023
  • As human activities in Korea are spread throughout the mountains, forest fires often affect residential areas, infrastructure, and other facilities. Hence, it is necessary to detect fire-damaged areas quickly to enable support and recovery. Remote sensing is the most efficient tool for this purpose. Fire damage detection experiments were conducted on the east coast of Korea. Because this area comprises a mixture of forest and artificial land cover, data with low resolution are not suitable. We used Sentinel-2 multispectral instrument (MSI) data, which provide adequate temporal and spatial resolution, and the k-nearest neighbor (kNN) algorithm in this study. Six bands of Sentinel-2 MSI and two indices of normalized difference vegetation index (NDVI) and normalized burn ratio (NBR) were used as features for kNN classification. The kNN classifier was trained using 2,000 randomly selected samples in the fire-damaged and undamaged areas. Outliers were removed and a forest type map was used to improve classification performance. Numerous experiments for various neighbors for kNN and feature combinations have been conducted using bi-temporal and uni-temporal approaches. The bi-temporal classification performed better than the uni-temporal classification. However, the uni-temporal classification was able to detect severely damaged areas.