PAKDD
2010
ACM
13 years 7 months ago
2010
ACM
We present a general framework for the task of extracting specific information “on demand” from a large corpus such as the Web under resource-constraints. Given a database wit...
PAKDD
2010
ACM
13 years 8 months ago
2010
ACM
In this paper, we focus our attention on the problem of computing the ratio of two numbers, both of which are the summations of the private numbers distributed in different parties...
PAKDD
2010
ACM
13 years 8 months ago
2010
ACM
Abstract. We report a surprising, persistent pattern in large sparse social graphs, which we term EigenSpokes. We focus on large Mobile Call graphs, spanning about 186K nodes and m...
PAKDD
2010
ACM
13 years 8 months ago
2010
ACM
Abstract. Privacy protection in publishing transaction data is an important problem. A key feature of transaction data is the extreme sparsity, which renders any single technique i...
PAKDD
2010
ACM
13 years 9 months ago
2010
ACM
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...
PAKDD
2010
ACM
13 years 9 months ago
2010
ACM
Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to he...
PAKDD
2010
ACM
13 years 9 months ago
2010
ACM
Abstract. It is well known that diversity among component classifiers is crucial for constructing a strong ensemble. Most existing ensemble methods achieve this goal through resam...
PAKDD
2010
ACM
13 years 9 months ago
2010
ACM
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
PAKDD
2010
ACM
13 years 9 months ago
2010
ACM
PAKDD
2010
ACM
13 years 9 months ago
2010
ACM