A Federated Learning Approach to Frequent Itemset Mining in Cyber-Physical Systems
-
Published:2021-06-01
Issue:4
Volume:29
Page:
-
ISSN:1064-7570
-
Container-title:Journal of Network and Systems Management
-
language:en
-
Short-container-title:J Netw Syst Manage
Author:
Ahmed Usman, Srivastava GautamORCID, Lin Jerry Chun-Wei
Abstract
AbstractEffective vector representation has been proven useful for transaction classification and clustering tasks in Cyber-Physical Systems. Traditional methods use heuristic-based approaches and different pruning strategies to discover the required patterns efficiently. With the extensive and high dimensional availability of transactional data in cyber-physical systems, traditional methods that used frequent itemsets (FIs) as features suffer from dimensionality, sparsity, and privacy issues. In this paper, we first propose a federated learning-based embedding model for the transaction classification task. The model takes transaction data as a set of frequent item-sets. Afterward, the model can learn low dimensional continuous vectors by preserving the frequent item-sets contextual relationship. We perform an in-depth experimental analysis on the number of high dimensional transactional data to verify the developed models with attention-based mechanism and federated learning. From the results, it can be seen that the designed model can help and improve the decision boundary by reducing the global loss function while maintaining both security and privacy.
Funder
Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada Western Norway University Of Applied Sciences
Publisher
Springer Science and Business Media LLC
Subject
Strategy and Management,Computer Networks and Communications,Hardware and Architecture,Information Systems
Reference58 articles.
1. Fournier-Viger, P., Lin, J.C.W., Vo, B., Chi, T.T., Zhang, J., Le, H.B.: A survey of itemset mining. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 7(4), 1207 (2017) 2. Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53–87 (2004) 3. Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. The International Conference on Very Large Data Bases, vol. 1215, pp. 487–499 (1994) 4. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov. 3(1), 259–289 (1997) 5. Fournier-Viger, P., Lin, J.C.W., Kiran, R.U., Koh, Y.S., Thomas, R.: A survey of sequential pattern mining. Data Sci. Pattern Recogn. 1, 54–77 (2017)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|