On Mon, Mar 10, 2008 at 4:50 PM, Grant Ingersoll [EMAIL PROTECTED]
wrote:
Wow, maybe w/ all of our mentors we could get 2 students...
neat ++ :)
--
((Anush Shetty)) ((mail AT anushshetty DOT com))
On Fri, Mar 7, 2008 at 7:39 PM, Jeff Eastman [EMAIL PROTECTED] wrote:
Vector has both dot() and cross() products. Are you looking at the
latest .diff?
My bad, I was looking in the wrong place...
Jason
On Mon, Mar 10, 2008 at 2:52 AM, Ted Dunning [EMAIL PROTECTED] wrote:
Sorry. The first year prize is gone (the $50,000 progress prize for the
first yet) and the subsequent yearly prizes are going to be very hard to
get
(squeezing water from a stone). The asymptotic progress curve tells the
Ankur,
You might like to take a quick look at the following two papers which
provide a strong extension to PLSI,
www.cs.princeton.edu/~blei/papers/BleiNgJordan2003.pdf
cosco.hiit.fi/Articles/buntineBohinj.pdf
The Buntine/Jakulin paper especially provides a relatively simple algorithm
that has
[
https://issues.apache.org/jira/browse/MAHOUT-6?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanelfocusedCommentId=12577037#action_12577037
]
Dawid Weiss commented on MAHOUT-6:
--
A quickie:
1. Make many, many rounds through the same
On Mon, Mar 10, 2008 at 11:31 AM, Ted Dunning [EMAIL PROTECTED] wrote:
www.cs.princeton.edu/~blei/papers/BleiNgJordan2003.pdfhttp://www.cs.princeton.edu/%7Eblei/papers/BleiNgJordan2003.pdf
cosco.hiit.fi/Articles/buntineBohinj.pdf
Ah... music to my ears. Ted, have I met you at a NIPS
Hi Matthew,
I'd like to pursue that canopy thought a little further and mix it in with
your sub sampling idea. Optimizing can come later, once we figure out how to
do mean-shift in M/R at all. How about this?
1. Each mean-shift iteration consists of a canopy clustering of all the
points, with T1
