122 search results - page 11 / 25 » kdd 2006 |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
KDD
2006
ACM
15 years 10 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...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Protecting data privacy is an important problem in microdata distribution. Anonymization algorithms typically aim to protect individual privacy, with minimal impact on the quality...
KDD
2006
ACM
15 years 10 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...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
We investigate three methods for defining a session on Web search engines. We examine 2,465,145 interactions from 534,507 Web searchers. We compare defining sessions using: 1) Int...