Parallel mining of frequent patterns for school records analytics at the Universidad Michoacana

J. Flores, J. Garcia-Nava, Monserrat A. Castro-Coria, Victor M. Tellez, B. E. Huerta, Josue Espinosa-Romero, F. Calderón
{"title":"Parallel mining of frequent patterns for school records analytics at the Universidad Michoacana","authors":"J. Flores, J. Garcia-Nava, Monserrat A. Castro-Coria, Victor M. Tellez, B. E. Huerta, Josue Espinosa-Romero, F. Calderón","doi":"10.1109/ROPEC.2017.8261636","DOIUrl":null,"url":null,"abstract":"This paper presents research results on school record analytics, developed for Universidad Michoacana (UM-SNH), based on a parallel implementation of data mining techniques. Core elements of this research work were finding frequent patterns on academic records for all students of UMSNH from 2005 to 2016, and searching for relevant frequent pattern subsets by using the distributed computing platform Spark. The FP-Growth algorithm used for finding frequent patterns is presented, as well as serial, concurrent, and parallel implementations of the mining process based on it. Experimental results are discussed on two different directions: (a) the superior performance achieved by parallel implementation when compared to serial and concurrent versions of the application, and (b) the advantages that mining at the frequent patterns level provides for information retrieval on this specific problem, when compared to mining at association rules or correlation statistics levels.","PeriodicalId":260469,"journal":{"name":"2017 IEEE International Autumn Meeting on Power, Electronics and Computing (ROPEC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Autumn Meeting on Power, Electronics and Computing (ROPEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROPEC.2017.8261636","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents research results on school record analytics, developed for Universidad Michoacana (UM-SNH), based on a parallel implementation of data mining techniques. Core elements of this research work were finding frequent patterns on academic records for all students of UMSNH from 2005 to 2016, and searching for relevant frequent pattern subsets by using the distributed computing platform Spark. The FP-Growth algorithm used for finding frequent patterns is presented, as well as serial, concurrent, and parallel implementations of the mining process based on it. Experimental results are discussed on two different directions: (a) the superior performance achieved by parallel implementation when compared to serial and concurrent versions of the application, and (b) the advantages that mining at the frequent patterns level provides for information retrieval on this specific problem, when compared to mining at association rules or correlation statistics levels.
米却肯纳大学学校记录分析中频繁模式的并行挖掘
本文介绍了为米却肯纳大学(UM-SNH)开发的基于数据挖掘技术并行实现的学校记录分析的研究结果。本研究工作的核心内容是在2005 - 2016年UMSNH所有学生的学习记录中寻找频繁模式,并利用分布式计算平台Spark搜索相关的频繁模式子集。提出了用于查找频繁模式的FP-Growth算法,以及基于该算法的挖掘过程的串行、并发和并行实现。实验结果在两个不同的方向上进行了讨论:(a)与串行和并发版本的应用程序相比,并行实现获得了更好的性能;(b)与在关联规则或相关统计级别的挖掘相比,在频繁模式级别的挖掘为该特定问题的信息检索提供了优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信