抽象的な

FP-TREE ALGORITHM USING MODIFIED-CK SECURE SUM METHOD

Jyotirmayee Rautaray, Raghvendra Kumar

Privacy consideration is frequently moderation of data mining. This paper addresses the problem of association rule mining using the FP tree algorithm where operation is scattered across multiple parties. Each party holds the number of transaction and the parties wish to work together to recognize globally valid Association rule. We presents the multi party transaction data that discovers frequent item sets with minimum support, without either parties revelling the individual data

免責事項: この要約は人工知能ツールを使用して翻訳されており、まだレビューまたは確認されていません

インデックス付き

Academic Keys
ResearchBible
CiteFactor
Cosmos IF
RefSeek
Hamdard University
World Catalogue of Scientific Journals
Scholarsteer
International Innovative Journal Impact Factor (IIJIF)
International Institute of Organised Research (I2OR)
Cosmos

もっと見る