• 제목/요약/키워드: least-squares

검색결과 2,590건 처리시간 0.028초

Asymmetric least squares regression estimation using weighted least squares support vector machine

  • Hwan, Chang-Ha
    • Journal of the Korean Data and Information Science Society
    • /
    • 제22권5호
    • /
    • pp.999-1005
    • /
    • 2011
  • This paper proposes a weighted least squares support vector machine for asymmetric least squares regression. This method achieves nonlinear prediction power, while making no assumption on the underlying probability distributions. The cross validation function is introduced to choose optimal hyperparameters in the procedure. Experimental results are then presented which indicate the performance of the proposed model.

A SPLIT LEAST-SQUARES CHARACTERISTIC MIXED FINITE ELEMENT METHOD FOR THE CONVECTION DOMINATED SOBOLEV EQUATIONS

  • OHM, MI RAY;SHIN, JUN YONG
    • Journal of applied mathematics & informatics
    • /
    • 제34권1_2호
    • /
    • pp.19-34
    • /
    • 2016
  • In this paper, we present a split least-squares characteristic mixed finite element method(MFEM) to get the approximate solutions of the convection dominated Sobolev equations. First, to manage both convection term and time derivative term efficiently, we apply a least-squares characteristic MFEM to get the system of equations in the primal unknown and the flux unknown. Then, we obtain a split least-squares characteristic MFEM to convert the coupled system in two unknowns derived from the least-squares characteristic MFEM into two uncoupled systems in the unknowns. We theoretically prove that the approximations constructed by the split least-squares characteristic MFEM converge with the optimal order in L2 and H1 normed spaces for the primal unknown and with the optimal order in L2 normed space for the flux unknown. And we provide some numerical results to confirm the validity of our theoretical results.

EFFICIENT ESTIMATION OF THE REGULARIZATION PARAMETERS VIA L-CURVE METHOD FOR TOTAL LEAST SQUARES PROBLEMS

  • Lee, Geunseop
    • 대한수학회지
    • /
    • 제54권5호
    • /
    • pp.1557-1571
    • /
    • 2017
  • The L-curve method is a parametric plot of interrelation between the residual norm of the least squares problem and the solution norm. However, the L-curve method may be hard to apply to the total least squares problem due to its no closed form solution of the regularized total least squares problems. Thus the sequence of the solution norm under the fixed regularization parameter and its corresponding residual need to be found with an efficient manner. In this paper, we suggest an efficient algorithm to find the sequence of the solutions and its residual in order to plot the L-curve for the total least squares problems. In the numerical experiments, we present that the proposed algorithm successfully and efficiently plots fairly 'L' like shape for some practical regularized total least squares problems.

최소 제곱 무요소법과 적분 오차 (Least-Squares Meshfree Method and Integration Error)

  • 박상훈;윤성기
    • 대한기계학회논문집A
    • /
    • 제25권10호
    • /
    • pp.1605-1612
    • /
    • 2001
  • Least-squares meshfree method is presented. Conventional meshfree methods based on the Galerkin formulation suffer from inaccurate numerical integration. Least-squares formulation exhibits rather different integration-related characteristics. It is demonstrated through numerical examples that least-squares formulation is much more robust to integration errors than the Galerkin's. Therefore efficient meshfree methods can be devised by combining very simple integration algorithms and least-squares formulation.

DETECTION OF OUTLIERS IN WEIGHTED LEAST SQUARES REGRESSION

  • Shon, Bang-Yong;Kim, Guk-Boh
    • Journal of applied mathematics & informatics
    • /
    • 제4권2호
    • /
    • pp.501-512
    • /
    • 1997
  • In multiple linear regression model we have presupposed assumptions (independence normality variance homogeneity and so on) on error term. When case weights are given because of variance heterogeneity we can estimate efficiently regression parameter using weighted least squares estimator. Unfortunately this estimator is sen-sitive to outliers like ordinary least squares estimator. Thus in this paper we proposed some statistics for detection of outliers in weighted least squares regression.

Limiting Distributions of Trimmed Least Squares Estimators in Unstable AR(1) Models

  • Lee, Sangyeol
    • Journal of the Korean Statistical Society
    • /
    • 제28권2호
    • /
    • pp.151-165
    • /
    • 1999
  • This paper considers the trimmed least squares estimator of the autoregression parameter in the unstable AR(1) model: X\ulcorner=ØX\ulcorner+$\varepsilon$\ulcorner, where $\varepsilon$\ulcorner are iid random variables with mean 0 and variance $\sigma$$^2$> 0, and Ø is the real number with │Ø│=1. The trimmed least squares estimator for Ø is defined in analogy of that of Welsh(1987). The limiting distribution of the trimmed least squares estimator is derived under certain regularity conditions.

  • PDF

LMS and LTS-type Alternatives to Classical Principal Component Analysis

  • Huh, Myung-Hoe;Lee, Yong-Goo
    • Communications for Statistical Applications and Methods
    • /
    • 제13권2호
    • /
    • pp.233-241
    • /
    • 2006
  • Classical principal component analysis (PCA) can be formulated as finding the linear subspace that best accommodates multidimensional data points in the sense that the sum of squared residual distances is minimized. As alternatives to such LS (least squares) fitting approach, we produce LMS (least median of squares) and LTS (least trimmed squares)-type PCA by minimizing the median of squared residual distances and the trimmed sum of squares, in a similar fashion to Rousseeuw (1984)'s alternative approaches to LS linear regression. Proposed methods adopt the data-driven optimization algorithm of Croux and Ruiz-Gazen (1996, 2005) that is conceptually simple and computationally practical. Numerical examples are given.

RLS (Recursive Least Squares)와 RTLS (Recursive Total Least Squares)의 결합을 이용한 새로운 FIR 시스템 인식 방법 (FIR System Identification Method Using Collaboration Between RLS (Recursive Least Squares) and RTLS (Recursive Total Least Squares))

  • 임준석;편용국
    • 한국음향학회지
    • /
    • 제29권6호
    • /
    • pp.374-380
    • /
    • 2010
  • 잡음이 섞인 입출력 신호를 갖는 시스템 인식 문제는 완전 최소 자승법 (Total Least Squares (TLS))으로 알려져 있다. 완전 최소 자승법의 성능은 입력 신호 부가 잡음 파워와 출력 신호 부가 잡음간의 분산비에 매우 민감하다. 본 논문에서는 TLS의 성능 향상을 위해서 LS (Least Squares)와의 결합을 제안한다. 그 한 형태로 재차적인 TLS (Recursive TLS)와 재차적인 LS (Recursive Least Squares)간의 결합 알고리즘을 제안한다. 이 결합은 잡음간 분산비에 강인한 결과를 낳았다. 모의실험을 통해 얻은 결과로부터 입력 신호에 신호대 잡음비가 5dB를 유지히는 잡음을 부가할 경우 입력 잡음과출력 잡음의 비 $\gamma$가 약 20 정도까지로 적용 범위가 확대되는 결과를 얻었다. 따라서 제안된 결합 방법이 기존의 TLS의 적용 범위를 넓힐 수 있음을 알 수 있다.

강소성 변형 해석을 위한 최소 제곱 무요소법 (The Least-Squares Meshfree Method for the Analysis of Rigid-Plastic Deformation)

  • 윤성기;권기찬
    • 대한기계학회논문집A
    • /
    • 제28권12호
    • /
    • pp.2019-2031
    • /
    • 2004
  • The least-squares formulation for rigid-plasticity based on J$_2$-flow rule and infinitesimal theory and its meshfree implementation using moving least-squares approximation are proposed. In the least-squares formulation the squared residuals of the constitutive and equilibrium equations are minimized. Those residuals are represented in a form of first-order differential system using the velocity and stress components as independent variables. For the enforcement of the boundary and frictional contact conditions, penalty scheme is employed. Also the reshaping of nodal supports is introduced to avoid the difficulties due to the severe local deformation near the contact interface. The proposed least-squares meshfree method does not require any structure of extrinsic cells during the whole process of analysis. Through some numerical examples of metal forming processes, the validity and effectiveness of the method are investigated.

AN ITERATIVE ALGORITHM FOR THE LEAST SQUARES SOLUTIONS OF MATRIX EQUATIONS OVER SYMMETRIC ARROWHEAD MATRICES

  • Ali Beik, Fatemeh Panjeh;Salkuyeh, Davod Khojasteh
    • 대한수학회지
    • /
    • 제52권2호
    • /
    • pp.349-372
    • /
    • 2015
  • This paper concerns with exploiting an oblique projection technique to solve a general class of large and sparse least squares problem over symmetric arrowhead matrices. As a matter of fact, we develop the conjugate gradient least squares (CGLS) algorithm to obtain the minimum norm symmetric arrowhead least squares solution of the general coupled matrix equations. Furthermore, an approach is offered for computing the optimal approximate symmetric arrowhead solution of the mentioned least squares problem corresponding to a given arbitrary matrix group. In addition, the minimization property of the proposed algorithm is established by utilizing the feature of approximate solutions derived by the projection method. Finally, some numerical experiments are examined which reveal the applicability and feasibility of the handled algorithm.