نتایج جستجو برای: additive algorithm

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

Journal: :Lifetime data analysis 2005
David B Dunson Amy H Herring

Although Cox proportional hazards regression is the default analysis for time to event data, there is typically uncertainty about whether the effects of a predictor are more appropriately characterized by a multiplicative or additive model. To accommodate this uncertainty, we place a model selection prior on the coefficients in an additive-multiplicative hazards model. This prior assigns positi...

2003
Gwo-hwa Ju Lin-Shan Lee

Spectral subtraction (SS) approach has been widely used for speech enhancement and recognition accuracy improvement, but becomes less effective when the additive noise is not white. In this paper, we propose to integrate wavelet transform and the SS algorithm. The spectrum of the additive noise in each frequency band obtained in this way can then be better approximated as white if the number of...

2009
Elías F. Combarro Pedro Miranda

The family of k-additive measures has been introduced as a midterm between probabilities and general fuzzy measures and finds a wide number of applications in practice. However, its structure is different from other families of fuzzy measures and is certainly more complex (for instance, its vertices are not always {0, 1}valued), so it has not been yet fully studied. In this paper we present som...

Journal: :iranian journal of applied animal science 2015
a. ebadi tabrizi m. tahmoorespur a. nejati javaremi

random regression models (rrm) have become common for the analysis of longitudinal data or repeated records on individual over time. the goal of this paper was to explore the use of random regression models with orthogonal / legendre polynomials (rrl) to analyze new repeated measures called clutch size (cs) as a meristic trait for iranian native fowl. legendre polynomial functions of increasing...

2015
Jun-yi Li Jian-hua Li

Fast image search with efficient additive kernels and kernel locality-sensitive hashing has been proposed. As to hold the kernel functions, recent work has probed methods to create locality-sensitive hashing, which guarantee our approach's linear time; however existing methods still do not solve the problem of locality-sensitive hashing (LSH) algorithm and indirectly sacrifice the loss in accur...

1998
HUA DAI

A comprehensive survey of some recent results regarding parameterized inverse eigenvalue problems is given in this paper. Speciic topics include: additive and multiplicative inverse eigenvalue problems, classical inverse eigenvalue problems and generalized inverse eigenvalue problems. Both the theoretic and algorithmic aspects are reviewed. Some open problems are revealed to stimulate further r...

Journal: :Journal of the Optical Society of America. A, Optics, image science, and vision 2012
Albert Fannjiang Wenjing Liao

This paper presents a detailed numerical study on the performance of the standard phasing algorithms with random phase illumination (RPI). Phasing with high resolution RPI and the oversampling ratio σ=4 determines a unique phasing solution up to a global phase factor. Under this condition, the standard phasing algorithms converge rapidly to the true solution without stagnation. Excellent approx...

2008

We devise a classification algorithm based on generalised linear mixed model (GLMM) technology. The algorithm incorporates spline smoothing, additive model-type structures and model selection. For reasons of speed we employ the Laplace approximation, rather than Monte Carlo methods. Tests on real and simulated data show the algorithm to have good classification performance. Moreover, the result...

Journal: :Computational Statistics & Data Analysis 2007
Marta Avalos Yves Grandvalet Christophe Ambroise

We present a new method for function estimation and variable selection, specifically designed for additive models fitted by cubic splines. Our method involves regularizing additive models using the l1–norm, which generalizes Tibshirani’s lasso to the nonparametric setting. As in the linear case, it shrinks coefficients, some of them reducing exactly to zero. It gives parsimonious models, select...

2004

This paper proposes a learning scheme based still image super-resolution reconstruction algorithm. Superresolution reconstruction is proposed as a binary classification problem and can be solved by conditional class probability estimation. Assuming the probability takes the form of additive logistic regression function, AdaBoost algorithm is used to predict the probability. Experiments on face ...

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

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