Sciweavers

5595 search results - page 74 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
15 years 11 months ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
APPROX
2009
Springer
177views Algorithms» more  APPROX 2009»
15 years 11 months ago
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
Rolf Harren, Rob van Stee
ICML
2006
IEEE
16 years 5 months ago
Clustering documents with an exponential-family approximation of the Dirichlet compound multinomial distribution
The Dirichlet compound multinomial (DCM) distribution, also called the multivariate Polya distribution, is a model for text documents that takes into account burstiness: the fact ...
Charles Elkan
IMCSIT
2010
15 years 1 months ago
Evaluation of Clustering Algorithms for Polish Word Sense Disambiguation
Word Sense Disambiguation in text is still a difficult problem as the best supervised methods require laborious and costly manual preparation of training data. Thus, this work focu...
Bartosz Broda, Wojciech Mazur
FGCN
2008
IEEE
240views Communications» more  FGCN 2008»
15 years 11 months ago
Data Compression Algorithm Based on Hierarchical Cluster Model for Sensor Networks
A new distributed algorithm of data ccompression based on hierarchical cluster model for sensor networks is proposed, the basic ideas of which are as follows, firstly the whole se...
Tongsen Wang, Lei Wang, Zhijun Xie, Ronghua Yang