Sciweavers

1013 search results - page 33 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
ICML
2006
IEEE
14 years 8 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
CLEF
2010
Springer
13 years 8 months ago
Cross-document Coreference for WePS
A good clustering performance depends on the quality of the distance function used to asses similarity. In this paper we propose a pairwise document coreference model to improve pe...
Iustin Dornescu, Constantin Orasan, Tatiana Lesnik...
MICAI
2007
Springer
14 years 1 months ago
Fuzzifying Clustering Algorithms: The Case Study of MajorClust
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
Eugene Levner, David Pinto, Paolo Rosso, David Alc...
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
14 years 1 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
GEOINFORMATICA
1998
107views more  GEOINFORMATICA 1998»
13 years 7 months ago
A Comparison of Two Approaches to Ranking Algorithms Used to Compute Hill Slopes
The calculation of slope (downhill gradient) for a point in a digital elevation model (DEM) is a common procedure in the hydrological, environmental and remote sensing sciences. T...
Kevin H. Jones