Sciweavers

927 search results - page 48 / 186
» Stability of k -Means Clustering
Sort
View
OPODIS
2004
13 years 9 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
BIRTHDAY
2010
Springer
13 years 11 months ago
Clustering the Normalized Compression Distance for Influenza Virus Data
The present paper analyzes the usefulness of the normalized compression distance for the problem to cluster the hemagglutinin (HA) sequences of influenza virus data for the HA gene...
Kimihito Ito, Thomas Zeugmann, Yu Zhu
PAKDD
2009
ACM
123views Data Mining» more  PAKDD 2009»
14 years 18 days ago
Clustering with Lower Bound on Similarity
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi,...
DATE
2004
IEEE
118views Hardware» more  DATE 2004»
13 years 11 months ago
SCORE: SPICE COmpatible Reluctance Extraction
Presently, a necessary modification to mainstream analysis tools prevents the direct application of reluctance k. In this paper, we propose a reluctance realization algorithm (RRA...
Rong Jiang, Charlie Chung-Ping Chen
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
14 years 5 months ago
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
Subhash Khot, Assaf Naor