16404 search results - page 2468 / 3281 » A set coverage problem |
234
click to vote
KDD
2007
ACM
16 years 8 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
174
click to vote
KDD
2006
ACM
16 years 8 months ago
2006
ACM
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
218
click to vote
KDD
2006
ACM
16 years 8 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
237
click to vote
KDD
2006
ACM
16 years 8 months ago
2006
ACM
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
215
click to vote
KDD
2006
ACM
16 years 8 months ago
2006
ACM
The problem of time series classification has attracted great interest in the last decade. However current research assumes the existence of large amounts of labeled training data...