通过模拟相似性空间中主题的莱维散步性质,实现可扩展的网络主题检测

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2024-10-10 DOI:10.1016/j.ins.2024.121544
Junbiao Pang , Qingming Huang
{"title":"通过模拟相似性空间中主题的莱维散步性质,实现可扩展的网络主题检测","authors":"Junbiao Pang ,&nbsp;Qingming Huang","doi":"10.1016/j.ins.2024.121544","DOIUrl":null,"url":null,"abstract":"<div><div>Organizing a few webpages from social media into hot topics is one of the key steps to understand trends on web. Discovering popular yet hot topics from web faces a sea of noise webpages which never evolve into popular topics. In this paper, we discover that the similarity values between webpages in a popular topic contain the statistically similar features observed in Lévy walks. Consequently, we present a simple, novel, yet very powerful Explore-Exploit (EE) approach to group topics by simulating Lévy walks nature in the similarity space. The proposed EE-based topic clustering is an effective and efficient method which is a solid move towards handling a sea of noise webpages. Experiments on two public data sets demonstrate that our approach is not only comparable to the State-Of-The-Art (SOTA) methods in terms of effectiveness but also significantly outperforms the SOTA methods in terms of efficiency.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"690 ","pages":"Article 121544"},"PeriodicalIF":8.1000,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Towards scalable topic detection on web via simulating Lévy walks nature of topics in similarity space\",\"authors\":\"Junbiao Pang ,&nbsp;Qingming Huang\",\"doi\":\"10.1016/j.ins.2024.121544\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Organizing a few webpages from social media into hot topics is one of the key steps to understand trends on web. Discovering popular yet hot topics from web faces a sea of noise webpages which never evolve into popular topics. In this paper, we discover that the similarity values between webpages in a popular topic contain the statistically similar features observed in Lévy walks. Consequently, we present a simple, novel, yet very powerful Explore-Exploit (EE) approach to group topics by simulating Lévy walks nature in the similarity space. The proposed EE-based topic clustering is an effective and efficient method which is a solid move towards handling a sea of noise webpages. Experiments on two public data sets demonstrate that our approach is not only comparable to the State-Of-The-Art (SOTA) methods in terms of effectiveness but also significantly outperforms the SOTA methods in terms of efficiency.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"690 \",\"pages\":\"Article 121544\"},\"PeriodicalIF\":8.1000,\"publicationDate\":\"2024-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025524014580\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025524014580","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

将社交媒体中的一些网页整理成热门话题,是了解网络趋势的关键步骤之一。要从网络中发现热门话题,就必须面对大量从未演变成热门话题的噪音网页。在本文中,我们发现热门话题中网页之间的相似度值包含在莱维散步中观察到的统计相似特征。因此,我们提出了一种简单、新颖但功能强大的 "探索-探索"(EE)方法,通过模拟相似性空间中的莱维散步性质来对话题进行分组。所提出的基于 EE 的主题聚类是一种有效且高效的方法,是处理海量噪音网页的坚实举措。在两个公共数据集上进行的实验表明,我们的方法不仅在效果上与最新技术(SOTA)方法不相上下,而且在效率上明显优于 SOTA 方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Towards scalable topic detection on web via simulating Lévy walks nature of topics in similarity space
Organizing a few webpages from social media into hot topics is one of the key steps to understand trends on web. Discovering popular yet hot topics from web faces a sea of noise webpages which never evolve into popular topics. In this paper, we discover that the similarity values between webpages in a popular topic contain the statistically similar features observed in Lévy walks. Consequently, we present a simple, novel, yet very powerful Explore-Exploit (EE) approach to group topics by simulating Lévy walks nature in the similarity space. The proposed EE-based topic clustering is an effective and efficient method which is a solid move towards handling a sea of noise webpages. Experiments on two public data sets demonstrate that our approach is not only comparable to the State-Of-The-Art (SOTA) methods in terms of effectiveness but also significantly outperforms the SOTA methods in terms of efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Editorial Board Community structure testing by counting frequent common neighbor sets Finite-time secure synchronization for stochastic complex networks with delayed coupling under deception attacks: A two-step switching control scheme Adaptive granular data compression and interval granulation for efficient classification Introducing fairness in network visualization
×
引用
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