| clear query|facets|time |
Search criteria: ClusterEvaluator.
Results from 111 to 120 from
545 (1.115s).
|
|
|
Loading phrases to help you
refine your search...
|
|
Re: Word and Phrase Clustering - Mahout - [mail # user]
|
|
...Here is an ancient article on the subject. http://www.aclweb.org/anthology-new/J/J92/J92-3004.pdf You don't need fancy computer capabilities to cluster words based on spelling. On Fri...
|
|
|
Author: Ted Dunning,
2011-12-02, 17:53
|
|
|
Re: What do "normal" pdf values look like for points clustered with kmeans? - Mahout - [mail # user]
|
|
...How high is the dimension? How is your data generated? On Wed, Feb 27, 2013 at 1:38 PM, Matt Molek wrote: ...
|
|
|
Author: Ted Dunning,
2013-03-01, 07:56
|
|
|
Re: Cluster-center and cluster-radius - Mahout - [mail # user]
|
|
... and used k-means on the data. The centroids that I got were exactly the same as yours so the Mahout clustering appears to be working well. The cluster results are: K-means clustering with 2...
|
|
... clusters of sizes 6, 4 Cluster means: x y 1 11.66667 604.3333 2 12.25000 3963.2500 Clustering vector: [1] 2 2 1 2 1 1 1 1 1 2 If you use a log-transform of y...
|
[+ show more]
[- hide]
| ..., then these are the cluster results: K-means clustering with 2 clusters of sizes 3, 7 Cluster means: x logy 1 9.333333 6.861456 2 13.000000 7.132130 Clustering vector: [1] 2 2 2 2 2 2 2 1 1 1... |
|
|
Author: Ted Dunning,
2011-07-26, 15:22
|
|
|
Re: clustering hardware requirements - Mahout - [mail # user]
|
|
...It is a great idea except that the centroids become harder to interpret. Not much harder. Just a bit harder. On Fri, Nov 18, 2011 at 9:44 AM, Grant Ingersoll wrote: ...
|
|
|
Author: Ted Dunning,
2011-11-18, 18:04
|
|
|
Re: kmeans not returning k clusters - Mahout - [mail # user]
|
|
...Pat, You may be interested in the code at https://github.com/tdunning/knn This includes some high speed clustering code that could help you with your issues. To wit, - there aren...
|
|
... downsides right now are - no history yet - not compatible with Mahout clustering API's yet - it doesn't have the final pass of in-memory clustering so it really just gives you an indifferent...
|
[+ show more]
[- hide]
| ... quality clustering with a huge number of weighted clusters. With the final pass, it will give you a high quality clustering with your specified number of clusters. On Sun, May 6, 2012 at 1... |
|
|
Author: Ted Dunning,
2012-05-06, 21:31
|
|
|
Re: kmeans not returning k clusters - Mahout - [mail # user]
|
|
...On Mon, May 7, 2012 at 12:01 AM, Dawid Weiss wrote: Yes. This is the current primary use case as part of a k-nn modeling framework....
|
|
|
Author: Ted Dunning,
2012-05-07, 16:09
|
|
|
Re: Clustering sparse data - Mahout - [mail # user]
|
|
...This may indicate that your data are too sparse to get useful clustering. Smoothing using svd or second order distance might help. Sent from my iPhone On Oct 19, 2011, at 8:47, "Bae...
|
|
|
Author: Ted Dunning,
2011-10-19, 21:49
|
|
|
Re: Clustering sparse data - Mahout - [mail # user]
|
|
...Distance between pairs is mostly zero? This indicates a real problem. It the pairs that you mean are pairs of examples it isn't so bad but pairs of canopies should have non zero distan...
|
|
|
Author: Ted Dunning,
2011-10-19, 14:42
|
|
|
Re: [mahout] labels in clustering algorythms - Mahout - [mail # user]
|
|
...Yuriy, Take a look at https://github.com/tdunning/knn to see some upcoming k-means stuff that may help you out with respect to speed. On Sat, Apr 28, 2012 at 11:19 AM, Юрий Басов...
|
|
|
Author: Ted Dunning,
2012-04-28, 19:50
|
|
|
Re: Cluster: find medoid & its n nearest elements - Mahout - [mail # user]
|
|
...There isn't a clever way to find the medoid in Mahout. Finding the n nearest elements can be done using a Searcher. The Brute implementation should suffice. On Thu, Dec 6, ...
|
|
|
Author: Ted Dunning,
2012-12-07, 12:27
|
|
|
|
