21 search results - page 2 / 5 » Mining Noisy Data Streams via a Discriminative Model |
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
Supporting continuous mining queries on data streams requires algorithms that (i) are fast, (ii) make light demands on memory resources, and (iii) are easily to adapt to concept dr...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
KDD
2010
ACM
13 years 3 months ago
2010
ACM
One essential issue of document clustering is to estimate the appropriate number of clusters for a document collection to which documents should be partitioned. In this paper, we ...
PKDD
2004
Springer
13 years 10 months ago
2004
Springer
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
KDD
2012
ACM
11 years 7 months ago
2012
ACM
Building an accurate emerging pattern classifier with a highdimensional dataset is a challenging issue. The problem becomes even more difficult if the whole feature space is unava...