1701 search results - page 245 / 341 » Providing k-anonymity in data mining |
WSDM
2009
ACM
14 years 5 months ago
2009
ACM
With the overwhelming number of reports on similar events originating from different sources on the web, it is often hard, using existing web search paradigms, to find the origi...
ICDM
2009
IEEE
14 years 5 months ago
2009
IEEE
—Lack of supervision in clustering algorithms often leads to clusters that are not useful or interesting to human reviewers. We investigate if supervision can be automatically tr...
PKDD
2009
Springer
14 years 5 months ago
2009
Springer
Probabilistic relational models are an efficient way to learn and represent the dynamics in realistic environments consisting of many objects. Autonomous intelligent agents that gr...
PKDD
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
SISAP
2008
IEEE
14 years 5 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...