Sciweavers

2600 search results - page 29 / 520
» Clustering with or without the Approximation
Sort
View
ICCV
2005
IEEE
15 years 4 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
CIARP
2010
Springer
14 years 10 months ago
Improving the Dynamic Hierarchical Compact Clustering Algorithm by Using Feature Selection
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
Reynaldo Gil-García, Aurora Pons-Porrata
NLDB
2007
Springer
15 years 5 months ago
Selecting Labels for News Document Clusters
This work deals with determination of meaningful and terse cluster labels for News document clusters. We analyze a number of alternatives for selecting headlines and/or sentences o...
Krishnaprasad Thirunarayan, Trivikram Immaneni, Ma...
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
15 years 1 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
BMCBI
2005
109views more  BMCBI 2005»
14 years 11 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...