Compte rendu de lecture de l'ouvrage publié par les éditions Fides en 2006 de Madeleine Sauvé «Qu'est ce qu'un livre?: de la page blanche à l'achevé d'imprimé »

Pour les auteurs et éditeurs, Madeleine Sauvé fait l'anatomie du livre et nous donne des conseils précieux en matière de rédaction et d'écriture et de mise en page.

Misogyny in Health Professions? An Analysis of the Dalhousie Dentistry Scandal

Commentaire / Commentary

Probabilistic Independence Networks for Hidden Markov Probability Models

Graphical techniques for modeling the dependencies of randomvariables have been explored in a variety of different areas includingstatistics, statistical physics, artificial intelligence, speech recognition, image processing, and genetics.Formalisms for manipulating these models have been developedrelatively independently in these research communities. In this paper weexplore hidden Markov models (HMMs) and related structures within the general framework of probabilistic independencenetworks (PINs). The paper contains a self-contained review of the basic principles of PINs.It is shown that the well-known forward-backward (F-B) and Viterbialgorithms for HMMs are special cases of more general inference algorithms forarbitrary PINs. Furthermore, the existence of inference and estimationalgorithms for more general graphical models provides a set of analysistools for HMM practitioners who wish to explore a richer class of HMMstructures.Examples of relatively complex models to handle sensorfusion and coarticulationin speech recognitionare introduced and treated within the graphical model framework toillustrate the advantages of the general approach.

Factorial Hidden Markov Models

We present a framework for learning in hidden Markov models with distributed state representations. Within this framework, we derive a learning algorithm based on the Expectation--Maximization (EM) procedure for maximum likelihood estimation. Analogous to the standard Baum-Welch update rules, the M-step of our algorithm is exact and can be solved analytically. However, due to the combinatorial nature of the hidden state representation, the exact E-step is intractable. A simple and tractable mean field approximation is derived. Empirical results on a set of problems suggest that both the mean field approximation and Gibbs sampling are viable alternatives to the computationally expensive exact algorithm.

Estimating Dependency Structure as a Hidden Variable

This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EMand the Minimum Spanning Tree algorithm to find the ML and MAP mixtureof trees for a variety of priors, including the Dirichlet and the MDL priors.

Estimating Dependency Structure as a Hidden Variable

This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EM and the Minimum Spanning Tree algorithm to find the ML and MAP mixture of trees for a variety of priors, including the Dirichlet and the MDL priors. We also show that the single tree classifier acts like an implicit feature selector, thus making the classification performance insensitive to irrelevant attributes. Experimental results demonstrate the excellent performance of the new model both in density estimation and in classification.

Testing for Hidden Information and Action in Automobile Insurance Market

I test the presence of hidden information and action in the automobile insurance market using a data set from several Colombian insurers. To identify the presence of hidden information I find a common knowledge variable providing information on policyholder s risk type which is related to both experienced risk and insurance demand and that was excluded from the pricing mechanism. Such unused variable is the record of policyholder s traffic offenses. I find evidence of adverse selection in six of the nine insurance companies for which the test is performed. From the point of view of hidden action I develop a dynamic model of effort in accident prevention given an insurance contract with bonus experience rating scheme and I show that individual accident probability decreases with previous accidents. This result brings a testable implication for the empirical identification of hidden action and based on that result I estimate an econometric model of the time spans between the purchase of the insurance and the first claim, between the first claim and the second one, and so on. I find strong evidence on the existence of unobserved heterogeneity that deceives the testable implication. Once the unobserved heterogeneity is controlled, I find conclusive statistical grounds supporting the presence of moral hazard in the Colombian insurance market.

Navigating the page: an academic guide to effective reading

This guide introduces you to the various reading styles that will help you get through your research most effectively. It gives tips on how to skim read, and also how to read critically.

User Experience (a hidden barrier) in OER

More Open Education Resources (OER) and learning environments are being created and starting to mature and there are a number of barriers to learning and creator participation. One often overlooked barrier that has been given less attention, especially within OERs, is user experience (UX). UX is the way a person feels about using a product, system or service. We are creatures with emotional needs and, in the rush to get great content open and available sometimes the usability, the wow factor and good design principles get left by the wayside. I will demonstrate ways to think about UX for your OER and learning environments and why this is an important factor in helping engage learners with our educational materials. ‘The real payoff comes when we can make that remarkability last. When we can make people continually feel our work is worthy of discussion. When—for weeks, months, maybe even years— the people who engage with our work continue to sing its praises to everybody they meet’– (Jared Spool in Walter, A. Designing for Emotion). Walter, A. (2011) Designing for Emotion, A Book Apart. http://www.abookapart.com/products/designing-for-emotion