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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Federated Mining Framework for Complete Erasable Itemsets

Chun-Hao Chen, Katherine Shu-Min Li, Tzung‐Pei Hong, Meng-Jui Kuo
1 citations
Data Mining Algorithms and Applications
0.78
article

A Federated Mining Framework for Complete Erasable Itemsets

Chun-Hao Chen, Katherine Shu-Min Li, Tzung‐Pei Hong, Meng-Jui Kuo
article en
1 citations

Abstract

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.

National Sun Yat-sen University (TW), National University of Kaohsiung (TW), National Kaohsiung University of Science and Technology (TW)
Openalex Percentile: Top 18%
Data Mining Algorithms and Applications
0.78
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Federated Mining Framework for Complete Erasable Itemsets — Chun-Hao Chen, Katherine Shu-Min Li, et al. · (2024) | TGRS Research Map | TGRS