• Title/Summary/Keyword: kernel density analysis

Search Result 119, Processing Time 0.023 seconds

Selection of Spatial Regression Model Using Point Pattern Analysis

  • Shin, Hyun Su;Lee, Sang-Kyeong;Lee, Byoungkil
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.3
    • /
    • pp.225-231
    • /
    • 2014
  • When a spatial regression model that uses kernel density values as a dependent variable is applied to retail business data, a unique model cannot be selected because kernel density values change following kernel bandwidths. To overcome this problem, this paper suggests how to use the point pattern analysis, especially the L-index to select a unique spatial regression model. In this study, kernel density values of retail business are computed by the bandwidth, the distance of the maximum L-index and used as the dependent variable of spatial regression model. To test this procedure, we apply it to meeting room business data in Seoul, Korea. As a result, a spatial error model (SEM) is selected between two popular spatial regression models, a spatial lag model and a spatial error model. Also, a unique SEM based on the real distribution of retail business is selected. We confirm that there is a trade-off between the goodness of fit of the SEM and the real distribution of meeting room business over the bandwidth of maximum L-index.

Application of the L-index to the Delineation of Market Areas of Retail Businesses

  • Lee, Sang-Kyeong;Lee, Byoungkil
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.3
    • /
    • pp.245-251
    • /
    • 2014
  • As delineating market areas of retail businesses has become an interesting topic in marketing field, Lee and Lee recently suggested a noteworthy method, which applied the hydrological analysis of geographical information system (GIS), based on Christaller's central place theory. They used a digital elevation model (DEM) which inverted the kernel density of retail businesses, which was measured by using bandwidths of pre-determined 500, 1000 and 5000 m, respectively. In fact, their method is not a fully data-based approach in that they used pre-determined kernel bandwidths, however, this paper has been planned to improve Lee and Lee's method by using a kind of data-based approach of the L-index that describes clustering level of point feature distribution. The case study is implemented to automobile-related retail businesses in Seoul, Korea with selected Kernel bandwidths, 1211.5, 2120.2 and 7067.2 m from L-index analysis. Subsequently, the kernel density is measured, the density DEM is created by inverting it, and boundaries of market areas are extracted. Following the study, analysis results are summarized as follows. Firstly, the L-index can be a useful tool to complement the Lee and Lee's market area analysis method. At next, the kernel bandwidths, pre-determined by Lee and Lee, cannot be uniformly applied to all kinds of retail businesses. Lastly, the L-index method can be useful for analyzing the space structure of market areas of retail businesses, based on Christaller's central place theory.

THE BERGMAN KERNEL FUNCTION AND THE DENSITY THEOREMS IN THE PLANE

  • Jeong, Moonja
    • Bulletin of the Korean Mathematical Society
    • /
    • v.31 no.1
    • /
    • pp.115-123
    • /
    • 1994
  • The Bergman kernel is closely connected to mapping problems in complex analysis. For example, the Riemann mapping function is witten down in terms of the Bergman kernel. Hence, information about the bergman kernel gives information about mappings. In this note, we prove the following theorem.

  • PDF

Optimal Designs for Multivariate Nonparametric Kernel Regression with Binary Data

  • Park, Dong-Ryeon
    • Communications for Statistical Applications and Methods
    • /
    • v.2 no.2
    • /
    • pp.243-248
    • /
    • 1995
  • The problem of optimal design for a nonparametric regression with binary data is considered. The aim of the statistical analysis is the estimation of a quantal response surface in two dimensions. Bias, variance and IMSE of kernel estimates are derived. The optimal design density with respect to asymptotic IMSE is constructed.

  • PDF

THE STUDY OF FLOOD FREQUENCY ESTIMATES USING CAUCHY VARIABLE KERNEL

  • Moon, Young-Il;Cha, Young-Il;Ashish Sharma
    • Water Engineering Research
    • /
    • v.2 no.1
    • /
    • pp.1-10
    • /
    • 2001
  • The frequency analyses for the precipitation data in Korea were performed. We used daily maximum series, monthly maximum series, and annual series. For nonparametric frequency analyses, variable kernel estimators were used. Nonparametric methods do not require assumptions about the underlying populations from which the data are obtained. Therefore, they are better suited for multimodal distributions with the advantage of not requiring a distributional assumption. In order to compare their performance with parametric distributions, we considered several probability density functions. They are Gamma, Gumbel, Log-normal, Log-Pearson type III, Exponential, Generalized logistic, Generalized Pareto, and Wakeby distributions. The variable kernel estimates are comparable and are in the middle of the range of the parametric estimates. The variable kernel estimates show a very small probability in extrapolation beyond the largest observed data in the sample. However, the log-variable kernel estimates remedied these defects with the log-transformed data.

  • PDF

Differences in Network-Based Kernel Density Estimation According to Pedestrian Network and Road Centerline Network

  • Lee, Byoungkil
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.36 no.5
    • /
    • pp.335-341
    • /
    • 2018
  • The KDE (Kernel Density Estimation) technique in GIS (Geographic Information System) has been widely used as a method for determining whether a phenomenon occurring in space forms clusters. Most human-generated events such as traffic accidents and retail stores are distributed according to a road network. Even if events on forward and rear roads have short Euclidean distances, network distances may increase and the correlation between them may be low. Therefore, the NKDE (Network-based KDE) technique has been proposed and applied to the urban space where a road network has been developed. KDE is being studied in the field of business GIS, but there is a limit to the microscopic analysis of economic activity along a road. In this study, the NKDE technique is applied to the analysis of urban phenomena such as the density of shops rather than traffic accidents that occur on roads. The results of the NKDE technique are also compared to pedestrian networks and road centerline networks. The results show that applying NKDE to microscopic trade area analysis can yield relatively accurate results. In addition, it was found that pedestrian network data that can consider the movement of actual pedestrians are necessary for accurate trade area analysis using NKDE.

Convolution Interpretation of Nonparametric Kernel Density Estimate and Rainfall-Runoff Modeling (비매개변수 핵밀도함수와 강우-유출모델의 합성곱(Convolution)을 이용한 수학적 해석)

  • Lee, Taesam
    • Journal of Korean Society of Disaster and Security
    • /
    • v.8 no.1
    • /
    • pp.15-19
    • /
    • 2015
  • In rainfall-runoff models employed in hydrological applications, runoff amount is estimated through temporal delay of effective precipitation based on a linear system. Its amount is resulted from the linearized ratio by analyzing the convolution multiplier. Furthermore, in case of kernel density estimate (KDE) used in probabilistic analysis, the definition of the kernel comes from the convolution multiplier. Individual data values are smoothed through the kernel to derive KDE. In the current study, the roles of the convolution multiplier for KDE and rainfall-runoff models were revisited and their similarity and dissimilarity were investigated to discover the mathematical applicability of the convolution multiplier.

An Algorithm of Score Function Generation using Convolution-FFT in Independent Component Analysis (독립성분분석에서 Convolution-FFT을 이용한 효율적인 점수함수의 생성 알고리즘)

  • Kim Woong-Myung;Lee Hyon-Soo
    • The KIPS Transactions:PartB
    • /
    • v.13B no.1 s.104
    • /
    • pp.27-34
    • /
    • 2006
  • In this study, we propose this new algorithm that generates score function in ICA(Independent Component Analysis) using entropy theory. To generate score function, estimation of probability density function about original signals are certainly necessary and density function should be differentiated. Therefore, we used kernel density estimation method in order to derive differential equation of score function by original signal. After changing formula to convolution form to increase speed of density estimation, we used FFT algorithm that can calculate convolution faster. Proposed score function generation method reduces the errors, it is density difference of recovered signals and originals signals. In the result of computer simulation, we estimate density function more similar to original signals compared with Extended Infomax and Fixed Point ICA in blind source separation problem and get improved performance at the SNR(Signal to Noise Ratio) between recovered signals and original signal.

A Kernel Density Signal Grouping Based on Radar Frequency Distribution (레이더 주파수 분포 기반 커널 밀도 신호 그룹화 기법)

  • Lee, Dong-Weon;Han, Jin-Woo;Lee, Won-Don
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.6
    • /
    • pp.124-132
    • /
    • 2011
  • In a modern electronic warfare, radar signal environments become more denser and complex. Therefor the capability of reliable signal analysis techniques is required for ES(Electronic warfare Support) system to identify and analysis individual emitter signals from received signals. In this paper, we propose the new signal grouping algorithm to ensure the reliable signal analysis and to reduce the cost of the signal processing steps in the ES. The proposed grouping algorithm uses KDE(Kernel Density Estimator) and its CDF(Cumulative Distribution Function) to compose windows considering the statistical distribution characteristics based on the radar frequency modulation type. Simulation results show the good performance of the proposed technique in the signal grouping.

Applying the L-index for Analyzing the Density of Point Features (점사상 밀도 분석을 위한 L-지표의 적용)

  • Lee, Byoung-Kil
    • Spatial Information Research
    • /
    • v.16 no.2
    • /
    • pp.237-247
    • /
    • 2008
  • Statistical analysis of the coordinate information is regarded as one of the major GIS functions. Among them, one of the most fundamental analysis is density analysis of point features. For analyzing the density appropriately, determining the search radius, kernel radius, has critical importance. In this study, using L-index, known as its usefulness for choosing the kernel radius in previous researches, radius for density analysis of various point features are estimated, and the behavior of L-index is studied based on the estimated results. As results, L-index is not suitable to determine the search radius for the point features that are evenly distributed with small clusters, because the pattern of the L-index is depends on the size of the study area. But for the point features with small number of highly clustered areas, L-index is suitable, because the pattern of the L-index is not affected by the size of study area.

  • PDF