On Mon, Apr 29, 2013 at 09:20:24AM +0200, Kemal Eren wrote: > The Spectral coclustering algorithm from 2001 with 888 citations is a very > similar model to the Kluger paper from 2003, which applied the same concepts > to > microarray data. I originally cited the Kluger paper only because it is more > well known in my field. I have added a link to Dhillon's paper, too.
> Going by pure citations, I'd say the original Cheng and Church algorithm is > the > most popular (1417 citations). In my experience, no one uses it directly > anymore, but it is included as a benchmark in almost every paper. I think that Spectral approach is the number one priority, because it is fairly easy to code (starting from our existing spectral clustering implementation), followed by Cheng and Church probably. G ------------------------------------------------------------------------------ Try New Relic Now & We'll Send You this Cool Shirt New Relic is the only SaaS-based application performance monitoring service that delivers powerful full stack analytics. Optimize and monitor your browser, app, & servers with just a few lines of code. Try New Relic and get this awesome Nerd Life shirt! http://p.sf.net/sfu/newrelic_d2d_apr _______________________________________________ Scikit-learn-general mailing list Scikit-learn-general@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
