• 제목/요약/키워드: Multiple Linear

검색결과 3,052건 처리시간 0.034초

A Fuzzy-Goal Programming Approach For Bilevel Linear Multiple Objective Decision Making Problem

  • Arora, S.R.;Gupta, Ritu
    • Management Science and Financial Engineering
    • /
    • 제13권2호
    • /
    • pp.1-27
    • /
    • 2007
  • This paper presents a fuzzy-goal programming(FGP) approach for Bi-Level Linear Multiple Objective Decision Making(BLL-MODM) problem in a large hierarchical decision making and planning organization. The proposed approach combines the attractive features of both fuzzy set theory and goal programming(GP) for MODM problem. The GP problem has been developed by fixing the weights and aspiration levels for generating pareto-optimal(satisfactory) solution at each level for BLL-MODM problem. The higher level decision maker(HLDM) provides the preferred values of decision vector under his control and bounds of his objective function to direct the lower level decision maker(LLDM) to search for his solution in the right direction. Illustrative numerical example is provided to demonstrate the proposed approach.

Application of Multiple Imputation Method in Analyzing Data with Missing Continuous Covariates

  • Ghasemizadeh Tamar, S.;Ganjali, M.
    • 응용통계연구
    • /
    • 제21권4호
    • /
    • pp.659-664
    • /
    • 2008
  • Missing continuous covariates are pervasive in the use of generalized linear models for medical data. Multiple imputation is the most common and easy-to-do method of dealing with missing covariate data. However, there are always serious warnings in using this method. There should be concern to make imputed values more proper. In this paper, proper imputation from posterior predictive distribution is developed for implementing with arbitrary priors. We use empirical distribution of the posterior for approximating the posterior predictive distribution, to sample from it. This method is preferable in comparison with a presented imputation method of us which uses a full model to impute missing values using available software. The proposed methods are implemented on glucocorticoid data.

Is it Possible to Predict the ADI of Pesticides using the QSAR Approach?

  • Kim, Jae Hyoun
    • 한국환경보건학회지
    • /
    • 제38권6호
    • /
    • pp.550-560
    • /
    • 2012
  • Objectives: QSAR methodology was applied to explain two different sets of acceptable daily intake (ADI) data of 74 pesticides proposed by both the USEPA and WHO in terms of setting guidelines for food and drinking water. Methods: A subset of calculated descriptors was selected from Dragon$^{(R)}$ software. QSARs were then developed utilizing a statistical technique, genetic algorithm-multiple linear regression (GA-MLR). The differences in each specific model in the prediction of the ADI of the pesticides were discussed. Results: The stepwise multiple linear regression analysis resulted in a statistically significant QSAR model with five descriptors. Resultant QSAR models were robust, showing good utility across multiple classes of pesticide compounds. The applicability domain was also defined. The proposed models were robust and satisfactory. Conclusions: The QSAR model could be a feasible and effective tool for predicting ADI and for the comparison of logADIEPA to logADIWHO. The statistical results agree with the fact that USEPA focuses on more subtle endpoints than does WHO.

Identifying Multiple Leverage Points ad Outliers in Multivariate Linear Models

  • Yoo, Jong-Young
    • Communications for Statistical Applications and Methods
    • /
    • 제7권3호
    • /
    • pp.667-676
    • /
    • 2000
  • This paper focuses on the problem of detecting multiple leverage points and outliers in multivariate linear models. It is well known that he identification of these points is affected by masking and swamping effects. To identify them, Rousseeuw(1985) used robust estimators of MVE(Minimum Volume Ellipsoids), which have the breakdown point of 50% approximately. And Rousseeuw and van Zomeren(1990) suggested the robust distance based on MVE, however, of which the computation is extremely difficult when the number of observations n is large. In this study, e propose a new algorithm to reduce the computational difficulty of MVE. The proposed method is powerful in identifying multiple leverage points and outlies and also effective in reducing the computational difficulty of MVE.

  • PDF

A Study on Detection of Influential Observations on A Subset of Regression Parameters in Multiple Regression

  • Park, Sung Hyun;Oh, Jin Ho
    • Communications for Statistical Applications and Methods
    • /
    • 제9권2호
    • /
    • pp.521-531
    • /
    • 2002
  • Various diagnostic techniques for identifying influential observations are mostly based on the deletion of a single observation. While such techniques can satisfactorily identify influential observations in many cases, they will not always be successful because of some mask effect. It is necessary, therefore, to develop techniques that examine the potentially influential effects of a subset of observations. The partial regression plots can be used to examine an influential observation for a single parameter in multiple linear regression. However, it is often desirable to detect influential observations for a subset of regression parameters when interest centers on a selected subset of independent variables. Thus, we propose a diagnostic measure which deals with detecting influential observations on a subset of regression parameters. In this paper, we propose a measure M, which can be effectively used for the detection of influential observations on a subset of regression parameters in multiple linear regression. An illustrated example is given to show how we can use the new measure M to identify influential observations on a subset of regression parameters.

응력집중문제의 해석을 위한 적응적 무요소절점법에 관한 연구 (A Meshless Method and its Adaptivity for Stress Concentration Problems)

  • 이상호;전석기;김효진
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 1997년도 가을 학술발표회 논문집
    • /
    • pp.16-23
    • /
    • 1997
  • The Reproducing Kernel Particle Method (RKPM), one of the popular meshless methods, is developed and applied to stress concentration problems. Since the meshless methods require only a set of particles (or nodes) and the description of boundaries in their formulation, the adaptivity can be implemented with much more ease than finite element method. In addition, due to its intrinsic property of multiresolution, the shape function of RKPM provides us a new criterion for adaptivity. Recently, this multiple scale Reproducing Kernel Particle Method and its adaptive procedure have been formulated for large deformation problems by the authors. They are also under development for damage materials and localization problems. In this paper the multiple scale RKPM for linear elasticity is presented and the adaptive procedure is applied to stress concentration problems. Therefore, this work may be regarded as the edition of linear elasticity in the complete framework of multiple scale RKPM and the associated adaptivity.

  • PDF

일반 다중선택 다분할 선형계획 배낭문제 (The Generalized Multiple-Choice Multi-Divisional Linear Programming Knapsack Problem)

  • 원중연
    • 대한산업공학회지
    • /
    • 제40권4호
    • /
    • pp.396-403
    • /
    • 2014
  • The multi-divisional knapsack problem is defined as a binary knapsack problem where each mutually exclusive division has its own capacity. In this paper, we present an extension of the multi-divisional knapsack problem that has generalized multiple-choice constraints. We explore the linear programming relaxation (P) of this extended problem and identify some properties of problem (P). Then, we develop a transformation which converts the problem (P) into an LP knapsack problem and derive the optimal solutions of problem (P) from those of the converted LP knapsack problem. The solution procedures have a worst case computational complexity of order $O(n^2{\log}\;n)$, where n is the total number of variables. We illustrate a numerical example and discuss some variations of problem (P).

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.

실시간 수위 예측을 위한 다중선형회귀 모형의 비교 (Comparison of Different Multiple Linear Regression Models for Real-time Flood Stage Forecasting)

  • 최승용;한건연;김병현
    • 대한토목학회논문집
    • /
    • 제32권1B호
    • /
    • pp.9-20
    • /
    • 2012
  • 최근 수위 예측을 위한 개념적 기반, 수문학적, 물리적 기반 모형 등의 단점을 극복하고자 홍수예측을 위해 자료지향형 모형 중의 하나인 다중선형회귀 모형이 널리 도입되고 있다. 본 연구의 목적은 이러한 다중선형회귀 모형의 서로 다른 회귀계수 선정 방법에 따른 홍수예측 성능을 비교 검토하고 이를 통해 적절한 다중회귀 홍수예측 모형을 구축하는 것이다. 이를 위해 입력자료의 자기상관분석을 통해 독립변수의 시간 규모를 결정한 후 최소 자승법, 가중 최소 자승법, 단계별 선택법의 각기 다른 회귀계수 산정 방법을 이용한 홍수예측 모형을 구축하고 중랑천 유역의 다양한 홍수사상에 대해 적용하였다. 구축된 모형들의 성능을 평가하기 위해 평균제곱근오차, Nash-Suttcliffe 효율계수, 평균절대오차, 수정 결정계수와 같이 4개의 통계지표들을 사용하였다. 모의결과 단계별 선택법을 이용한 다중선형회귀 홍수예측 모형이 가장 정확한 예측 결과를 보였고, 최소자승법을 이용한 홍수예측 모형이 가중 최소자승법을 이용한 홍수예측 모형보다 좀 더 나은 예측 결과를 나타냈다.