4085 search results - page 631 / 817 » Benchmarking Data Mining Algorithms |
227
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
196
Voted
SISAP
2009
IEEE
16 years 1 months ago
2009
IEEE
—It has been a long way since the beginnings of metric space searching, where people coming from algorithmics tried to apply their background to this new paradigm, obtaining vari...
155
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
We introduce a robust probabilistic approach to modeling shape contours based on a lowdimensional, nonlinear latent variable model. In contrast to existing techniques that use obj...
183
Voted
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
178
click to vote
IAT
2003
IEEE
16 years 8 days ago
2003
IEEE
—Ant-based algorithms or ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. More recently, Parpinelli and colleagues ...