Sciweavers

1013 search results - page 52 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Mode-seeking by Medoidshifts
We present a nonparametric mode-seeking algorithm, called medoidshift, based on approximating the local gradient using a weighted estimate of medoids. Like meanshift, medoidshift ...
Yaser Sheikh, Erum A. Khan, Takeo Kanade
NIPS
2007
13 years 9 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
P2P
2002
IEEE
170views Communications» more  P2P 2002»
14 years 19 days ago
A Semantical and Implementative Comparison of File Sharing Peer-to-Peer Applications
In this paper some representative peer-to-peer file sharing applications are compared against two sets of features. The first set describes the semantics of the relevant primiti...
Pietro Braione
ICML
2010
IEEE
13 years 5 months ago
Comparing Clusterings in Space
This paper proposes a new method for comparing clusterings both partitionally and geometrically. Our approach is motivated by the following observation: the vast majority of previ...
Michael H. Coen, M. Hidayath Ansari, Nathanael Fil...
CORR
2010
Springer
47views Education» more  CORR 2010»
13 years 5 months ago
Ontology Usage at ZFIN
The Zebrafish Model Organism Database (ZFIN) provides a Web resource of zebrafish genomic, genetic, developmental, and phenotypic data. Four different ontologies are currently used...
Doug Howe, Christian Pich