arXiv - CS - Social and Information Networks最新文献_第10页

Explainable Hierarchical Urban Representation Learning for Commuting Flow Prediction 用于通勤流量预测的可解释分层城市表征学习

arXiv - CS - Social and Information Networks Pub Date : 2024-08-27 DOI: arxiv-2408.14762

Mingfei Cai, Yanbo Pang, Yoshihide Sekimoto

{"title":"Explainable Hierarchical Urban Representation Learning for Commuting Flow Prediction","authors":"Mingfei Cai, Yanbo Pang, Yoshihide Sekimoto","doi":"arxiv-2408.14762","DOIUrl":"https://doi.org/arxiv-2408.14762","url":null,"abstract":"Commuting flow prediction is an essential task for municipal operations in\u0000the real world. Previous studies have revealed that it is feasible to estimate\u0000the commuting origin-destination (OD) demand within a city using multiple\u0000auxiliary data. However, most existing methods are not suitable to deal with a\u0000similar task at a large scale, namely within a prefecture or the whole nation,\u0000owing to the increased number of geographical units that need to be maintained.\u0000In addition, region representation learning is a universal approach for gaining\u0000urban knowledge for diverse metropolitan downstream tasks. Although many\u0000researchers have developed comprehensive frameworks to describe urban units\u0000from multi-source data, they have not clarified the relationship between the\u0000selected geographical elements. Furthermore, metropolitan areas naturally\u0000preserve ranked structures, like cities and their inclusive districts, which\u0000makes elucidating relations between cross-level urban units necessary.\u0000Therefore, we develop a heterogeneous graph-based model to generate meaningful\u0000region embeddings at multiple spatial resolutions for predicting different\u0000types of inter-level OD flows. To demonstrate the effectiveness of the proposed\u0000method, extensive experiments were conducted using real-world aggregated mobile\u0000phone datasets collected from Shizuoka Prefecture, Japan. The results indicate\u0000that our proposed model outperforms existing models in terms of a uniform urban\u0000structure. We extend the understanding of predicted results using reasonable\u0000explanations to enhance the credibility of the model.","PeriodicalId":501032,"journal":{"name":"arXiv - CS - Social and Information Networks","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142226904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Towards Graph Prompt Learning: A Survey and Beyond 实现图形提示学习：调查及其他

arXiv - CS - Social and Information Networks Pub Date : 2024-08-26 DOI: arxiv-2408.14520

Qingqing Long, Yuchen Yan, Peiyan Zhang, Chen Fang, Wentao Cui, Zhiyuan Ning, Meng Xiao, Ning Cao, Xiao Luo, Lingjun Xu, Shiyue Jiang, Zheng Fang, Chong Chen, Xian-Sheng Hua, Yuanchun Zhou

{"title":"Towards Graph Prompt Learning: A Survey and Beyond","authors":"Qingqing Long, Yuchen Yan, Peiyan Zhang, Chen Fang, Wentao Cui, Zhiyuan Ning, Meng Xiao, Ning Cao, Xiao Luo, Lingjun Xu, Shiyue Jiang, Zheng Fang, Chong Chen, Xian-Sheng Hua, Yuanchun Zhou","doi":"arxiv-2408.14520","DOIUrl":"https://doi.org/arxiv-2408.14520","url":null,"abstract":"Large-scale \"pre-train and prompt learning\" paradigms have demonstrated\u0000remarkable adaptability, enabling broad applications across diverse domains\u0000such as question answering, image recognition, and multimodal retrieval. This\u0000approach fully leverages the potential of large-scale pre-trained models,\u0000reducing downstream data requirements and computational costs while enhancing\u0000model applicability across various tasks. Graphs, as versatile data structures\u0000that capture relationships between entities, play pivotal roles in fields such\u0000as social network analysis, recommender systems, and biological graphs. Despite\u0000the success of pre-train and prompt learning paradigms in Natural Language\u0000Processing (NLP) and Computer Vision (CV), their application in graph domains\u0000remains nascent. In graph-structured data, not only do the node and edge\u0000features often have disparate distributions, but the topological structures\u0000also differ significantly. This diversity in graph data can lead to\u0000incompatible patterns or gaps between pre-training and fine-tuning on\u0000downstream graphs. We aim to bridge this gap by summarizing methods for\u0000alleviating these disparities. This includes exploring prompt design\u0000methodologies, comparing related techniques, assessing application scenarios\u0000and datasets, and identifying unresolved problems and challenges. This survey\u0000categorizes over 100 relevant works in this field, summarizing general design\u0000principles and the latest applications, including text-attributed graphs,\u0000molecules, proteins, and recommendation systems. Through this extensive review,\u0000we provide a foundational understanding of graph prompt learning, aiming to\u0000impact not only the graph mining community but also the broader Artificial\u0000General Intelligence (AGI) community.","PeriodicalId":501032,"journal":{"name":"arXiv - CS - Social and Information Networks","volume":"31 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142214926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Synthetic Networks That Preserve Edge Connectivity 保持边缘连接的合成网络

arXiv - CS - Social and Information Networks Pub Date : 2024-08-24 DOI: arxiv-2408.13647

Lahari Anne, The-Anh Vu-Le, Minhyuk Park, Tandy Warnow, George Chacko

{"title":"Synthetic Networks That Preserve Edge Connectivity","authors":"Lahari Anne, The-Anh Vu-Le, Minhyuk Park, Tandy Warnow, George Chacko","doi":"arxiv-2408.13647","DOIUrl":"https://doi.org/arxiv-2408.13647","url":null,"abstract":"Since true communities within real-world networks are rarely known, synthetic\u0000networks with planted ground truths are valuable for evaluating the performance\u0000of community detection methods. Of the synthetic network generation tools\u0000available, Stochastic Block Models (SBMs) produce networks with ground truth\u0000clusters that well approximate input parameters from real-world networks and\u0000clusterings. However, we show that SBMs can produce disconnected ground truth\u0000clusters, even when given parameters from clusterings where all clusters are\u0000connected. Here we describe the REalistic Cluster Connectivity Simulator\u0000(RECCS), a technique that modifies an SBM synthetic network to improve the fit\u0000to a given clustered real-world network with respect to edge connectivity\u0000within clusters, while maintaining the good fit with respect to other network\u0000and cluster statistics. Using real-world networks up to 13.9 million nodes in\u0000size, we show that RECCS, applied to stochastic block models, results in\u0000synthetic networks that have a better fit to cluster edge connectivity than\u0000unmodified SBMs, while providing roughly the same quality fit for other network\u0000and clustering parameters as unmodified SBMs.","PeriodicalId":501032,"journal":{"name":"arXiv - CS - Social and Information Networks","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142214962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Random Walk Diffusion for Efficient Large-Scale Graph Generation 高效大规模图形生成的随机漫步扩散

arXiv - CS - Social and Information Networks Pub Date : 2024-08-08 DOI: arxiv-2408.04461

Tobias Bernecker, Ghalia Rehawi, Francesco Paolo Casale, Janine Knauer-Arloth, Annalisa Marsico

引用次数: 0

Academic collaboration on large language model studies increases overall but varies across disciplines 大型语言模型研究的学术合作总体上有所增加，但各学科之间存在差异

arXiv - CS - Social and Information Networks Pub Date : 2024-08-08 DOI: arxiv-2408.04163

Lingyao Li, Ly Dinh, Songhua Hu, Libby Hemphill

{"title":"Academic collaboration on large language model studies increases overall but varies across disciplines","authors":"Lingyao Li, Ly Dinh, Songhua Hu, Libby Hemphill","doi":"arxiv-2408.04163","DOIUrl":"https://doi.org/arxiv-2408.04163","url":null,"abstract":"Interdisciplinary collaboration is crucial for addressing complex scientific\u0000challenges. Recent advancements in large language models (LLMs) have shown\u0000significant potential in benefiting researchers across various fields. To\u0000explore the application of LLMs in scientific disciplines and their\u0000implications for interdisciplinary collaboration, we collect and analyze 50,391\u0000papers from OpenAlex, an open-source platform for scholarly metadata. We first\u0000employ Shannon entropy to assess the diversity of collaboration in terms of\u0000authors' institutions and departments. Our results reveal that most fields have\u0000exhibited varying degrees of increased entropy following the release of\u0000ChatGPT, with Computer Science displaying a consistent increase. Other fields\u0000such as Social Science, Decision Science, Psychology, Engineering, Health\u0000Professions, and Business, Management & Accounting have shown minor to\u0000significant increases in entropy in 2024 compared to 2023. Statistical testing\u0000further indicates that the entropy in Computer Science, Decision Science, and\u0000Engineering is significantly lower than that in health-related fields like\u0000Medicine and Biochemistry, Genetics & Molecular Biology. In addition, our\u0000network analysis based on authors' affiliation information highlights the\u0000prominence of Computer Science, Medicine, and other Computer Science-related\u0000departments in LLM research. Regarding authors' institutions, our analysis\u0000reveals that entities such as Stanford University, Harvard University,\u0000University College London, and Google are key players, either dominating\u0000centrality measures or playing crucial roles in connecting research networks.\u0000Overall, this study provides valuable insights into the current landscape and\u0000evolving dynamics of collaboration networks in LLM research.","PeriodicalId":501032,"journal":{"name":"arXiv - CS - Social and Information Networks","volume":"45 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

More than 'Left and Right': Revealing Multilevel Online Political Selective Exposure 超越 "左右"：揭示多层次的网络政治选择性曝光

arXiv - CS - Social and Information Networks Pub Date : 2024-08-07 DOI: arxiv-2408.03828

Yuan Zhang, Laia Castro Herrero, Frank Esser, Alexandre Bovet

{"title":"More than 'Left and Right': Revealing Multilevel Online Political Selective Exposure","authors":"Yuan Zhang, Laia Castro Herrero, Frank Esser, Alexandre Bovet","doi":"arxiv-2408.03828","DOIUrl":"https://doi.org/arxiv-2408.03828","url":null,"abstract":"Selective exposure, individuals' inclination to seek out information that\u0000supports their beliefs while avoiding information that contradicts them, plays\u0000an important role in the emergence of polarization. In the political domain,\u0000selective exposure is usually measured on a left-right ideology scale, ignoring\u0000finer details. Here, we combine survey and Twitter data collected during the\u00002022 Brazilian Presidential Election and investigate selective exposure\u0000patterns between the survey respondents and political influencers. We analyze\u0000the followship network between survey respondents and political influencers and\u0000find a multilevel community structure that reveals a hierarchical organization\u0000more complex than a simple split between left and right. Moreover, depending on\u0000the level we consider, we find different associations between network indices\u0000of exposure patterns and 189 individual attributes of the survey respondents.\u0000For example, at finer levels, the number of influencer communities a survey\u0000respondent follows is associated with several factors, such as demographics,\u0000news consumption frequency, and incivility perception. In comparison, only\u0000their political ideology is a significant factor at coarser levels. Our work\u0000demonstrates that measuring selective exposure at a single level, such as left\u0000and right, misses important information necessary to capture this phenomenon\u0000correctly.","PeriodicalId":501032,"journal":{"name":"arXiv - CS - Social and Information Networks","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141946777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Role Identification based Method for Cyberbullying Analysis in Social Edge Computing 基于角色识别的社交边缘计算网络欺凌分析方法

arXiv - CS - Social and Information Networks Pub Date : 2024-08-07 DOI: arxiv-2408.03502

Runyu Wang, Tun Lu, Peng Zhang, Ning Gu

{"title":"Role Identification based Method for Cyberbullying Analysis in Social Edge Computing","authors":"Runyu Wang, Tun Lu, Peng Zhang, Ning Gu","doi":"arxiv-2408.03502","DOIUrl":"https://doi.org/arxiv-2408.03502","url":null,"abstract":"Over the past few years, many efforts have been dedicated to studying\u0000cyberbullying in social edge computing devices, and most of them focus on three\u0000roles: victims, perpetrators, and bystanders. If we want to obtain a deep\u0000insight into the formation, evolution, and intervention of cyberbullying in\u0000devices at the edge of the Internet, it is necessary to explore more\u0000fine-grained roles. This paper presents a multi-level method for role feature\u0000modeling and proposes a differential evolution-assisted K-means (DEK) method to\u0000identify diverse roles. Our work aims to provide a role identification scheme\u0000for cyberbullying scenarios for social edge computing environments to alleviate\u0000the general safety issues that cyberbullying brings. The experiments on ten\u0000real-world datasets obtained from Weibo and five public datasets show that the\u0000proposed DEK outperforms the existing approaches on the method level. After\u0000clustering, we obtained nine roles and analyzed the characteristics of each\u0000role and their evolution trends under different cyberbullying scenarios. Our\u0000work in this paper can be placed in devices at the edge of the Internet,\u0000leading to better real-time identification performance and adapting to the\u0000broad geographic location and high mobility of mobile devices.","PeriodicalId":501032,"journal":{"name":"arXiv - CS - Social and Information Networks","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141946778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Large-Scale Graphs Community Detection using Spark GraphFrames 使用 Spark GraphFrames 进行大规模图形群落检测

arXiv - CS - Social and Information Networks Pub Date : 2024-08-06 DOI: arxiv-2408.03966

Elena-Simona Apostol, Adrian-Cosmin Cojocaru, Ciprian-Octavian Truică

引用次数: 0

The Dawn of Decentralized Social Media: An Exploration of Bluesky's Public Opening 去中心化社交媒体的黎明：对蓝天公开课的探索

arXiv - CS - Social and Information Networks Pub Date : 2024-08-06 DOI: arxiv-2408.03146

Erfan Samieyan Sahneh, Gianluca Nogara, Matthew R. DeVerna, Nick Liu, Luca Luceri, Filippo Menczer, Francesco Pierri, Silvia Giordano

引用次数: 0

Enhancing Twitter Bot Detection via Multimodal Invariant Representations 通过多模态不变表征加强 Twitter 机器人检测

arXiv - CS - Social and Information Networks Pub Date : 2024-08-06 DOI: arxiv-2408.03096

Jibing Gong, Jiquan Peng, Jin Qu, ShuYing Du, Kaiyu Wang

{"title":"Enhancing Twitter Bot Detection via Multimodal Invariant Representations","authors":"Jibing Gong, Jiquan Peng, Jin Qu, ShuYing Du, Kaiyu Wang","doi":"arxiv-2408.03096","DOIUrl":"https://doi.org/arxiv-2408.03096","url":null,"abstract":"Detecting Twitter Bots is crucial for maintaining the integrity of online\u0000discourse, safeguarding democratic processes, and preventing the spread of\u0000malicious propaganda. However, advanced Twitter Bots today often employ\u0000sophisticated feature manipulation and account farming techniques to blend\u0000seamlessly with genuine user interactions, posing significant challenges to\u0000existing detection models. In response to these challenges, this paper proposes\u0000a novel Twitter Bot Detection framework called BotSAI. This framework enhances\u0000the consistency of multimodal user features, accurately characterizing various\u0000modalities to distinguish between real users and bots. Specifically, the\u0000architecture integrates information from users, textual content, and\u0000heterogeneous network topologies, leveraging customized encoders to obtain\u0000comprehensive user feature representations. The heterogeneous network encoder\u0000efficiently aggregates information from neighboring nodes through oversampling\u0000techniques and local relationship transformers. Subsequently, a multi-channel\u0000representation mechanism maps user representations into invariant and specific\u0000subspaces, enhancing the feature vectors. Finally, a self-attention mechanism\u0000is introduced to integrate and refine the enhanced user representations,\u0000enabling efficient information interaction. Extensive experiments demonstrate\u0000that BotSAI outperforms existing state-of-the-art methods on two major Twitter\u0000Bot Detection benchmarks, exhibiting superior performance. Additionally,\u0000systematic experiments reveal the impact of different social relationships on\u0000detection accuracy, providing novel insights for the identification of social\u0000bots.","PeriodicalId":501032,"journal":{"name":"arXiv - CS - Social and Information Networks","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0