NOTES ON PRIVACY-PRESERVING DISTRIBUTED MINING AND HAMILTONIAN CYCLES

Renren Dong, Ray kresman

2010

Abstract

Distributed storage and retrieval of data is both the norm and a necessity in today’s computing environment. However, sharing and dissemination of this data is subject to privacy concerns. This paper addresses the role of graph theory, especially Hamiltonian cycles, on privacy preserving algorithms for mining distributed data. We propose a new heuristic algorithm for discovering disjoint Hamiltonian cycles in the underlying network. Disjoint Hamiltonian cycles are useful in a number of applications; for example, to ensure that someone’s private data remains private even when others collude to discover the data.

Paper Citation

in Harvard Style

Dong R. and kresman R. (2010). NOTES ON PRIVACY-PRESERVING DISTRIBUTED MINING AND HAMILTONIAN CYCLES . In Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-989-8425-22-5, pages 103-107. DOI: 10.5220/0002922001030107

in Bibtex Style

@conference{icsoft10,
author={Renren Dong and Ray kresman},
title={NOTES ON PRIVACY-PRESERVING DISTRIBUTED MINING AND HAMILTONIAN CYCLES},
booktitle={Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2010},
pages={103-107},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002922001030107},
isbn={978-989-8425-22-5},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - NOTES ON PRIVACY-PRESERVING DISTRIBUTED MINING AND HAMILTONIAN CYCLES
SN - 978-989-8425-22-5
AU - Dong R.
AU - kresman R.
PY - 2010
SP - 103
EP - 107
DO - 10.5220/0002922001030107