Databases Reference
In-Depth Information
22. J. Platt. Sequetial minimal optimization: a fast algorithm for training support
vector machines. In
Technical Report MST-TR-98-14, Microsoft Research, 1998
.
23. R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homo-
morphisms. In
Foundations of Secure Computation, eds. R. A. DeMillo et al.,
pp 169-179
, Academic Press, 1978.
24. K.-R. Mller, B. Schlkopf, and A.J. Smola. Nonlinear component analysis as a
kernel eigenvalue problem. In
Neural Computation
, 10, 1299-1319.
25. Smola A. (Eds.) Schlkopf B., and Burges C.
Advances in kernel methods -
support vector learning. MIT.
26. L. Sweeney. k-anonymity: a model for protecting privacy. In
International
Journal on Uncertainty, Fuzziness and Knowledge-based Systems
, 10(5), 557-
570, 2002.
27. J. Vaidya and C. Clifton. Secure set intersection cardinality with application to
association rule mining. In
Journal of Computer Security
,IOS,toappear.
28. V. Vapnik. The nature of statistical learning theory. Springer, Berlin Heidelberg
New York, 1995.
29. V. N. Vapnik. Estimation of dependences based on empirical data. Springer,
Berlin Heidelberg New York, 1982, 22.
30. R. Wright and Z. Yang. Privacy-preserving bayesian network structure com-
putation on distributed heterogeneous data. In
Proceedings of the 10th ACM
SIGKDD International Conference on Knowledge Discovery and Data Mining
(KDD)
, 2004.
31. A. C. Yao. Protocols for secure computations. In
Proceedings of the 23rd Annual
IEEE Symposium on Foundations of Computer Science
, 1982.
32. J. Zhan, L. Chang, and S. Mawin. How to prevent private data from being dis-
closed to a malicious attacker. In
IEEE International Workshop on Foundations
of Semantic Oriented Data and Web Mining
, Houston, Texas, USA, November
27-30, 2005.
33. Z. Zhan, S. Matwin, and L. Chang. Building support vector machines on private
data. In
International Conference on Artificial Intelligence, to appear
, 2005.
