Sciweavers

311 search results - page 12 / 63
» Better streaming algorithms for clustering problems
Sort
View
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
14 years 1 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios
SDM
2007
SIAM
187views Data Mining» more  SDM 2007»
13 years 8 months ago
Topic Models over Text Streams: A Study of Batch and Online Unsupervised Learning
Topic modeling techniques have widespread use in text data mining applications. Some applications use batch models, which perform clustering on the document collection in aggregat...
Arindam Banerjee, Sugato Basu
NOSSDAV
2009
Springer
14 years 1 months ago
SLIPstream: scalable low-latency interactive perception on streaming data
A critical problem in implementing interactive perception applications is the considerable computational cost of current computer vision and machine learning algorithms, which typ...
Padmanabhan Pillai, Lily B. Mummert, Steven W. Sch...
JMLR
2006
96views more  JMLR 2006»
13 years 6 months ago
Rearrangement Clustering: Pitfalls, Remedies, and Applications
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...
Sharlee Climer, Weixiong Zhang
STACS
2007
Springer
14 years 25 days ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler