Sciweavers

18 search results - page 1 / 4
» K-means Clustering with Feature Hashing
Sort
View
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 4 months ago
Improved Smoothed Analysis of the k-Means Method
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
Bodo Manthey, Heiko Röglin
CCS
2011
ACM
12 years 4 months ago
BitShred: feature hashing malware for scalable triage and semantic analysis
The sheer volume of new malware found each day is growing at an exponential pace. This growth has created a need for automatic malware triage techniques that determine what malwar...
Jiyong Jang, David Brumley, Shobha Venkataraman
CVPR
2009
IEEE
1695views Computer Vision» more  CVPR 2009»
14 years 12 months ago
Geometric min-Hashing: Finding a (Thick) Needle in a Haystack
We propose a novel hashing scheme for image retrieval, clustering and automatic object discovery. Unlike commonly used bag-of-words approaches, the spatial extent of image featu...
Ondrej Chum (Czech Technical University), Michal P...
KES
2007
Springer
13 years 11 months ago
A Hierarchical Clustering Method for Semantic Knowledge Bases
Abstract. This work presents a clustering method which can be applied to relational knowledge bases. Namely, it can be used to discover interesting groupings of semantically annota...
Nicola Fanizzi, Claudia d'Amato