What is the rate of convergence of the hebbian algorithm?
It appears to be another incarnation of a classical algorithm used by
numerical linear algebraist.
On 18 June 2015 at 15:34, Kyle Kastner wrote:
> Another citation for hebbian approach - it is related to this
> http://onlinelibrary.wiley.
What is best routine in scikit-learn (or elsewhere) for clustering large
data sets such as MNIST?
I asked a similar question last year but would like to hear an update.
--
___
Sci
What is the best (efficient,accurate) algorithm to cluster the MNIST
training set which has 60,000 records using scikit-learn? Has anybody done
it?
vince fernando
--
Start Your Social Network Today - Download eXo Platform
Could you give me a reference for the "discrete option" in spectral
clustering?
vince
On 31 January 2013 13:58, Olivier Grisel wrote:
> 2013/1/31 Gael Varoquaux :
> > On Thu, Jan 31, 2013 at 08:17:02AM -0500, Satrajit Ghosh wrote:
> >> the problem that this causes is in comparing clusters from
Are there any theoretical problems if one uses the great circle
(orthodromic) distance on a sphere in k-means or any other clustering
algorithm?
vince
On 24 January 2013 07:11, Mathieu Blondel wrote:
> On Thu, Jan 24, 2013 at 9:24 AM, Gael Varoquaux
> wrote:
>
> > Yes, there is a massive diffe
Hi,
What is the biggest (in terms of number of samples) clustering (or
bisection) problem which has been
solved? What is the method of choice for large (say, > 5000) problems?
vince
--
Everyone hates slow websites. So do
