講演抄録/キーワード |
講演名 |
2007-07-19 15:45
安全な相関ルール発見方式に関する再考 ○蘇 春華(九大)・周 建英・鮑 峰(I2R)・高木 剛(公立はこだて未来大)・櫻井幸一(九大) ISEC2007-35 SITE2007-29 |
抄録 |
(和) |
(まだ登録されていません) |
(英) |
Assocaition Rules Mining is a frequently used technique which finds interesting associations and correlation relationships among large set of data items that occur frequently together in varieties of social and bussiness area. For the coopertional distributed assocaition rules mining, privacy-preserving techniques are strongly needed. In this paper, we employ frequent-pattern tree (FP-tree) structure storing compressed, crucial information about frequent patterns, and develop an efficient and secure FP-treebased mining method. We show that our protocol is collusion resistant, which means that even if all dishonest respondents collude with a dishonest data minerin an attempt to learn the associations between honest respondents and their responses, they will be unable to do so. |
キーワード |
(和) |
/ / / / / / / |
(英) |
privacy / association rules mining / cryptographic protocol / / / / / |
文献情報 |
信学技報, vol. 107, no. 140, ISEC2007-35, pp. 133-138, 2007年7月. |
資料番号 |
ISEC2007-35 |
発行日 |
2007-07-12 (ISEC, SITE) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
PDFダウンロード |
ISEC2007-35 SITE2007-29 |
|