1701 search results - page 270 / 341 » Providing k-anonymity in data mining |
154
click to vote
ASIACRYPT
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
159
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The authors present a GA optimization technique for cosinebased k-nearest neighbors classification that improves predictive accuracy in a class-balanced manner while sim...
159
click to vote
AI
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper investigates the methods for learning predictive classifiers based on Bayesian belief networks (BN) – primarily unrestricted Bayesian networks and Bayesian m...
168
click to vote
EKAW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper concerns the iterative implementation of a knowledge model in a data mining context. Our approach relies on coupling a Bayesian network design with an associat...
176
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...