An efficient framework for the similarity prediction with query recommendation in E‐learning system

Vedavathi Nagendra Prasad, Anil Kumar Kureekatil Muthappa
{"title":"An efficient framework for the similarity prediction with query recommendation in E‐learning system","authors":"Vedavathi Nagendra Prasad, Anil Kumar Kureekatil Muthappa","doi":"10.1002/cpe.7145","DOIUrl":null,"url":null,"abstract":"A novel model of data similarity estimation and clustering method is proposed in this article to retrieve the relevant data with the best matching in big data processing. An advanced model of graph distance pattern (GDP) method with lexical subgroup (LS) system is used to estimate the similarity between the query data and the entire database. With the help of neural network, the relevancy of feature attributes in the database are predicted and matching index is sorted to provide the recommended data for given query data. This was achieved by using the correlated sim‐neural network (CSNN). This is an enhanced model of neural network technology to find the relevancy based on the correlation factor of feature set. The training process of CSNN classifier is carried by estimating the correlation factor of the attributes of dataset. These are forms as the clusters and paged with proper indexing based on the LS parameter of similarity metric. The results obtained by the proposed system for recall, precision, accuracy, error rate, F‐measure, kappa coefficient, specificity, and MCC are 0.98, 0.98, 0.97, 0.03, 0.99, 0.991, 0.986, and 0.984, respectively.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"17 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation: Practice and Experience","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/cpe.7145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A novel model of data similarity estimation and clustering method is proposed in this article to retrieve the relevant data with the best matching in big data processing. An advanced model of graph distance pattern (GDP) method with lexical subgroup (LS) system is used to estimate the similarity between the query data and the entire database. With the help of neural network, the relevancy of feature attributes in the database are predicted and matching index is sorted to provide the recommended data for given query data. This was achieved by using the correlated sim‐neural network (CSNN). This is an enhanced model of neural network technology to find the relevancy based on the correlation factor of feature set. The training process of CSNN classifier is carried by estimating the correlation factor of the attributes of dataset. These are forms as the clusters and paged with proper indexing based on the LS parameter of similarity metric. The results obtained by the proposed system for recall, precision, accuracy, error rate, F‐measure, kappa coefficient, specificity, and MCC are 0.98, 0.98, 0.97, 0.03, 0.99, 0.991, 0.986, and 0.984, respectively.
基于查询推荐的E - learning相似度预测框架
本文提出了一种新的数据相似度估计和聚类方法模型,以便在大数据处理中检索到最匹配的相关数据。提出了一种基于词法子群(LS)系统的图形距离模式(GDP)方法的高级模型,用于估计查询数据与整个数据库之间的相似度。利用神经网络预测数据库中特征属性的相关性,排序匹配索引,为给定的查询数据提供推荐数据。这是通过使用相关sim -神经网络(CSNN)实现的。这是一种基于特征集的相关因子来寻找相关性的神经网络技术的增强模型。CSNN分类器的训练过程是通过估计数据集属性的相关因子来进行的。这些形式作为聚类,并根据相似度度量的LS参数进行适当的索引分页。该系统的召回率、精密度、准确度、错误率、F - measure、kappa系数、特异性和MCC分别为0.98、0.98、0.97、0.03、0.99、0.991、0.986和0.984。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信