نتایج جستجو برای: backward elimination method

تعداد نتایج: 1695903  

Journal: :Computational Statistics & Data Analysis 2006
Nelmarie Louw Sarel Steel

Variable selection serves a dual purpose in statistical classification problems: it enables one to identify the input variables which separate the groups well, and a classification rule based on these variables frequently has a lower error rate than the rule based on all the input variables. Kernel Fisher discriminant analysis (KFDA) is a recently proposed powerful classification procedure, fre...

Journal: :SIAM J. Numerical Analysis 2016
Andreas Potschka

We present and analyze a new damping approach called backward step control for the globalization of the convergence of Newton-type methods for the numerical solution of nonlinear root-finding problems. We provide and discuss reasonable assumptions that imply convergence of backward step control on the basis of generalized Newton paths in conjunction with a backward analysis argument. In particu...

1999
Stephan Raaijmakers

Constructive induction transforms the representation of instances in order to produce a more accurate model of the concept to be learned. For this purpose, a variety of operators has been proposed in the literature, including a Cartesian product operator forming pairwise higher-order attributes. We study the effect of the Cartesian product operator on memory-based language learning, and demonst...

2007
Michael Hanke

The present paper describes implementation details of a new implementation of a BDF solver within MATLAB R . It is tuned to be most efficient when applied as a solver within FEMLAB R . The present code aims at a predictable and efficient performance for index-2 differential-algebraic equations arising within the method of lines. The main novelty is the consequent implementation of a predictive ...

Journal: :Games and Economic Behavior 2005
Geir B. Asheim Andrés Perea

Within an epistemic model for two-player extensive games, we formalize the event that each player believes that his opponent chooses rationally at all information sets. Letting this event be common certain belief yields the concept of sequential rationalizability. Adding preference for cautious behavior to this event likewise yields the concept of quasi-perfect rationalizability. These concepts...

2013
SERGE GRATTON PAVEL JIRÁNEK XAVIER VASSEUR

The backward error analysis is of the great importance in the analysis of numerical stability of algorithms in finite precision arithmetic and backward errors are also often employed in stopping criteria of iterative methods for solving systems of linear algebraic equations. The backward error measures how far we must perturb the data of the linear system so that the computed approximation solv...

Ahmad Soltani Rasoul Haji

In this paper a new method based on fuzzy theory is developed to solve the project scheduling problem under fuzzy environment. Assuming that the duration of activities are trapezoidal fuzzy numbers (TFN), in this method we compute several project characteristics such as earliest times, latest times, and, slack times in term of TFN. In this method, we introduce a new approach which we call modif...

Journal: :Foundations of Computational Mathematics 2015
Etienne Emmrich David Siska Mechthild Thalhammer

Convergence of a full discretisation method is studied for a class of nonlinear second-order in time evolution equations, where the nonlinear operator acting on the first-order time derivative of the solution is supposed to be hemicontinuous, monotone, coercive and to satisfy a certain growth condition, and the operator acting on the solution is assumed to be linear, bounded, symmetric, and str...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید