An agent based privacy preserving mining for distributed databases

被引:0
作者
Baik, SW [1 ]
Bala, J
Rhee, D
机构
[1] Sejong Univ, Seoul 143747, South Korea
[2] Datamat Syst Res Inc, Mclean, VA 22102 USA
[3] Sangmyung Univ, Seoul 110743, South Korea
来源
COMPUTATIONAL AND INFORMATION SCIENCE, PROCEEDINGS | 2004年 / 3314卷
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper introduces a novel paradigm of privacy preserving mining for distributed databases. The paradigm includes an agent-based approach for distributed learning of a decision tree to fully analyze data located at several distributed sites without revealing any information at each site. The distributed decision tree approach has been developed from the well-known decision tree algorithm, for the distributed and privacy preserving data mining process. It is performed on the agent based architecture dealing with distributed databases in a collaborative fashion. This approach is very useful to be applied to a variety of domains which require information security and privacy during data mining process.
引用
收藏
页码:910 / 915
页数:6
相关论文
共 12 条
  • [1] Aggarwal CC, 2004, LECT NOTES COMPUT SC, V2992, P183
  • [2] Agrawal S, 2004, LECT NOTES COMPUT SC, V2973, P113
  • [3] BAILEY S, 1999, P INT C SUP
  • [4] Kargupta H, 2003, THIRD IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, P99
  • [5] Kargupta H., 1997, Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, P211
  • [6] KARGUPTA H, 2000, ADV DISTRIBUTED PARA, V5, P131
  • [7] Klusch M, 2003, LECT NOTES ARTIF INT, V2586, P104
  • [8] Krishnaswamy S, 2002, LECT NOTES COMPUT SC, V2329, P603
  • [9] Lindell Y, 2000, LECT NOTES COMPUT SC, V1880, P36
  • [10] Malvestuto FM, 2004, ANN NY ACAD SCI, V3050, P353