• 제목/요약/키워드: local linear method

검색결과 420건 처리시간 0.022초

ON MARGINAL INTEGRATION METHOD IN NONPARAMETRIC REGRESSION

  • Lee, Young-Kyung
    • Journal of the Korean Statistical Society
    • /
    • 제33권4호
    • /
    • pp.435-447
    • /
    • 2004
  • In additive nonparametric regression, Linton and Nielsen (1995) showed that the marginal integration when applied to the local linear smoother produces a rate-optimal estimator of each univariate component function for the case where the dimension of the predictor is two. In this paper we give new formulas for the bias and variance of the marginal integration regression estimators which are valid for boundary areas as well as fixed interior points, and show the local linear marginal integration estimator is in fact rate-optimal when the dimension of the predictor is less than or equal to four. We extend the results to the case of the local polynomial smoother, too.

F.A.M.을 이용한 공동 내부의 유동해석 (Analysis of Flow Field in Cavity Using Finite Analytic Method)

  • 박명규;정정환;김동진
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제15권4호
    • /
    • pp.46-53
    • /
    • 1991
  • In the present study, Navier-Stokes equation is numerically solved by use of a Finite analytic method to obtain the 2-dimensional flow field in the square cavity. The basic idea of F.A.M. is the incorporation of local analytic solutions in the numerical solution of linear or non-linear partial differential equations. In the F.A.M., the total problem is subdivided into a number of all elements. The local analytic solution is obtained for the small element in which the governing equation, if non-linear, to be linearized. The local analytic solutions are then expressed in algebraic form and are overlapped to cover the entire region of the problem. The assembly of these local analytic solutions, which still preserve the overall nonlinearity of the governing equations, results in a system of linear algebraic equations. The system of algebraic equations is then solved to provide the numerical solutions of the total problem. The computed flow field shows the same characteristics to physical concept of flow phenomena.

  • PDF

직교요인을 이용한 국소선형 로지스틱 마이크로어레이 자료의 판별분석 (Local Linear Logistic Classification of Microarray Data Using Orthogonal Components)

  • 백장선;손영숙
    • 응용통계연구
    • /
    • 제19권3호
    • /
    • pp.587-598
    • /
    • 2006
  • 본 논문에서는 마이크로어레이 (microarray) 자료에 판별분석을 적용 시 나타나는 고차원 및 소표본 문제의 해결방법으로서 직교요인을 새로운 특징변수로 사용한 비모수적 국소선형 로지스틱 판별분석을 제안한다. 제안된 방법은 국소우도에 기반한 것으로서 다범주 판별분석에 적용될 수 있으며, 고려된 직교인자는 주성분 요인, 부분최소제곱 요인, 인자분석 요인 등이다. 대표적인 두 가지 실제 마이크로어레이 자료에 적용한 결과 직교요인들 중에서 부분최소제곱 요인을 특징변수로 사용한 경우 고전적인 통계적 판별분석보다 향상된 분류 능력을 나타내고 있음을 확인하였다.

선형보간법에 의한 자료 희소성 해결방안의 문제와 대안 (Robust Interpolation Method for Adapting to Sparse Design in Nonparametric Regression)

  • 박동련
    • 응용통계연구
    • /
    • 제20권3호
    • /
    • pp.561-571
    • /
    • 2007
  • 국소선형회귀모형의 추정량은 좋은 특성을 가지고 있는 추정량으로서 가장 흔히 사용되는 비모수적 회귀모형의 추정량이라고 하겠다. 이러한 국소선형 추정량이 자료가 희박한 구간에서는 심하게 왜곡된 추정결과를 보이는 문제가 있으며, Hall과 Turlach(1997)이 제안한 선형보간법이 이러한 문제에 대한 매우 효과적인 해결방안이라는 것은 잘 알려진 사실이다. 그러나 Hall과 Turlach가 제안한 선형보간법이 이상값에 매우 취약하다는 사실은 아직 지적된 적이 없는 문제이다. 이 논문에서는 이상값의 영향력을 감소시킬 수 있는 수정된 선형보간법에 의한 유사자료의 생성방법을 제안하고, 그 특성을 모의실험을 통하여 기존의 방법과 비교하였다.

신경회로망을 이용한 상호 연결된 시스템의 비집중 제어와 평면 로봇 매니퓰레이터에의 응용 (Decentralized control of interconnected systems using a neuro-coordinator and an application to a planar robot manipulator)

  • 정희태;전기준
    • 제어로봇시스템학회논문지
    • /
    • 제2권2호
    • /
    • pp.88-95
    • /
    • 1996
  • It is inevitable for local systems to have deviations which represent interactions and modeling errors originated from the decomposition process of a large scale system. This paper presents a decentralized control scheme for interconnected systems using local linear models and a neuro-coordinator. In the proposed method, the local system is composed of a linear model and unknown deviations caused by linearizing the subsystems around operating points or by estimating parameters of the subsystems. Because the local system has unmeasurable deviations we define a local reference model which consists of a local linear model and a neural network to estimate the deviations indirectly. The reference model is reformed into a linear model which has no deviations through a transformation of input variables and we obtain an optimum feedback control law which minimizes a local performance index. Finally, we derive a decentralized feedback control law which consists of local linear states and neural network outputs. In the decentralized control, the neuro-coordinator generates a corrective control signal to cancel the effect of deviations through backpropagation learning with the errors obtained from the differences of the local system outputs and reference model outputs. Also, the stability of local system is proved by the degree of learning of the neural network under an assumption on a neural network learning index. It is shown by computer simulations that the proposed control scheme can be applied successfully to the control of a biased two-link planar robot manipulator.

  • PDF

ASYMPTOTIC PROPERTIES OF THE CONDITIONAL HAZARD FUNCTION ESTIMATE BY THE LOCAL LINEAR METHOD FOR FUNCTIONAL ERGODIC DATA

  • MOHAMMED BASSOUDI;ABDERRAHMANE BELGUERNA;HAMZA DAOUDI;ZEYNEB LAALA
    • Journal of applied mathematics & informatics
    • /
    • 제41권6호
    • /
    • pp.1341-1364
    • /
    • 2023
  • This article introduces a method for estimating the conditional hazard function of a real-valued response variable based on a functional variable. The method uses local linear estimation of the conditional density and cumulative distribution function and is applied to a functional stationary ergodic process where the explanatory variable is in a semi-metric space and the response is a scalar value. We also examine the uniform almost complete convergence of this estimation technique.

An Integer Programming-based Local Search for the Multiple-choice Multidimensional Knapsack Problem

  • Hwang, Junha
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권12호
    • /
    • pp.1-9
    • /
    • 2018
  • The multiple-choice multidimensional knapsack problem (MMKP) is a variant of the well known 0-1 knapsack problem, which is known as an NP-hard problem. This paper proposes a method for solving the MMKP using the integer programming-based local search (IPbLS). IPbLS is a kind of a local search and uses integer programming to generate a neighbor solution. The most important thing in IPbLS is the way to select items participating in the next integer programming step. In this paper, three ways to select items are introduced and compared on 37 well-known benchmark data instances. Experimental results shows that the method using linear programming is the best for the MMKP. It also shows that the proposed method can find the equal or better solutions than the best known solutions in 23 data instances, and the new better solutions in 13 instances.

비선형 구조물에 대한 이동 점근법(MMA)의 적용 (Application of Method of Moving Asymptotes for Non-Linear Structures)

  • 진경욱;한석영;최동훈
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 1999년도 춘계학술대회 논문집
    • /
    • pp.141-146
    • /
    • 1999
  • A new method, so called MMA(Method of Moving Asymptotes) was applied to the optimization problems of non-linear functions and non-linear structures. In each step of the iterative process, tile MMA generates a strictly convex approximation subproblems and solves them by using the dual problems. The generation of these subproblems is controlled by so called 'moving asymptotes', which may both make no oscillation and speed up tile convergence rate of optimization process. By contrast in generalized dual function, the generated function by MMA is always explicit type. Both the objective and behaviour constraints which were approximated are optimized by dual function. As the results of some examples, it was found that this method is very effective to obtain the global solution for problems with many local solutions. Also it was found that MMA is a very effective approximate method using the original function and its 1st derivatives.

  • PDF

Improved Gradient Direction Assisted Linking Algorithm for Linear Feature Extraction in High Resolution Satellite Images, an Iterative Dynamic Programming Approach

  • Yang, Kai;Liew, Soo Chin;Lee, Ken Yoong;Kwoh, Leong Keong
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
    • /
    • pp.408-410
    • /
    • 2003
  • In this paper, an improved gradient direction assisted linking algorithm is proposed. This algorithm begins with initial seeds satisfying some local criteria. Then it will search along the direction provided by the initial point. A window will be generated in the gradient direction of the current point. Instead of the conventional method which only considers the value of the local salient structure, an improved mathematical model is proposed to describe the desired linear features. This model not only considers the value of the salient structure but also the direction of it. Furthermore, the linking problem under this model can be efficiently solved by dynamic programming method. This algorithm is tested for linear features detection in IKONOS images. The result demonstrates this algorithm is quite promising.

  • PDF