1227 search results - page 118 / 246 » Approximate Kernel Clustering |
117
click to vote
ICANN
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
115
click to vote
UAI
2001
15 years 5 months ago
2001
In this work we focus on efficient heuristics for solving a class of stochastic planning problems that arise in a variety of business, investment, and industrial applications. The...
133
click to vote
PDPTA
2003
15 years 5 months ago
2003
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
129
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
141
click to vote
HICSS
2008
IEEE
15 years 10 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...