• Title/Summary/Keyword: Squares

검색결과 3,103건 처리시간 0.031초

Geographically weighted least squares-support vector machine

  • Hwang, Changha;Shim, Jooyong
    • Journal of the Korean Data and Information Science Society
    • /
    • 제28권1호
    • /
    • pp.227-235
    • /
    • 2017
  • When the spatial information of each location is given specifically as coordinates it is popular to use the geographically weighted regression to incorporate the spatial information by assuming that the regression parameters vary spatially across locations. In this paper, we relax the linearity assumption of geographically weighted regression and propose a geographically weighted least squares-support vector machine for estimating geographically weighted mean by using the basic concept of kernel machines. Generalized cross validation function is induced for the model selection. Numerical studies with real datasets have been conducted to compare the performance of proposed method with other methods for predicting geographically weighted mean.

수정된 최소자승법을 이용한 간접 적응 극배치 제어기에 관한 연구 (A Study on Indirect Adaptive Pole Placement Controller using a Modified Least Squares Method)

  • 한영성;정영주;노태석;조규복
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1992년도 하계학술대회 논문집 A
    • /
    • pp.319-322
    • /
    • 1992
  • This paper proposes indirect adaptive pole placement adaptive controller using a modified least squares method. If an adaptive controller has good performance, it is necessary that an estimator have fast convergence. This paper presents a modified least squares method which guarantees the stability of estimator and has fast convergence. In this algorithm, information on signal level is obtained from the determinent of covariance matrix and according to it, weighting factor is tuned.

  • PDF

Modeling of the Centerless Infeed (Plunge) Grinding Process

  • Kim, Kang
    • Journal of Mechanical Science and Technology
    • /
    • 제17권7호
    • /
    • pp.1026-1035
    • /
    • 2003
  • A computer simulation method for investigating the form generation mechanism in the centerless infeed (plunge) grinding process is described. For a 3-D simulation model of form generation, contact points are assumed to be on least squares contact lines at the grinding wheel, regulating wheel, and work-rest blade. Using force and deflection analyses, the validity of this assumption is shown. Based on the 2-D simulation model developed in the previous work and the least squares contact line assumption, a 3-D model is presented. To validate this model, simulation results were compared with the experimental works. The experiments and computer simulations were carried out using three types of cylindrical workpiece shapes with varying flat length. The experimental results agree well with the simulation. It can be seen that the effect of flat end propagated to the opposite end through workpiece reorientation.

로버스트추정에 의한 지구물리자료의 역산 (Inversion of Geophysical Data with Robust Estimation)

  • 김희준
    • 자원환경지질
    • /
    • 제28권4호
    • /
    • pp.433-438
    • /
    • 1995
  • The most popular minimization method is based on the least-squares criterion, which uses the $L_2$ norm to quantify the misfit between observed and synthetic data. The solution of the least-squares problem is the maximum likelihood point of a probability density containing data with Gaussian uncertainties. The distribution of errors in the geophysical data is, however, seldom Gaussian. Using the $L_2$ norm, large and sparsely distributed errors adversely affect the solution, and the estimated model parameters may even be completely unphysical. On the other hand, the least-absolute-deviation optimization, which is based on the $L_1$ norm, has much more robust statistical properties in the presence of noise. The solution of the $L_1$ problem is the maximum likelihood point of a probability density containing data with longer-tailed errors than the Gaussian distribution. Thus, the $L_1$ norm gives more reliable estimates when a small number of large errors contaminate the data. The effect of outliers is further reduced by M-fitting method with Cauchy error criterion, which can be performed by iteratively reweighted least-squares method.

  • PDF

Pathway and Network Analysis in Glioma with the Partial Least Squares Method

  • Gu, Wen-Tao;Gu, Shi-Xin;Shou, Jia-Jun
    • Asian Pacific Journal of Cancer Prevention
    • /
    • 제15권7호
    • /
    • pp.3145-3149
    • /
    • 2014
  • Gene expression profiling facilitates the understanding of biological characteristics of gliomas. Previous studies mainly used regression/variance analysis without considering various background biological and environmental factors. The aim of this study was to investigate gene expression differences between grade III and IV gliomas through partial least squares (PLS) based analysis. The expression data set was from the Gene Expression Omnibus database. PLS based analysis was performed with the R statistical software. A total of 1,378 differentially expressed genes were identified. Survival analysis identified four pathways, including Prion diseases, colorectal cancer, CAMs, and PI3K-Akt signaling, which may be related with the prognosis of the patients. Network analysis identified two hub genes, ELAVL1 and FN1, which have been reported to be related with glioma previously. Our results provide new understanding of glioma pathogenesis and prognosis with the hope to offer theoretical support for future therapeutic studies.

CONDITION NUMBERS WITH THEIR CONDITION NUMBERS FOR THE WEIGHTED MOORE-PENROSE INVERSE AND THE WEIGHTED LEAST SQUARES SOLUTION

  • Kang Wenhua;Xiang Hua
    • Journal of applied mathematics & informatics
    • /
    • 제22권1_2호
    • /
    • pp.95-112
    • /
    • 2006
  • In this paper, the authors investigate the condition number with their condition numbers for weighted Moore-Penrose inverse and weighted least squares solution of min /Ax - b/M, where A is a rank-deficient complex matrix in $C^{m{\times}n} $ and b a vector of length m in $C^m$, x a vector of length n in $C^n$. For the normwise condition number, the sensitivity of the relative condition number itself is studied, the componentwise perturbation is also investigated.

THE (R,S)-SYMMETRIC SOLUTIONS TO THE LEAST-SQUARES PROBLEM OF MATRIX EQUATION AXB = C

  • Liang, Mao-Lin;Dai, Li-Fang;Wang, San-Fu
    • Journal of applied mathematics & informatics
    • /
    • 제27권5_6호
    • /
    • pp.1061-1071
    • /
    • 2009
  • For real generalized reflexive matrices R, S, i.e., $R^T$ = R, $R^2$ = I, $S^T$ = S, $S^2$ = I, we say that real matrix X is (R,S)-symmetric, if RXS = X. In this paper, an iterative algorithm is proposed to solve the least-squares problem of matrix equation AXB = C with (R,S)-symmetric X. Furthermore, the optimal approximation solution to given matrix $X_0$ is also derived by this iterative algorithm. Finally, given numerical example and its convergent curve show that this method is feasible and efficient.

  • PDF

Conservative Quadratic RSM combined with Incomplete Small Composite Design and Conservative Least Squares Fitting

  • Kim, Min-Soo;Heo, Seung-Jin
    • Journal of Mechanical Science and Technology
    • /
    • 제17권5호
    • /
    • pp.698-707
    • /
    • 2003
  • A new quadratic response surface modeling method is presented. In this method, the incomplete small composite design (ISCD) is newly proposed to .educe the number of experimental runs than that of the SCD. Unlike the SCD, the proposed ISCD always gives a unique design assessed on the number of factors, although it may induce the rank-deficiency in the normal equation. Thus, the singular value decomposition (SVD) is employed to solve the normal equation. Then, the duality theory is used to newly develop the conservative least squares fitting (CONFIT) method. This can directly control the ever- or the under-estimation behavior of the approximate functions. Finally, the performance of CONFIT is numerically shown by comparing its'conservativeness with that of conventional fitting method. Also, optimizing one practical design problem numerically shows the effectiveness of the sequential approximate optimization (SAO) combined with the proposed ISCD and CONFIT.

유전 알고리즘을 이용한 강성회전체의 평형잡이 (Balancing of a Rigid Rotor using Genetic Algorithms)

  • 양보석;주호진
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제20권2호
    • /
    • pp.108-108
    • /
    • 1996
  • This paper describes a new approach to solve balancing of a rigid rotor. In this paper, the balancing of the rigid rotor using genetic algorithms, which are search algorithms based on the mechanics of natural selection and natural genetics is proposed. Under the assumption that the initial vibration values used to calculate correction masses contain errors, the influence coefficient method, the least squares method and a genetic algorithm are compared. The results show that the vibration amplitude obtained with the least squares method and the genetic algorithm is smaller than that obtained with the influence coefficient method.

유전 알고리즘을 이용한 강성회전체의 평형잡이 (Balancing of a Rigid Rotor using Genetic Algorithms)

  • 양보석;주호진
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제20권2호
    • /
    • pp.40-47
    • /
    • 1996
  • This paper describes a new approach to solve balancing of a rigid rotor. In this paper, the balancing of the rigid rotor using genetic algorithms, which are search algorithms based on the mechanics of natural selection and natural genetics is proposed. Under the assumption that the initial vibration values used to calculate correction masses contain errors, the influence coefficient method, the least squares method and a genetic algorithm are compared. The results show that the vibration amplitude obtained with the least squares method and the genetic algorithm is smaller than that obtained with the influence coefficient method.

  • PDF