Sciweavers

191 search results - page 8 / 39
» Computing Support Technicians: Yours, Mine or Ours
Sort
View
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 7 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
13 years 8 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
KDD
2003
ACM
113views Data Mining» more  KDD 2003»
14 years 8 months ago
Indexing multi-dimensional time-series with support for multiple distance measures
Although most time-series data mining research has concentrated on providing solutions for a single distance function, in this work we motivate the need for a single index structu...
Michail Vlachos, Marios Hadjieleftheriou, Dimitrio...
DIS
2007
Springer
13 years 11 months ago
Efficient Incremental Mining of Top-K Frequent Closed Itemsets
In this work we study the mining of top-K frequent closed itemsets, a recently proposed variant of the classical problem of mining frequent closed itemsets where the support thresh...
Andrea Pietracaprina, Fabio Vandin
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
14 years 8 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler