MINING OF ASSOCIATION RULES FROM DISTRIBUTED DATA USING MOBILE AGENTS

Gongzhu Hu, Shaozhen Ding

2009

Abstract

In this paper, we propose an agent-based approach to mine association rules from data sets that are distributed across multiple locations while preserving the privacy of local data. This approach relies on the local systems to find frequent itemsets that are encrypted and the partial results are carried from site to site. In this way, the privacy of local data is preserved. We present a structural model that includes several types of mobile agents with specific functionalities and communication scheme to accomplish the task. These agents implement the privacy-preserving algorithms for distributed association rule mining.

References

  1. Agrawal, D. and Aggarwal, C. C. (2001). On the design and quantification of privacy preserving data mining algorithms. In Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART symposium on Principles of Database, pages 247-255. ACM.
  2. Baik, S. W., Bala, J., and Cho, J. S. (2005). Agent based distributed data mining. In Parallel and Distributed Computing: Applications and Technologies, volume 3320 of Lecture Notes in Computer Science, pages 42-45. Springer.
  3. Cartrysse, K. and van der Lubbe, J. C. A. (2004). Privacy in mobile agents. In IEEE First Symposium on MultiAgent Security and Survivability, pages 73-82. IEEE Computer Society.
  4. Cheung, D. W.-L., Ng, V. T. Y., Fu, A. W.-C., and Fu, Y. (1996). Efficient mining of association rules in distributed databases. IEEE Transactions on Knowledge and Data Engineering, 8(6):911-922.
  5. Clifton, C. and Marks, D. (1996). Security and privacy implications of data mining. In ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, pages 15-19.
  6. da Silva, J. C., Klusch, M., Lodi, S., and Moro, G. (2006). Privacy-preserving agent-based distributed data clustering. Web Intelligence and Agent Systems, 4(2):221- 238.
  7. Kantarcioglu, M. and Clifton, C. (2004). Privacypreserving distributed mining of association rules on horizontally partitioned data. IEEE Transactions on Knowledge and Data Engineering, 16(9):1026-1037.
  8. Lange, D. B. and Oshima, M. (1998a). Mobile agents with Java: The Aglet API. World Wide Web, 1(3):111-121.
  9. Lange, D. B. and Oshima, M. (1998b). Programming and Deploying Java Mobile Agents Aglets. AddisonWesley Longman Publishing.
  10. Peng, K., Dawson1, E., Nieto1, J. G., Okamoto1, E., and Lpez, J. (2005). A novel method to maintain privacy in mobile agent applications. In Cryptology and Network Security, volume 3810 of Lecture Notes in Computer Science, pages 247-260. Springer.
  11. Rizvi, S. J. and Haritsa, J. R. (2002). Maintaining data privacy in association rule mining. In Proceedings of the 28th International Conference on Very Large Data Bases, pages 682-693. ACM.
Download


Paper Citation


in Harvard Style

Hu G. and Ding S. (2009). MINING OF ASSOCIATION RULES FROM DISTRIBUTED DATA USING MOBILE AGENTS . In Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2009) ISBN 978-989-674-006-1, pages 21-26. DOI: 10.5220/0002231600210026


in Bibtex Style

@conference{ice-b09,
author={Gongzhu Hu and Shaozhen Ding},
title={MINING OF ASSOCIATION RULES FROM DISTRIBUTED DATA USING MOBILE AGENTS},
booktitle={Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2009)},
year={2009},
pages={21-26},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002231600210026},
isbn={978-989-674-006-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on e-Business - Volume 1: ICE-B, (ICETE 2009)
TI - MINING OF ASSOCIATION RULES FROM DISTRIBUTED DATA USING MOBILE AGENTS
SN - 978-989-674-006-1
AU - Hu G.
AU - Ding S.
PY - 2009
SP - 21
EP - 26
DO - 10.5220/0002231600210026