5733 search results - page 378 / 1147 » Clustering Categorical Data |
201
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
186
click to vote
GFKL
2007
Springer
16 years 1 months ago
2007
Springer
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
196
click to vote
EUROPAR
2003
Springer
16 years 27 days ago
2003
Springer
Abstract. Performance analysis for terascale computing requires a combination of new concepts including distribution, on-line processing and automation. As a foundation for tools r...
206
click to vote
ISAAC
2004
Springer
16 years 1 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
226
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...