1701 search results - page 243 / 341 » Providing k-anonymity in data mining |
179
click to vote
KDD
2006
ACM
16 years 6 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...
182
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
170
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
There exists a huge demand for multimedia goods and services in the Internet. Currently available bandwidth speeds can support sale of downloadable content like CDs, e-books, etc....
144
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
The problem of measuring "similarity" of objects arises in many applications, and many domain-specific measures have been developed, e.g., matching text across documents...
150
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
In this paper, we focus on methodology of finding a classifier with a minimal cost in presence of additional performance constraints. ROCCH analysis, where accuracy and cost are i...