Marketing (intelligence d’affaires, gestion des revenus, systèmes de recommandation)

Retour

Cahiers du GERAD

153 résultats — page 5 de 8

et

In this paper, we empirically investigate the robustness of random forests for regression problems. We also investigate the performance of five variations o...

référence BibTeX
et

We revisit the question of why some participants in online auctions place their bids right before the time of closing. Using e-Bay data for two product cate...

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

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

The paper revisits the advertising differential game suggested by G. Leitmann and W. E. Schmitendorf in their paper "Profit Maximization Through Advertising...

référence BibTeX
, et

Should manufacturers of durable products such as automobiles and household appliances offer cash rebates to all consumers at the time of purchase, or offer t...

référence BibTeX
, et

This research assesses the impact of the various states of mind of Flow psychological theory (Csíkszentmihályi 1990) in relation to brand recall and recognit...

référence BibTeX
, et

This paper presents a model for identifying general goals of anonymous consumers visiting a retail website. When visiting a transactional website, consumers ...

référence BibTeX
, , et

There has been a wide interest to extend univariate and multivariate nonparametric procedures to clustered and hierarchical data. Traditionally, parametric m...

référence BibTeX
et

Top-tier customers - that is, those 20% of customers that typically bring in 80% of all profits - are extremely valuable to companies. In the many instances ...

référence BibTeX

Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of <i>n</i> points into <i>k</i> clusters in order to minimize the sum of squar...

référence BibTeX

Methods, models, heuristic and exact algorithms for clustering are reviewed from a mathematical programming view point.

référence BibTeX
, , et

A recent proof of NP-hardness of Euclidean sum-of-squares clustering, due to Drineas et al., <i>Machine Learning</i> 56, 9--33, 2004, is not valid. An altern...

référence BibTeX
, et

Horizontal cooperation among franchisees is now a well-known reality in franchising, as exemplified by the growing number of franchisee associations and adve...

référence BibTeX
et

We consider a duopolistic industry where the current sales of each firm is proportional to its goodwill stock. The evolution of the latter depends positivel...

référence BibTeX

Minimum sum-of-squares clustering consists in partitioning a given set of <i>n</i> points into <i>c</i> clusters in order to minimize the sum of squared dist...

référence BibTeX
et

The aim of this paper is to characterize cooperative and noncooperative advertising strategies of a licensor and licensee involved in a licensing contract ...

référence BibTeX
, , et

A weighted multivariate signed-rank test is introduced for an analysis of multivariate clustered data. Observations in different clusters may then get diffe...

référence BibTeX
, et

In this paper, we propose a tree-based method for multivariate outcomes consisting in a mixture of categorical and continuous responses. The split function...

référence BibTeX
et

This paper attempts to shed an empirical light on so-called jump bidding in ascending auctions. There is a jump when a participant in an auction outbids t...

référence BibTeX