• Title/Summary/Keyword: Statistics Matching

Search Result 190, Processing Time 0.033 seconds

Data Matching Research to Use Resident Registration Administrative Data in the Population Censuses (인구총조사에 주민등록 행정자료 활용을 위한 자료매칭연구)

  • Lee, Nae-Seong
    • Survey Research
    • /
    • v.9 no.2
    • /
    • pp.119-149
    • /
    • 2008
  • In this changing, complex modern society, as one-person households, dual income households and the elderly population increases and the survey environment gets worse, the past 'method' in which high costs and much time are needed, should face the environmental change. When considering the fact that developed countries in Northern Europe such as Denmark and Finland use administrative data for the Censuses, Korea should carry out further research to use resident registration administrative data in the Registration Census. Based on administrative data, the Registration Census is expected to reduce survey costs and to increase the accuracy and timeliness of surveys. Moreover, a wide variety of statistical demand will be satisfied by producing advanced statistics through the links among administrative data. The paper examines the difference when linking both resident registration administrative data and the results of 2005 Population Census, with a view to improving the Population Census method and preparing for the information age. Also this paper presents some proposals for future Population Censuses. With confidentiality given the top priority, this paper examines the link with matching value of ages and genders at Haeundae-gu, Busan and Boeun-gun, Chungbuk for pragmatic research. Hoenam-myeon, Boeun-gun, Chungbuk marks a low matching rate. Focused on Hoenam-myeon data, this research directly compares the results of 2005 Population Census with resident registration administrative data. Births, deaths, out-migrations and in-migrations from resident registration administrative data as of November 1st 2005 are used especially to increase comparison with the results of 2005 Population Census.

  • PDF

DUST-OBSCURED RADIO AGNS FROM THE WISE SURVEY

  • Kim, Minjin;Lonsdale, Carol J.;Lacy, Mark;Kimball, Amy;Condon, Jim
    • Publications of The Korean Astronomical Society
    • /
    • v.27 no.4
    • /
    • pp.289-290
    • /
    • 2012
  • Feedback from accreting BH (AGN) is thought to be responsible for the co-evolution of BHs and galaxies. It is likely to be prominent in the most luminous dust-obscured quasars, particularly those containing radio sources too luminous to be powered by starbursts. In order to investigate the feedback mechanism in detail, we select a unique sample containing ~ 200 of the most luminous obscured QSOs by cross-matching the WISE catalog with the FIRST and NVSS radio surveys. We present overall statistics for the observed range of colors and radio/mid-IR flux density ratio. We also present our efforts to understand the physical and evolutionary nature of these extreme feedback candidates using various telescopes such as Magellan, SOAR, Herschel, and ALMA.

Sufficient Conditions for Compatibility of Unequal-replicate Component Designs

  • Park, Dong-Kwon
    • Journal of the Korean Statistical Society
    • /
    • v.23 no.2
    • /
    • pp.513-522
    • /
    • 1994
  • A multi-dimensional design is most easily constructed via the amalgamation of one-dimensional component block designs. However, not all sets of component designs are compatible to be amalgamated. The conditions for compatibility are related to the concept of a complete matching in a graph. In this paper, we give sufficient conditions for unequal-replicate designs. Two types of conditions are proposed; one is based on the number of verices adjacent to at least one vertex and the other is ona a degree of vertex, in a bipartite graph. The former is an extension of the sufficient conditions of equal-replicate designs given by Dean an Lewis (1988).

  • PDF

Visualizing Multi-Variable Prediction Functions by Segmented k-CPG's

  • Huh, Myung-Hoe
    • Communications for Statistical Applications and Methods
    • /
    • v.16 no.1
    • /
    • pp.185-193
    • /
    • 2009
  • Machine learning methods such as support vector machines and random forests yield nonparametric prediction functions of the form y = $f(x_1,{\ldots},x_p)$. As a sequel to the previous article (Huh and Lee, 2008) for visualizing nonparametric functions, I propose more sensible graphs for visualizing y = $f(x_1,{\ldots},x_p)$ herein which has two clear advantages over the previous simple graphs. New graphs will show a small number of prototype curves of $f(x_1,{\ldots},x_{j-1},x_j,x_{j+1}{\ldots},x_p)$, revealing statistically plausible portion over the interval of $x_j$ which changes with ($x_1,{\ldots},x_{j-1},x_{j+1},{\ldots},x_p$). To complement the visual display, matching importance measures for each of p predictor variables are produced. The proposed graphs and importance measures are validated in simulated settings and demonstrated for an environmental study.

Nonparametric Change-point Estimation with Rank and Mean Functions in a Location Parameter Change Model (위치모수 변화 모형에서 순위함수와 평균함수를 이용한 비모수적 변화점 추정)

  • Kim, Jae-Hee;Lee, Kyoung-Won
    • Journal of the Korean Data and Information Science Society
    • /
    • v.11 no.2
    • /
    • pp.279-293
    • /
    • 2000
  • This article suggests two change-point estimators which are modifications of Carlstein(1988) change-point estimators with rank functions and mean functions where there is one change-point in a mean function. A comparison study of Carlstein(1988) estimators and proposed estimators is done by simulation on the mean, the MSE, and the proportion of matching true change-point.

  • PDF

Size, Scale and Rotation Invariant Proposed Feature vectors for Trademark Recognition

  • Faisal zafa, Muhammad;Mohamad, Dzulkifli
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1420-1423
    • /
    • 2002
  • The classification and recognition of two-dimensional trademark patterns independently of their position, orientation, size and scale by proposing two feature vectors has been discussed. The paper presents experimentation on two feature vectors showing size- invariance and scale-invariance respectively. Both feature vectors are equally invariant to rotation as well. The feature extraction is based on local as well as global statistics of the image. These feature vectors have appealing mathematical simplicity and are versatile. The results so far have shown the best performance of the developed system based on these unique sets of feature. The goal has been achieved by segmenting the image using connected-component (nearest neighbours) algorithm. Second part of this work considers the possibility of using back propagation neural networks (BPN) for the learning and matching tasks, by simply feeding the feature vectosr. The effectiveness of the proposed feature vectors is tested with various trademarks, not used in learning phase.

  • PDF

Item sum techniques for quantitative sensitive estimation on successive occasions

  • Priyanka, Kumari;Trisandhya, Pidugu
    • Communications for Statistical Applications and Methods
    • /
    • v.26 no.2
    • /
    • pp.175-189
    • /
    • 2019
  • The problem of the estimation of quantitative sensitive variable using the item sum technique (IST) on successive occasions has been discussed. IST difference, IST regression, and IST general class of estimators have been proposed to estimate quantitative sensitive variable at the current occasion in two occasion successive sampling. The proposed new estimators have been elaborated under Trappmann et al. (Journal of Survey Statistics and Methodology, 2, 58-77, 2014) as well as Perri et al. (Biometrical Journal, 60, 155-173, 2018) allocation designs to allocate long list and short list samples of IST. The properties of all proposed estimators have been derived including optimum replacement policy. The proposed estimators have been mutually compared under the above mentioned allocation designs. The comparison has also been conducted with a direct method. Numerical applications through empirical as well as simplistic simulation has been used to show how the illustrated IST on successive occasions may venture in practical situations.

Matching prediction on Korean professional volleyball league (한국 프로배구 연맹의 경기 예측 및 영향요인 분석)

  • Heesook Kim;Nakyung Lee;Jiyoon Lee;Jongwoo Song
    • The Korean Journal of Applied Statistics
    • /
    • v.37 no.3
    • /
    • pp.323-338
    • /
    • 2024
  • This study analyzes the Korean professional volleyball league and predict match outcomes using popular machine learning classification methods. Match data from the 2012/2013 to 2022/2023 seasons for both male and female leagues were collected, including match details. Two different data structures were applied to the models: Separating matches results into two teams and performance differentials between the home and away teams. These two data structures were applied to construct a total of four predictive models, encompassing both male and female leagues. As specific variable values used in the models are unavailable before the end of matches, the results of the most recent 3 to 4 matches, up until just before today's match, were preprocessed and utilized as variables. Logistc Regrssion, Decision Tree, Bagging, Random Forest, Xgboost, Adaboost, and Light GBM, were employed for classification, and the model employing Random Forest showed the highest predictive performance. The results indicated that while significant variables varied by gender and data structure, set success rate, blocking points scored, and the number of faults were consistently crucial. Notably, our win-loss prediction model's distinctiveness lies in its ability to provide pre-match forecasts rather than post-event predictions.

A Performance Comparison of VSCA and VSDA Adaptive Equalization Algorithm using Distance Adjusted Approach in QAM Signal (QAM 신호에서 Distance Adjusted Approach를 이용한 VSCA와 VSDA 적응 등화 알고리즘의 성능 비교)

  • Lim, Seung Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.139-145
    • /
    • 2015
  • This paper compare the VSCA (Variable stepsize Square Contour Algorithm) and VSDA (Variable stepsize Square contour Decision directed Algorithm) adaptive equalization algorithm that is used for the minimization of the intersymbol interference which occurs in the time dispersive channel for the transmission of 16-QAM signal.. In the SCA, it is possible to compensates the amplitude and phase in the received signal that are mixed with the intersymbol interference by the constellatin dependent constant by using the 2nd order statistics of the transmitted signal. But in the VSCA and VSDA, it is possible to the improving the equalization performance by varing the stepsize using the concept of distance adjusted approach for constellation matching. We compare the performance of the VSCA and VSDA algorithm by the computer simulation. For this, the equalizer output signal constellation, residual isi, maximum distortion and MSE were used in the performace index. As a result of computer simulation, the VSCA algorithm has better than the VSDA in every performance index.

A Prediction Search Algorithm in Video Coding by using Neighboring-Block Motion Vectors (비디오 코딩을 위한 인접블록 움직임 벡터를 이용한 예측 탐색 알고리즘)

  • Kwak, Sung-Keun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.8
    • /
    • pp.3697-3705
    • /
    • 2011
  • There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose a new prediction search algorithm for block matching using the temporal and spatial correlation of the video sequence and local statistics of neighboring motion vectors. The proposed ANBA(Adaptive Neighboring-Block Search Algorithm) determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and use a previous motion vector. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 1.06dB as depend on the video sequences and improved about 0.01~0.64dB over MVFAST and PMVFAST.