Sciweavers

311 search results - page 18 / 63
» Better streaming algorithms for clustering problems
Sort
View
SIGMOD
2010
ACM
144views Database» more  SIGMOD 2010»
13 years 11 months ago
Interactive visual exploration of neighbor-based patterns in data streams
We will demonstrate our system, called V iStream, supporting interactive visual exploration of neighbor-based patterns [7] in data streams. V istream does not only apply innovativ...
Di Yang, Zhenyu Guo, Zaixian Xie, Elke A. Rundenst...
AUSAI
2006
Springer
13 years 10 months ago
Clustering Similarity Comparison Using Density Profiles
The unsupervised nature of cluster analysis means that objects can be clustered in many different ways. This means that different clustering algorithms can lead to vastly different...
Eric Bae, James Bailey, Guozhu Dong
WACV
2005
IEEE
14 years 9 days ago
Ensemble Methods in the Clustering of String Patterns
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
André Lourenço, Ana L. N. Fred
COOPIS
1999
IEEE
13 years 11 months ago
Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware
A distributed multimedia information system allows users to access data of different modalities, from different data sources, ranked by various combinationsof criteria. In [6], Fa...
Edward L. Wimmers, Laura M. Haas, Mary Tork Roth, ...
ICTCS
2005
Springer
14 years 7 days ago
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
Tsvi Kopelowitz, Ely Porat