• Title/Summary/Keyword: Chebyshev estimation

Search Result 11, Processing Time 0.025 seconds

The shifted Chebyshev series-based plug-in for bandwidth selection in kernel density estimation

  • Soratja Klaichim;Juthaphorn Sinsomboonthong;Thidaporn Supapakorn
    • Communications for Statistical Applications and Methods
    • /
    • v.31 no.3
    • /
    • pp.337-347
    • /
    • 2024
  • Kernel density estimation is a prevalent technique employed for nonparametric density estimation, enabling direct estimation from the data itself. This estimation involves two crucial elements: selection of the kernel function and the determination of the appropriate bandwidth. The selection of the bandwidth plays an important role in kernel density estimation, which has been developed over the past decade. A range of methods is available for selecting the bandwidth, including the plug-in bandwidth. In this article, the proposed plug-in bandwidth is introduced, which leverages shifted Chebyshev series-based approximation to determine the optimal bandwidth. Through a simulation study, the performance of the suggested bandwidth is analyzed to reveal its favorable performance across a wide range of distributions and sample sizes compared to alternative bandwidths. The proposed bandwidth is also applied for kernel density estimation on real dataset. The outcomes obtained from the proposed bandwidth indicate a favorable selection. Hence, this article serves as motivation to explore additional plug-in bandwidths that rely on function approximations utilizing alternative series expansions.

Algorithm for the Constrained Chebyshev Estimation in Linear Regression

  • Kim, Bu-yong
    • Communications for Statistical Applications and Methods
    • /
    • v.7 no.1
    • /
    • pp.47-54
    • /
    • 2000
  • This article is concerned with the algorithm for the Chebyshev estimation with/without linear equality and/or inequality constraints. The algorithm employs a linear scaling transformation scheme to reduce the computational burden which is induced when the data set is quite large. The convergence of the proposed algorithm is proved. And the updating and orthogonal decomposition techniques are considered to improve the computational efficiency and numerical stability.

  • PDF

Conjoint Analysis Based on the Chebyshev Estimation, with Application to New Product Development of Cellular Phone (체비쉐프추정에 의한 컨조인트분석 : 휴대전화기 신제품 개발에의 활용)

  • 김부용
    • The Korean Journal of Applied Statistics
    • /
    • v.17 no.2
    • /
    • pp.205-218
    • /
    • 2004
  • Conjoint analysis is employed to decompose the consumer's preference judgements into the importance of attributes, and to predict the degree of preference for each profile of the products, services, or ideas. It has been widely used in industrial marketing, particularly in the areas of product positioning and new product development. This paper is mainly concerned with the conjoint analysis based on the Chebyshev estimation since the efficiency of the least squares estimator is lower than that of the Chebyshev estimator when the preferences are measured as the rank-order. A case study is performed on the preference for cellular phones. And it is shown that conjoint analysis based on the Chebyshev estimation is superior, in terms of the predictive validity, to one which is based on the least squares estimation.

NUMERICAL SOLUTION OF THE NONLINEAR KORTEWEG-DE VRIES EQUATION BY USING CHEBYSHEV WAVELET COLLOCATION METHOD

  • BAKIR, Yasemin
    • Honam Mathematical Journal
    • /
    • v.43 no.3
    • /
    • pp.373-383
    • /
    • 2021
  • In this study, a numerical method deals with the Chebyshev wavelet collocation and Adomian decomposition methods are proposed for solving Korteweg-de Vries equation. Integration of the Chebyshev wavelets operational matrices is derived. This problem is reduced to a system of non-linear algebraic equations by using their operational matrix. Thus, it becomes easier to solve KdV problem. The error estimation for the Chebyshev wavelet collocation method and ADM is investigated. The proposed method's validity and accuracy are demonstrated by numerical results. When the exact and approximate solutions are compared, for non-linear or linear partial differential equations, the Chebyshev wavelet collocation method is shown to be acceptable, efficient and accurate.

THE MEAN-SQUARE ERROR BOUNDS FOR THE GAUSSIAN QUADRATURE OF ANALYTIC FUNCTIONS

  • Ko, Kwan-Pyo;Park, U-Jin
    • Journal of the Korean Mathematical Society
    • /
    • v.34 no.2
    • /
    • pp.293-307
    • /
    • 1997
  • In this paper we present the $L^2$-estimation for the kernel $K_n$ of the remaider term for the Gaussian quadrature with respect to one of four Chebyshev weight functions and the error bound of the type on the contour $$ $\mid$R_n(f)$\mid$ \leq \frac{2\pi}{\sqrt{l(\Gamma)}} max_{z\in\Gamma}$\mid$f(z)$\mid$ (\smallint_\Gamma $\mid$K_n(z)$\mid$^2$\mid$dz$\mid$)^\frac{2}{1}, $$ where $l(\Gamma)$ denotes the length of the contour $\Gamma$.

  • PDF

Pre-filtering and Location Estimation of a Loose Part

  • Kim, Jung-Soo;Kim, Tae-Wan;Joon Lyou
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.522-522
    • /
    • 2000
  • In this paper, two pre-filtering techniques are presented for accurately estimating the impact location of a loose part. The reason why a pre-filterng technique Is necessary in a Loose Part Monitoring System is that the effects of background noise on the signal to noise ratio (SNR) can be reduced considerably resulting in improved estimation accuracy. The first method is to take d moving average operation in the time domain. The second one is to adopt band-pass filters designed in the frequency domain such as a Butterworth filter, Chebyshev filter I & II and an Elliptic Filter. To show the effectiveness, the impact test data (signals) from the YGN3 power plant are first preprocessed and then used to estimate the loose pan impact position. Resultantly. we observed that SNR is much improved and the average estimation error is below 7.5%.

  • PDF

Tag Anti-Collision Algorithms in Passive and Semi-passive RFID Systems -Part II : CHI Algorithm and Hybrid Q Algorithm by using Chebyshev's Inequality-

  • Fan, Xiao;Song, In-Chan;Chang, Kyung-Hi;Shin, Dong-Beom;Lee, Heyung-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.8A
    • /
    • pp.805-814
    • /
    • 2008
  • Both EPCglobal Generation-2 (Gen2) for passive RFID systems and Intelleflex for semi-passive RFID systems use probabilistic slotted ALOHA with Q algorithm, which is a kind of dynamic framed slotted ALOHA (DFSA), as the tag anti-collision algorithm. A better tag anti-collision algorithm can reduce collisions so as to increase the efficiency of tag identification. In this paper, we introduce and analyze the estimation methods of the number of slots and tags for DFSA. To increase the efficiency of tag identification, we propose two new tag anti-collision algorithms, which are Chebyshev's inequality (CHI) algorithm and hybrid Q algorithm, and compare them with the conventional Q algorithm and adaptive adjustable framed Q (AAFQ) algorithm, which is mentioned in Part I. The simulation results show that AAFQ performs the best in Gen2 scenario. However, in Intelleflex scenario the proposed hybrid Q algorithm is the best. That is, hybrid Q provides the minimum identification time, shows the more consistent collision ratio, and maximizes throughput and system efficiency in Intelleflex scenario.

Balanced Accuracy and Confidence Probability of Interval Estimates

  • Liu, Yi-Hsin;Stan Lipovetsky;Betty L. Hickman
    • International Journal of Reliability and Applications
    • /
    • v.3 no.1
    • /
    • pp.37-50
    • /
    • 2002
  • Simultaneous estimation of accuracy and probability corresponding to a prediction interval is considered in this study. Traditional application of confidence interval forecasting consists in evaluation of interval limits for a given significance level. The wider is this interval, the higher is probability and the lower is the forecast precision. In this paper a measure of stochastic forecast accuracy is introduced, and a procedure for balanced estimation of both the predicting accuracy and confidence probability is elaborated. Solution can be obtained in an optimizing approach. Suggested method is applied to constructing confidence intervals for parameters estimated by normal and t distributions

  • PDF

Target Ranging Method by Using Near Field Shading Function (Near Field Shading 함수를 이용한 표적 거리 추정 기법)

  • 최주평;이원철
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.199-202
    • /
    • 2002
  • This paper introduces the near field shading beamformer using widely known Chebyshev and Hanning window in the field of digital signal processing. The proposed shading beamformer improves the estimation of range as well as azimuth angle of targe residing in near field. A series of sensor weighting values are calculated from the FFT operation of given shading functions in time domain. This paper verifies the performance of the focused beamformer having the proposed shading sensor weights which are used to detect the range of target. Throughout computer simulations this paper exploits the performance improvement of the proposed shading beamformer as varying the frequency band of the received radiated signal along the non-uniform array.

  • PDF

A spent nuclear fuel source term calculation code BESNA with a new modified predictor-corrector scheme

  • Duy Long Ta ;Ser Gi Hong ;Dae Sik Yook
    • Nuclear Engineering and Technology
    • /
    • v.54 no.12
    • /
    • pp.4722-4730
    • /
    • 2022
  • This paper introduces a new point depletion-based source term calculation code named BESNA (Bateman Equation Solver for Nuclear Applications), which is aimed to estimate nuclide inventories and source terms from spent nuclear fuels. The BESNA code employs a new modified CE/CM (Constant Extrapolation - Constant Midpoint) predictor-corrector scheme in depletion calculations for improving computational efficiency. In this modified CE/CM scheme, the decay components leading to the large norm of the depletion matrix are excluded in the corrector, and hence the corrector calculation involves only the reaction components, which can be efficiently solved with the Talyor Expansion Method (TEM). The numerical test shows that the new scheme substantially reduces computing time without loss of accuracy in comparison with the conventional scheme using CRAM (Chebyshev Rational Approximation Method), especially when the substep calculations are applied. The depletion calculation and source term estimation capability of BESNA are verified and validated through several problems, where results from BESNA are compared with those calculated by other codes as well as measured data. The analysis results show the computational efficiency of the new modified scheme and the reliability of BESNA in both isotopic predictions and source term estimations.