Journals / Turkish Journal of Electrical Engineering and Computer Science / 2020 / Cilt: 28 - Sayı: 2

Multitask-based association rule mining

Pages
933–955
Publication Date
2020-03-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The experimental results indicated that the proposed MTARM approach discovers more information than that of traditional ARM algorithms by jointly considering the relationships among multiple tasks.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Recently, there has been a growing interest in association rule mining ARM in various fields.
📊
Key Findings & Data:In the first phase of the proposed approach, highly frequent local rules single-task rules are explored for each task separately and then these local rules are combined to produce the global result multitask rules using a majority voting mechanism.
💡
Conclusion & Impact:The experimental results indicated that the proposed MTARM approach discovers more information than that of traditional ARM algorithms by jointly considering the relationships among multiple tasks.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Association rule mining · multitask learning · data mining

Abstract

Recently, there has been a growing interest in association rule mining ARM in various fields. However, standard ARM algorithms fail to discover rules for multitask problems as they do not consider task-oriented investigation and, therefore, they ignore the correlation among the tasks. Considering this situation, this paper proposes a novel algorithm, named multitask association rule miner MTARM , that tends to jointly discover rules by considering multiple tasks. This paper also introduces two novel concepts: single-task rule and multiple-task rule. In the first phase of the proposed approach, highly frequent local rules single-task rules are explored for each task separately and then these local rules are combined to produce the global result multitask rules using a majority voting mechanism. Experiments were conducted on four different real-world multitask learning datasets. The experimental results indicated that the proposed MTARM approach discovers more information than that of traditional ARM algorithms by jointly considering the relationships among multiple tasks.

🔖

Cite This Article

TAŞER, P. Y., BİRANT, K. U., BİRANT, D. (2020). Multitask-based association rule mining. Turkish Journal of Electrical Engineering and Computer Science, Cilt: 28 - Sayı: 2, 933–955. https://ajindex.com/articles/186610

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (1)

  1. Ai D, Pan H, Li X, Gao Y, He D. Association rule mining algorithms on high-dimensional datasets. Artificial Life and Robotics 2018; 23 (3): 420-427. doi: 10.1007/s10015-018-0437-y [2] Moodley R, Chiclana F, Caraffini F, Carter J. Application of uninorms to market basket analysis. International Journal of Intelligent Systems 2019; 34 (1): 39-49. doi: 10.1002/int.22039 [3] Gao T, Cheng B, Chen J, Xue H, Duan L et al. Interest-aware service association rule creation for service recommendation and linking mode recommendation in user-generated service. IEEE Access 2018; 6: 57721-57737. doi: 10.1109/access.2018.2873708 [4] Hela S, Amel B, Badran R. Early anomaly detection in smart home: a causal association rule-based approach. Artificial Intelligence in Medicine 2018; 91: 57-71. doi: 10.1016/j.artmed.2018.06.001 [5] Agapito G, Guzzi P, Cannataro M. Parallel extraction of association rules from genomics data. Applied Mathematics and Computation 2019; 350: 434-446. doi: 10.1016/j.amc.2017.09.026 [6] Santos F, Domingues M, Sundermann C, Carvalho V, Moura M et al. Latent association rule cluster based model to extract topics for classification and recommendation applications. Expert Systems with Applications 2018; 112: 34-60. doi: 10.1016/j.eswa.2018.06.021 [7] Naik A, Rangwala H. Multi-task learning. In: Naik A (editor). Large Scale Hierarchical Classification: State of the Art. Cham, Switzerland: Springer International Publishing, 2019, pp. 75-88. [8] Agrawal R, Srikant R. Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases VLDB’94; San Francisco, CA, USA; 1994. pp. 487-499. [9] Han J, Pei J, Yin Y, Mining frequent patterns without candidate generation. In: Proceedings of the 2000 International Conference on Management of Data ACM SIGMOD; Dallas, TX, USA; 2000. pp. 1-12. [10] Zaki M. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering 2000; 12 (3): 372-390. doi: 10.1109/69.846291 [11] Kao W, Lo C, Li K, Yang H, Yan J. Research of mining multi-level association rule models. In: Hung J, Yen N, Li KC (editors). Frontier Computing, Lecture Notes in Electrical Engineering. Singapore: Springer, 2016, pp. 279-288. [12] Alsukhni E, Al Eroud A, Saifan A. A hybrid pre-post constraint-based framework for discovering multi-dimensional association rules using ontologies. International Journal of Information Technology and Web Engineering 2019; 14 (1): 112-13