Sciweavers

340 search results - page 11 / 68
» Clustering with Lower Bound on Similarity
Sort
View
ALT
2008
Springer
15 years 6 months ago
Clustering with Interactive Feedback
In this paper, we initiate a theoretical study of the problem of clustering data under interactive feedback. We introduce a query-based model in which users can provide feedback to...
Maria-Florina Balcan, Avrim Blum
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
14 years 9 months ago
Clusters in a Multigraph with Elevated Density
In this paper, we prove that in a multigraph whose density Γ exceeds the maximum vertex degree ∆, the collection of minimal clusters (maximally dense sets of vertices) is cycle...
Mark K. Goldberg
NIPS
2004
14 years 10 months ago
Variational Minimax Estimation of Discrete Distributions under KL Loss
We develop a family of upper and lower bounds on the worst-case expected KL loss for estimating a discrete distribution on a finite number m of points, given N i.i.d. samples. Our...
Liam Paninski
BMCBI
2005
198views more  BMCBI 2005»
14 years 9 months ago
Clustering protein sequences with a novel metric transformed from sequence similarity scores and sequence alignments with neural
Background: The sequencing of the human genome has enabled us to access a comprehensive list of genes (both experimental and predicted) for further analysis. While a majority of t...
Qicheng Ma, Gung-Wei Chirn, Richard Cai, Joseph D....
PE
2010
Springer
144views Optimization» more  PE 2010»
14 years 7 months ago
Capacity scaling of large wireless networks with heterogeneous clusters
We analyze the capacity scaling laws of wireless networks where the spatial distribution of nodes over the network area exhibits a high degree of clustering. In particular we cons...
Valentina Martina, Michele Garetto, Emilio Leonard...