Sciweavers

226 search results - page 25 / 46
» Approximate Clustering on Distributed Data Streams
Sort
View
SYNASC
2006
IEEE
106views Algorithms» more  SYNASC 2006»
14 years 1 months ago
A Quality Measure for Multi-Level Community Structure
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
Maylis Delest, Jean-Marc Fedou, Guy Melanço...
PODS
2009
ACM
110views Database» more  PODS 2009»
14 years 8 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
ECML
1997
Springer
13 years 12 months ago
Parallel and Distributed Search for Structure in Multivariate Time Series
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
ICRA
2008
IEEE
191views Robotics» more  ICRA 2008»
14 years 2 months ago
Combining automated on-line segmentation and incremental clustering for whole body motions
Abstract— This paper describes a novel approach for incremental learning of human motion pattern primitives through on-line observation of human motion. The observed motion time ...
Dana Kulic, Wataru Takano, Yoshihiko Nakamura
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 8 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson