Journal of Safety Science and Resilience2025，Vol.6Issue(1)：P.93-104,12.DOI:10.1016/j.jnlssr.2024.08.001
An efficient and resilience linear prefix approach for mining maximal frequent itemset using clustering
M.Sinthuja 1S.Pravinthraja 2B K Dhanalakshmi 3H L Gururaj 4Vinayakumar Ravi 5G Jyothish Lal6
作者信息
- 1. Department of ISE M.S.Ramaiah Institute of Technology,Bengaluru,Visvesvaraya Technological University,Belagavi,Karnataka,590018,India
- 2. Department of CSE,Presidency University,Bengaluru,India
- 3. Department of Computer Science and Engineering,BMS institute of Technology&Management,Bengaluru,Visvesvaraya Technological University,Belagavi,Karnataka,590018,India
- 4. Department of Information Technology,Manipal Institute of Technology Bengaluru,Manipal Academy of Higher Education,Manipal,India
- 5. Center for Artificial Intelligence,Prince Mohammad Bin Fahd University,Khobar,Saudi Arabia
- 6. Center for Computational Engineering and Networking(CEN),Amrita School of Engineering,Amrita Vishwa Vidyapeetham,Coimbatore,India
- 折叠
摘要
关键词
Clustering/Data mining/Frequent itemset mining/Linear prefix tree/Maximal frequent itemset mining分类
信息技术与安全科学引用本文复制引用
M.Sinthuja,S.Pravinthraja,B K Dhanalakshmi,H L Gururaj,Vinayakumar Ravi,G Jyothish Lal..An efficient and resilience linear prefix approach for mining maximal frequent itemset using clustering[J].Journal of Safety Science and Resilience,2025,6(1):P.93-104,12.
