3934 search results - page 7 / 787 » A monothetic clustering method |
DEXAW
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
JMLR
2010
13 years 4 months ago
2010
In this paper, we introduce an assumption which makes it possible to extend the learning ability of discriminative model to unsupervised setting. We propose an informationtheoreti...
ICDM
2009
IEEE
13 years 7 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
AAAI
2010
13 years 6 months ago
2010
Some real-world problems are partially decomposable, in that they can be decomposed into a set of coupled subproblems, that are each relatively easy to solve. However, when these ...
JISE
2010
13 years 4 months ago
2010
In dealing with large datasets the reduced support vector machine (RSVM) was proposed for the practical objective to overcome the computational difficulties as well as to reduce t...