Preference Utility algorithm using GPGPU architecture

Che-Lun Hung, Hsiao-Hsi Wang, Jieh-Shan Yeh, Yu-Chen Hu, Chun-Yuan Lin, Yaw-Ling Lin
{"title":"Preference Utility algorithm using GPGPU architecture","authors":"Che-Lun Hung, Hsiao-Hsi Wang, Jieh-Shan Yeh, Yu-Chen Hu, Chun-Yuan Lin, Yaw-Ling Lin","doi":"10.1109/ICIS.2013.6607833","DOIUrl":null,"url":null,"abstract":"Nowadays, with the explosive growth of the network technologies many new applications and services have been developed on Internet. World Wide Web can provide these services provided without the limitation of time and location. Obviously, the number of user is dramatically increasing from amount of the visitations of web pages. In our previous work, we proposed an algorithm to discover more significant information from visited web pages to provide this information to web designers or policy makers to adjust the presentation of their Web contents. However, this algorithm is time-consuming approach due to it needs to scan the whole database many times. Therefore, we propose a GPGPU-based Preference Utility algorithm to enhance the performance by GPGPU parallel model. The proposed algorithm is developed on NVIDIA CUDA architecture. The experimental results show that the proposed method can achieve about 7x times over CPU-based method. The proposed algorithm can used to mine the information from web log data efficiently.","PeriodicalId":345020,"journal":{"name":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIS.2013.6607833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Nowadays, with the explosive growth of the network technologies many new applications and services have been developed on Internet. World Wide Web can provide these services provided without the limitation of time and location. Obviously, the number of user is dramatically increasing from amount of the visitations of web pages. In our previous work, we proposed an algorithm to discover more significant information from visited web pages to provide this information to web designers or policy makers to adjust the presentation of their Web contents. However, this algorithm is time-consuming approach due to it needs to scan the whole database many times. Therefore, we propose a GPGPU-based Preference Utility algorithm to enhance the performance by GPGPU parallel model. The proposed algorithm is developed on NVIDIA CUDA architecture. The experimental results show that the proposed method can achieve about 7x times over CPU-based method. The proposed algorithm can used to mine the information from web log data efficiently.
使用GPGPU架构的Preference Utility算法
如今,随着网络技术的迅猛发展,互联网上出现了许多新的应用和服务。万维网所提供的这些服务不受时间和地点的限制。很明显,用户的数量随着网页访问量的增加而急剧增加。在我们之前的工作中,我们提出了一种算法,可以从访问过的网页中发现更重要的信息,并将这些信息提供给网页设计师或政策制定者,以调整其网页内容的呈现。然而,该算法需要对整个数据库进行多次扫描,是一种耗时的方法。因此,我们提出了一种基于GPGPU的Preference Utility算法,利用GPGPU并行模型来提高性能。该算法基于NVIDIA CUDA架构开发。实验结果表明,该方法比基于cpu的方法可达到7倍左右。该算法可以有效地从web日志数据中挖掘信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信