24 search results - page 3 / 5 » Adaptive non-linear clustering in data streams |
TDSC
2011
13 years 6 days ago
2011
— Most of existing privacy preserving techniques, such as k-anonymity methods, are designed for static data sets. As such, they cannot be applied to streaming data which are cont...
CN
2006
13 years 5 months ago
2006
The expanding and dynamic nature of the Web poses enormous challenges to most data mining techniques that try to extract patterns from Web data, such as Web usage and Web content....
MM
2006
ACM
13 years 11 months ago
2006
ACM
Many emerging applications such as video sensor monitoring can benefit from an on-line video correlation system, which can be used to discover linkages between different video s...
STACS
2007
Springer
13 years 11 months ago
2007
Springer
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...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
In this paper, we present Spade - the System S declarative stream processing engine. System S is a large-scale, distributed data stream processing middleware under development at ...