A Federated Mining Framework for Complete Erasable Itemsets
In this study, we develop an innovative federated framework for erasable itemset mining to address the challenges of horizontal federated learning in data mining and resolve the shortcomings of the previous algorithm. The framework is based on a client-server architecture, in which clients from multiple data sources collaborate to effectively integrate information. The proposed algorithm is divided into two parts, including the client-side mining and the server-side aggregation. During the client-side mining stage, the algorithm introduces quasi-erasable itemsets to collect additional useful information, facilitating the integration of results on the server side. In the server-side aggregation stage, the algorithm employs a boundary strategy, effectively utilizing the clients' quasi-erasable and erasable itemsets to improve the accuracy of the results. Experimental results demonstrate that the proposed method not only effectively mines complete knowledge but also ensures data-privacy protection.
Authors
- Chun-Hao Chen
- Katherine Shu-Min Li (ORCID: https://orcid.org/0000-0002-9942-5185)
- Tzung‐Pei Hong (ORCID: https://orcid.org/0000-0001-7305-6492)
- Meng-Jui Kuo
Institutions
- National Sun Yat-sen University (TW)
- National University of Kaohsiung (TW)
- National Kaohsiung University of Science and Technology (TW)
Publication Details
- Published
- 2024-12-15
- DOI
- https://doi.org/10.1109/bigdata62323.2024.10825622
- Citations
- 1
- Primary Topic
- Data Mining Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.78