969 search results - page 44 / 194 » Expectation-MiniMax Approach to Clustering Analysis |
127
click to vote
EVOW
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. The increased availability of biological databases containing representations of complex objects permits access to vast amounts of data. In spite of the recent renewed in...
142
Voted
AI
2006
Springer
15 years 2 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
177
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
119
click to vote
SDM
2004
SIAM
15 years 3 months ago
2004
SIAM
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
137
click to vote
SDM
2003
SIAM
15 years 3 months ago
2003
SIAM
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...