Re: Schema to store graph

Response below Amandeep Khurana Computer Science Graduate Student University of California, Santa Cruz On Tue, Mar 31, 2009 at 1:58 AM, Edward J. Yoon edwardy...@apache.orgwrote: Hama store the sparse graph using Hbase as an sparse adjacency matrix. One of reason is to perform matrix

Re: [VOTE] Mahout 0.1

Jukka, I get: md5 mahout-0.1-project.tar.gz MD5 (mahout-0.1-project.tar.gz) = f7341a0eb773d9f96ea87914f3c845dc cat mahout-0.1-project.tar.gz.md5 f7341a0eb773d9f96ea87914f3c845dc cat mahout-0.1-project.tar.gz.sha1 5c84eb607c07119aceb1f3824e38205474dabc08 openssl sha1

Re: [VOTE] Mahout 0.1

Hi, On Tue, Mar 31, 2009 at 5:36 PM, Grant Ingersoll gsing...@apache.org wrote: Am I doing something wrong?  Seems like everything is right.  This stuff is all done automatically by Maven.  I downloaded those files today from

Re: [VOTE] Mahout 0.1

+1 Jeff Grant Ingersoll wrote: [Take 2. I fixed the NOTICE file, but did not change the artifact generation issue for now.] Please review and vote for releasing Mahout 0.1. This is our first release and is all new code. The artifacts in are located in:

Re: [VOTE] Mahout 0.1

I only briefly scanned through and viewed the package files and ran tests on a couple of boxes. Looks good though, +1. 28 mar 2009 kl. 10.49 skrev Grant Ingersoll: [Take 2. I fixed the NOTICE file, but did not change the artifact generation issue for now.] Please review and vote for

Re: Implement a Map/Reduce enabled Machine Learning Algorithm

On Tue, Mar 31, 2009 at 1:37 AM, surya ganesh suryagane...@gmail.comwrote: Any Suggestions ?? Thank you, Surya Ganesh. Yes. First, this is a fine thing to do. First, though, I think it is true that you can really just sum up the partial estimates of the Hessian and gradient, but I don't

Re: [gsoc] random forests

Here is a draft of my proposal ** Title/Summary: [Apache Mahout] Implement parallel Random/Regression Forests Student: AbdelHakim Deneche Student e-mail: ... Student Major: Phd in Computer Science Student Degree: Master in Computer Science

[GSOC] Ranking Process

FYI: http://wiki.apache.org/general/RankingProcess -Grant

[GSOC] Fwd: ***Very Important***: Get Your Students to Submit their Proposals via the 2009 site *now*

FYI Begin forwarded message: From: Luciano Resende luckbr1...@gmail.com Date: March 31, 2009 4:54:31 PM EDT To: code-awa...@apache.org Subject: Fwd: ***Very Important***: Get Your Students to Submit their Proposals via the 2009 site *now* Reply-To: code-awa...@apache.org Sorry if this is

Re: Introduction for student interested in GSoC

Here's a followup proposal (submitted to GSOC's site. I will add it to the wiki, but I'm having trouble accessing it right now) Thanks! -- David Title/Summary: Distributed Latent Dirichlet Allocation Student: David Hall Student e-mail: d...@cs.stanford.edu Student Major: Symbolic Systems/

Re: [GSOC] Ranking Process

I only see two applications for Mahout, one reasonably strong, one much less so. Are there students out there who still need to prepare an application? The deadline is coming up fast. 2009/3/31 Grant Ingersoll gsing...@apache.org FYI: http://wiki.apache.org/general/RankingProcess -Grant

Re: [gsoc] random forests

Deneche, I don't see your application on the GSOC web site. Nor on the apache wiki. Time is running out and I would hate to not see you in the program. Is it just that I can't see the application yet? On Tue, Mar 31, 2009 at 1:05 PM, deneche abdelhakim a_dene...@yahoo.frwrote: Here is a

Re: Schema to store graph

One thing is Hbase 0.19 doesn't work with over 5,000 qualifier of one column so I couldn't test/benchmark for large scale. On Tue, Mar 31, 2009 at 6:04 PM, Amandeep Khurana ama...@gmail.com wrote: Response below Amandeep Khurana Computer Science Graduate Student University of California,