Discovering and Ranking Urban Social Clusters Out of Streaming Social Media Datasets

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-10-24 DOI:10.1002/cpe.8314
Mete Celik, Ahmet Sakir Dokuz, Alper Ecemis, Emre Erdogmus
{"title":"Discovering and Ranking Urban Social Clusters Out of Streaming Social Media Datasets","authors":"Mete Celik,&nbsp;Ahmet Sakir Dokuz,&nbsp;Alper Ecemis,&nbsp;Emre Erdogmus","doi":"10.1002/cpe.8314","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Urban social media mining is the process of discovering urban patterns from spatio-temporal social media datasets. Urban social clusters are the clusters formed by the social media posts of users living in cities at a certain time and place. Discovering and identifying urban social clusters is of great importance for urban and regional planning, target audience identification, a better understanding of city dynamics and so forth. Discovering and ranking urban social clusters out of streaming social media datasets require efficient filtering approaches and mining algorithms. In the literature, there are several studies performed that address the discovery of the importance of urban clusters. Most of these studies take into account the spatial expansions over time and the changes in the numbers of elements within clusters when identifying the significance of urban clusters. However, in contrast to these studies, we have also considered cluster temporal formation stability, spatial density variation, and the impact of meta-information on urban social clusters. In this study, Temporal, Spatial, and Meta Important Urban Social Clusters Miner (TSMIUSC-Miner) algorithm is proposed. In the proposed algorithm, urban social clusters are discovered, and their importance relative to each other are compared and ranked. The temporal, spatial and meta importance scores of the clusters are calculated and then, the clusters that satisfy predefined score thresholds are discovered. The performance of the proposed TSMIUSC-Miner algorithm compared with that of a naive approach using real-life streaming Twitter/X dataset. The results showed that the proposed TSMIUSC-Miner algorithm outperforms the naive approach in terms of execution time.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8314","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Urban social media mining is the process of discovering urban patterns from spatio-temporal social media datasets. Urban social clusters are the clusters formed by the social media posts of users living in cities at a certain time and place. Discovering and identifying urban social clusters is of great importance for urban and regional planning, target audience identification, a better understanding of city dynamics and so forth. Discovering and ranking urban social clusters out of streaming social media datasets require efficient filtering approaches and mining algorithms. In the literature, there are several studies performed that address the discovery of the importance of urban clusters. Most of these studies take into account the spatial expansions over time and the changes in the numbers of elements within clusters when identifying the significance of urban clusters. However, in contrast to these studies, we have also considered cluster temporal formation stability, spatial density variation, and the impact of meta-information on urban social clusters. In this study, Temporal, Spatial, and Meta Important Urban Social Clusters Miner (TSMIUSC-Miner) algorithm is proposed. In the proposed algorithm, urban social clusters are discovered, and their importance relative to each other are compared and ranked. The temporal, spatial and meta importance scores of the clusters are calculated and then, the clusters that satisfy predefined score thresholds are discovered. The performance of the proposed TSMIUSC-Miner algorithm compared with that of a naive approach using real-life streaming Twitter/X dataset. The results showed that the proposed TSMIUSC-Miner algorithm outperforms the naive approach in terms of execution time.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
从流式社交媒体数据集中发现城市社交集群并对其进行排名
城市社交媒体挖掘是从时空社交媒体数据集中发现城市模式的过程。城市社交集群是指生活在城市中的用户在一定时间和地点的社交媒体帖子所形成的集群。发现和识别城市社会集群对于城市和区域规划、目标受众识别、更好地了解城市动态等都具有重要意义。从流式社交媒体数据集中发现和排名城市社交集群需要有效的过滤方法和挖掘算法。在文献中,有几项研究是针对城市群重要性的发现进行的。这些研究在确定城市群的重要性时,大多考虑了空间随时间的扩展和集群内要素数量的变化。然而,与这些研究相比,我们还考虑了集群的时间形成稳定性、空间密度变化以及元信息对城市社会集群的影响。本文提出了时间、空间和元重要城市社会集群挖掘算法(TSMIUSC-Miner)。在该算法中,发现城市社会集群,并对其相对重要性进行比较和排序。计算聚类的时间、空间和元重要性得分,然后发现满足预定义得分阈值的聚类。提出的TSMIUSC-Miner算法的性能与使用真实流Twitter/X数据集的朴素方法的性能进行了比较。结果表明,提出的TSMIUSC-Miner算法在执行时间方面优于朴素方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
A Dynamic Energy-Efficient Scheduling Method for Periodic Workflows Based on Collaboration of Edge-Cloud Computing Resources An Innovative Performance Assessment Method for Increasing the Efficiency of AODV Routing Protocol in VANETs Through Colored Timed Petri Nets YOLOv8-ESW: An Improved Oncomelania hupensis Detection Model Three Party Post Quantum Secure Lattice Based Construction of Authenticated Key Establishment Protocol for Mobile Communication Unstructured Text Data Security Attribute Mining Method Based on Multi-Model Collaboration
×
引用
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