Does anyone know how well does Self Organizing Maps(SOM) compare to k-means? I believe usually in the color开发者_C百科 space,such as RGB, SOM is a better method to cluster colors together as there is
I have a DB containing tf-idf vectors of about 30,000 documents. I would like to return for a given document a set of similar documents - about 4 or so.
I\'m writing a code which performs a k-means clustering on a set of data.I\'m actually using the code from a book called collective intelligence by O\'Reilly.Everything works, but in his code he uses
This question already has answers here: 开发者_运维技巧Closed 11 years ago. Possible Duplicates:
I am working on a python project where I开发者_开发技巧 study RNA structure evolution (represented as a string for example: \"(((...)))\" where the parenthesis represent basepairs). The point being is
How to calculate reconstruction error and where can I find information about it? (I will calculate r开发者_运维百科econstruction error of my data after K-means algorithm)Needed to calculate every poin
I got the features of some sound variables with MFCC Algorithm. I want to cluster them with K-Means. I have 70 frames and every frame has 9 cepstral coefficients for one voice sample. It means that I
I have set of points, and i want clusters out of them. I know how to do normal开发者_开发知识库 k-means algorithm. But i don\'t want to take \'k\' as input. Suppose if i have points like
imagine I have the following \"Pageview matrix\" COLUMN HEADINGS:books placement resources br aca Each row represents a session
I am trying to implement image search based on paper \"Scalable Recogni开发者_如何转开发tion with a Vocabulary Tree\". I am using SURF for extracting the features and key points. For example, for an i
加载中,请稍侯......