Axe 1 : Valorisation des données pour la prise de décision

Retour

Cahiers du GERAD

413 résultats — page 11 de 21

The population value of coefficients of correlation based on ranks depends only on the copula underlying the true distribution. We consider data sets that sh...

référence BibTeX

This paper presents a framework where many existing structural credit risk models can be made hybrid by using a transformation of leverage to define the defa...

référence BibTeX
, et

This paper presents the generalized mixed effects regression tree (GMERT) method, an extension of the mixed effects regression tree (MERT) methodology design...

référence BibTeX
, , , , et

Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Gi...

référence BibTeX
et

Large datasets upon which classical statistical analysis cannot be performed because of the curse of dimensionality are more and more common in many research...

référence BibTeX
et

In view of applications to diagnostic tests of ARMA models, the asymptotic behavior of multivariate empirical and copula processes based on residuals of ARM...

référence BibTeX
, et

In this paper, we introduce the notion of dynamic copulas to model serial dependence as well as interdependence between several time series. The proposed m...

référence BibTeX
et

La confection de calendriers sportifs dans le milieu scolaire québécois est une tâche complexe à laquelle la Fédération Québécoise du Sport Étudiant (FQSE) d...

référence BibTeX
, et

The modularity maximization model proposed by Newman and Girvan for the identification of communities in networks works for general graphs possibly with loop...

référence BibTeX
, et

A total dominating set in a digraph <i>G</i> is a subset <i>W</i> of its vertices such that every vertex of <i>G</i> has an immediate successor in <i>W</i>. ...

référence BibTeX
, et

A new hierarchical divisive algorithm is proposed for identifying communities in complex networks. To that effect, the definition of <i>community in the weak...

référence BibTeX
et

In this article we find the optimal solution of the hedging problem in discrete time by minimizing the mean square hedging error, when the underlying assets ...

référence BibTeX
et

In this article, we construct a Malliavin derivative for functionals of a square-integrable Lévy process. The Malliavin derivative is defined via chaos expan...

référence BibTeX
, et

A discretization scheme for nonnegative diffusion processes is proposed and the convergence of the corresponding sequence of approximate processes is proved ...

référence BibTeX
, , et

Harmonic means clustering is a variant of Minimum sum of squares clustering (which is sometimes called <i>K</i>-means clustering), designed to alleviate the ...

référence BibTeX
, , et

Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems whose basic idea is a systematic change o...

référence BibTeX
, et

Given a set of entities associated with points in Euclidean space, minimum sum-of-squares clustering (MSSC) consist in partitioning this set into clusters su...

référence BibTeX
, et

Discrete-time survival data with time-varying covariates are often encountered in practice. One such example is bankruptcy studies where the status of each f...

référence BibTeX
, et

It is observed that mutations in the formulations of test problems over time are not infrequent. Ensuing problems are illustrated with examples from geometri...

référence BibTeX
, et

Finding maximum likelihood parameter values for Finite Mixture Model (FMM) is often done with the Expectation Maximization (EM) algorithm. However the choice...

référence BibTeX