[Comp-neuro] David MacKay elected author/curator of "Bayesian Learning" in Scholarpedia

[Eugene M. Izhikevich]

On behalf of Encyclopedia of Computational Intelligence, Scholarpedia
conducted an election of authors for the article "Bayesian Learning".
The letter below was sent to David J. C. MacKay, University of
Cambridge, who already accepted the invitation. See
http://www.scholarpedia.org/article/Bayesian_Learning

--
Dear Dr. MacKay,

As you might know, Scholarpedia, the free peer-reviewed encyclopedia,
conducted an election of authors for the article "Bayesian Learning"
with the goal to identify the best living expert to invite to write such
an article. The nominees (in the order of nomination by the public) were
1. David J.C. MacKay
2. Sara Solla
3. Chris Bishop
As the editor-in-chief, it is my great privilege to let you know that
you were elected to write this article for Scholarpedia
(http://www.scholarpedia.org).

The election started on 16 May 2006 and ended today, engaging 121
participants. Rules of the election are described in
http://scholarpedia.org/article/Scholarpedia:Election
In summary, each participant can vote for no more than 3 candidates.
Each vote is multiplied by the participant's Scholar Index, which
reflects the expertise and usefulness of contributions of that person to
Scholarpedia. (So that experts have greater weight in the election).
Then, the weighted sum of the votes and a soft-max procedure is used to
select the future author of the article.

I am sending you a short explanation of this project and the
instructions to reserve the article in a separate letter. Please, let me
know whether you could write this article withing a reasonable period of
time.

Sincerely yours,
Eugene M. Izhikevich – Editor-in-Chief of Scholarpedia, the free
peer-reviewed encyclopedia.

-- 
Eugene M. Izhikevich, Ph.D.,   http://www.izhikevich.com
The Neurosciences Institute,   Eugene.Izhikevich at nsi.edu
10640 John J. Hopkins Drive           tel:(858) 626-2063
San Diego, CA, 92121,   USA           fax:(858) 626-2099