Closed. This question is opinion-based. It is not currently accepting answers. Want to improve this question? Update the question so it can be answered with facts and citations by editing
I want to use Gaussian mixture modelsfor data clustering ( using an expectation maximization (EM) algorithm, which assigns posterior probabilities to each component density with respect to each observ
Given the following enum: public enum Position { Quarterback, Runningback, DefensiveEnd, Linebacker }; Is it possible to classify the named constants, such that I could mark \'Quarterback\' and \'R
My large (120gb) music collection contains many duplicate songs, and I\'ve been trying to fingerprint tracks in the hopes of detecting duplicates. And since I\'m a CS Major I\'m very curious as to wha
I am trying to understand Adaboost algorithmbut i have some troubles. After reading about Adaboost i realized that it is a classification algorithm(someh开发者_如何学编程ow like neural network). But i
I have, of course, tried Google/Bing and have found one or two classifications for specific industries, but nothing general.
I am working on a real estate website and i would like to write a program that can figure out(classify) if an image is a floor plan or a company logo.
I want to write an online application that: reads the URL from address bar of the browser extracts its lexical features (like n-grams)
I\'m using the explorer feature of Weka for classification. So I have my .arff file, with 2 features of NUMERIC value, and my class is a binary 0 or 1 (eg {0,1}).
I have huge list (200000)of strings (multi 开发者_如何转开发word). I want to group these strings based on comman array of word match among these strings. I cant think of a low computation time algorit
加载中,请稍侯......