• Title/Summary/Keyword: LAD

Search Result 168, Processing Time 0.019 seconds

Narrowband Signal Localization Based on Enhanced LAD Method

  • Jia, Ke Xin;He, Zi Shu
    • Journal of Communications and Networks
    • /
    • v.13 no.1
    • /
    • pp.6-11
    • /
    • 2011
  • In this paper, an enhanced localization algorithm based on double thresholds (LAD) is proposed for localizing narrowband signals in the frequency domain. A simplified LAD method is first studied to reduce the computational complexity of the original LAD method without performance loss. The upper and lower thresholds of the simplified LAD method are directly calculated by running the forward consecutive mean excision algorithm only once. By combining the simplified LAD method and binary morphological operators, the enhanced LAD method is then proposed and its performance is simply discussed. The simulation results verify the correctness of discussion and show that the enhanced LAD method is superior to the LAD with adjacent cluster combining method, especially at low signal-to-noise ratio.

Trimmed LAD Estimators for Multidimensional Contingency Tables (분할표 분석을 위한 절사 LAD 추정량과 최적 절사율 결정)

  • Choi, Hyun-Jip
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.6
    • /
    • pp.1235-1243
    • /
    • 2010
  • This study proposes a trimmed LAD(least absolute deviation) estimators for multi-dimensional contingency tables and suggests an algorithm to estimate it. In addition, a method to determine the trimming quantity of the estimators is suggested. A Monte Carlo study shows that the propose method yields a better trimming rate and coverage rate than the previously suggest method based on the determinant of the covariance matrix.

Optimization-Based Pattern Generation for LAD (최적화에 기반을 둔 LAD의 패턴 생성 기법)

  • Jang, In-Yong;Ryoo, Hong-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.11-18
    • /
    • 2006
  • The logical analysis of data(LAD) is a Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a novel optimization-based pattern generation methodology and propose two mathematical programming models, a mixed 0-1 integer and linear programming (MILP) formulation and a well-studied set covering problem (SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with ease patterns of high complexity that cannot be generated with the conventional approach.

  • PDF

Comparison of Bootstrap Methods for LAD Estimator in AR(1) Model

  • Kang, Kee-Hoon;Shin, Key-Il
    • Communications for Statistical Applications and Methods
    • /
    • v.13 no.3
    • /
    • pp.745-754
    • /
    • 2006
  • It has been shown that LAD estimates are more efficient than LS estimates when the error distribution is double exponential in AR(1) model. In order to explore the performance of LAD estimates one can use bootstrap approaches. In this paper we consider the efficiencies of bootstrap methods when we apply LAD estimates with highly variable data. Monte Carlo simulation results are given for comparing generalized bootstrap, stationary bootstrap and threshold bootstrap methods.

Bootstrap of LAD Estimate in Infinite Variance AR(1) Processes

  • Kang, Hee-Jeong
    • Journal of the Korean Statistical Society
    • /
    • v.26 no.3
    • /
    • pp.383-395
    • /
    • 1997
  • This paper proves that the standard bootstrap approximation for the least absolute deviation (LAD) estimate of .beta. in AR(1) processes with infinite variance error terms is asymptotically valid in probability when the bootstrap resample size is much smaller than the original sample size. The theoretical validity results are supported by simulation studies.

  • PDF

Optimization-Based Pattern Generation for LAD (최적화에 근거한 LAD의 패턴생성 기법)

  • Jang, In-Yong;Ryoo, Hong-Seo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.10a
    • /
    • pp.409-413
    • /
    • 2005
  • The logical analysis of data(LAD) is an effective Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a new optimization-based pattern generation methodology and propose two mathematical programming medels, a mixed 0-1 integer and linear programming(MILP) formulation and a well-studied set covering problem(SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with much ease patterns of high complexity that cannot be generated with the conventional approach.

  • PDF

LAD Estimators for Categorical Data Analysis (범주형 자료 분석을 위한 LAD 추정량)

  • 최현집
    • The Korean Journal of Applied Statistics
    • /
    • v.16 no.1
    • /
    • pp.55-69
    • /
    • 2003
  • In this article, we propose the weighted LAD (least absolute deviations) estimators for multi-dimensional contingency tables and drive an estimation method to estimate the proposed estimators. To illustrate the robustness of the estimators, simulation results are presented for several models Including log-linear models and models for ordinal variables in multidimensional contingency tables. Examples were also introduced.

Olefin/Paraffin Separation though Facilitated Transport Membranes in Solid State

  • Hong, Seong-Uk;Won, Jong-Ok;Hong, Jae-Min;Park, Hyun-Chae;Kang, Yong-Soo
    • Proceedings of the Membrane Society of Korea Conference
    • /
    • 1999.07a
    • /
    • pp.15-18
    • /
    • 1999
  • A simple mathematical model for facilitated mass transport through a fixed site carrier membrane was derived by assuming an instantaneous, microscopic concentration (activity) fluctuation. The current model demonstrates that the facilitation factor depends on the extent of concentration fluctuation, the time scale ratios of diffusion to chemical reaction and the ratio of the carrier concentration to the solute solubility in matrix. The model was examined against the experimental data on oxygen transport in membranes containing metallo-porphyrin carriers, and the agreement was exceptional (within 10% error). The basic concept of this approach was applied to separate olefin from olefin/paraffin mixtures. A proprietaty carrier, developed here, resulted that the selectivity of propylene over propane was more than 120 and the propylene permeance exceed 40 gpu.

  • PDF

Strong Representations for LAD Estimators in AR(1) Models

  • Kang, Hee-Jeong;Shin, Key-Il
    • Journal of the Korean Statistical Society
    • /
    • v.27 no.3
    • /
    • pp.349-358
    • /
    • 1998
  • Consider the AR(1) model $X_{t}$=$\beta$ $X_{t-1}$+$\varepsilon$$_{t}$ where $\beta$ < 1 is an unknown parameter to be estimated and {$\varepsilon$$_{t}$} denotes the independent and identically distributed error terms with unknown common distribution function F. In this paper, a strong representation for the least absolute deviation (LAD) estimate of $\beta$ in AR(1) models is obtained under some mild conditions on F. on F.F.

  • PDF