Intelligent Web-History Based on a Hybrid Clustering Algorithm for Future-Internet Systems

A. Marin, Florin Pop
{"title":"Intelligent Web-History Based on a Hybrid Clustering Algorithm for Future-Internet Systems","authors":"A. Marin, Florin Pop","doi":"10.1109/SYNASC.2011.24","DOIUrl":null,"url":null,"abstract":"Internet grows larger year by year and makes users to be confronted with large quantities of data that they cannot fully comprehend. The ongoing transition from Web 2.0 to the Semantic Web makes the development of intelligent services with the ability to discern, classify and simplify web information of vital importance. In this paper we present a new model for web-history organizing in order to improve the user action over the Internet. Based on this model we proposed an application, delivered as a Google Chrome browser extension, which organizes the web-history into semantic clusters, providing the user with an easy-to-follow hierarchal structure. The paper covers the main algorithms in the field, offering a comprehensive critical analysis, such as document vectorization, relational clustering, fuzzy and genetic variations and the item-set-based approach. Our work consists of adapting these algorithms to support an ever-increasing set of input data. The result is a hybrid variation that rapidly offers an acceptable solution, which is optimized in time, a quality preserved during the extensive web explorations a user may undergo. A variety of test results is presented in the end, with under-stress behavior and a selection of user experience.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2011.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Internet grows larger year by year and makes users to be confronted with large quantities of data that they cannot fully comprehend. The ongoing transition from Web 2.0 to the Semantic Web makes the development of intelligent services with the ability to discern, classify and simplify web information of vital importance. In this paper we present a new model for web-history organizing in order to improve the user action over the Internet. Based on this model we proposed an application, delivered as a Google Chrome browser extension, which organizes the web-history into semantic clusters, providing the user with an easy-to-follow hierarchal structure. The paper covers the main algorithms in the field, offering a comprehensive critical analysis, such as document vectorization, relational clustering, fuzzy and genetic variations and the item-set-based approach. Our work consists of adapting these algorithms to support an ever-increasing set of input data. The result is a hybrid variation that rapidly offers an acceptable solution, which is optimized in time, a quality preserved during the extensive web explorations a user may undergo. A variety of test results is presented in the end, with under-stress behavior and a selection of user experience.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
未来互联网系统中基于混合聚类算法的智能web历史
互联网的规模逐年扩大,用户面临着大量无法完全理解的数据。正在进行的从Web 2.0到语义Web的过渡使得智能服务的发展具有识别、分类和简化至关重要的Web信息的能力。本文提出了一种新的网络历史组织模型,以改善用户在互联网上的行为。基于这个模型,我们提出了一个应用程序,作为Google Chrome浏览器扩展交付,它将网络历史组织成语义集群,为用户提供一个易于遵循的层次结构。本文涵盖了该领域的主要算法,并提供了全面的批判性分析,如文档矢量化,关系聚类,模糊和遗传变异以及基于项集的方法。我们的工作包括调整这些算法以支持不断增加的输入数据集。结果是一个混合的变化,迅速提供了一个可接受的解决方案,它是及时优化的,在用户可能经历的广泛的网络探索中保持质量。最后给出了各种测试结果,并给出了压力下的行为和用户体验的选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Project Duration Assessment Model Based on Modified Shortest Path Algorithm and Superposition A Data Dissemination Algorithm for Opportunistic Networks A Probabilistic Model-Free Approach in Learning Multivariate Noisy Linear Systems Probabilistic Approach for Automated Reasoning for Lane Identification in Intelligent Vehicles Intelligent Web-History Based on a Hybrid Clustering Algorithm for Future-Internet Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1