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.

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