ACM Transactions on the Web最新文献

{"title":"Reinforced MOOCs Concept Recommendation in Heterogeneous Information Networks","authors":"Jibing Gong, Yao Wan, Ye Liu, Xuewen Li, Yi Zhao, Cheng Wang, Yuting Lin, Xiaohan Fang, Wenzheng Feng, Jingyi Zhang, Jie Tang","doi":"10.1145/3580510","DOIUrl":"https://doi.org/10.1145/3580510","url":null,"abstract":"Massive open online courses (MOOCs) , which offer open access and widespread interactive participation through the internet, are quickly becoming the preferred method for online and remote learning. Several MOOC platforms offer the service of course recommendation to users, to improve the learning experience of users. Despite the usefulness of this service, we consider that recommending courses to users directly may neglect their varying degrees of expertise. To mitigate this gap, we examine an interesting problem of concept recommendation in this paper, which can be viewed as recommending knowledge to users in a fine-grained way. We put forward a novel approach, termed HinCRec-RL, for C oncept Rec ommendation in MOOCs, which is based on H eterogeneous I nformation N etworks and R einforcement L earning . In particular, we propose to shape the problem of concept recommendation within a reinforcement learning framework to characterize the dynamic interaction between users and knowledge concepts in MOOCs. Furthermore, we propose to form the interactions among users, courses, videos, and concepts into a heterogeneous information network (HIN) to learn the semantic user representations better. We then employ an attentional graph neural network to represent the users in the HIN, based on meta-paths. Extensive experiments are conducted on a real-world dataset collected from a Chinese MOOC platform, XuetangX , to validate the efficacy of our proposed HinCRec-RL. Experimental results and analysis demonstrate that our proposed HinCRec-RL performs well when compared with several state-of-the-art models.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135288114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Heterogeneous Graph Transformer for Meta-structure Learning with Application in Text Classification","authors":"Shuhai Wang, Xin Liu, Xiao Pan, Hanjie Xu, Mingrui Liu","doi":"https://dl.acm.org/doi/10.1145/3580508","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3580508","url":null,"abstract":"<p>The prevalent heterogeneous Graph Neural Network (GNN) models learn node and graph representations using pre-defined meta-paths or only automatically discovering meta-paths. However, the existing methods suffer from information loss due to neglecting undiscovered meta-structures with richer semantics than meta-paths in heterogeneous graphs. To take advantage of the current rich meta-structures in heterogeneous graphs, we propose a novel approach called HeGTM to automatically extract essential meta-structures (i.e., meta-paths and meta-graphs) from heterogeneous graphs. The discovered meta-structures can capture more prosperous relations between different types of nodes that can help the model to learn representations. Furthermore, we apply the proposed approach for text classification. Specifically, we first design a heterogeneous graph for the text corpus, and then apply HeGTM on the constructed text graph to learn better text representations that contain various semantic relations. In addition, our approach can also be used as a strong meta-structure extractor for other GNN models. In other words, the auto-discovered meta-structures can replace the pre-defined meta-paths. The experimental results on text classification demonstrate the effectiveness of our approach to automatically extracting informative meta-structures from heterogeneous graphs and its usefulness in acting as a meta-structure extractor for boosting other GNN models.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"15 1","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138516945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Introduction to the Special Issue on Advanced Graph Mining on the Web: Theory, Algorithms, and Applications: Part 1","authors":"Hao Peng, Jian Yang, Jia Wu, Philip S. Yu","doi":"https://dl.acm.org/doi/10.1145/3579360","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3579360","url":null,"abstract":"<p>No abstract available.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 14","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Introduction to the Special Issue on Advanced Graph Mining on the Web: Theory, Algorithms, and Applications: Part 1","authors":"Hao Peng, Jian Yang, Jia Wu, Philip S. Yu","doi":"10.1145/3579360","DOIUrl":"https://doi.org/10.1145/3579360","url":null,"abstract":"We are delighted to present this special issue on Advanced Graph Mining on the Web: Theory, Algorithms, and Applications. Graph mining plays an important role in data mining on the Web. It can take full advantage of the growing and easily accessible big data resources on the Web, such as rich semantic information in social media and complex associations between users in online social networks, which is crucial for the development of systems and applications such as event detection, social bot detection, and intelligent recommendation. However, extracting valuable and representative information from Web graph data is still a great challenge and requires research and development on advanced techniques. The purpose of this special issue is to provide a forum for researchers and practitioners to present their latest research findings and engineering experiences in the theoretical foundations, empirical studies, and novel applications of Graph Mining. This special issue consists of two parts. In Part 1, the guest editors selected 10 contributions that cover varying topics within this theme, ranging from reinforced and self-supervised GNN architecture search framework to the streaming growth algorithm of bipartite graphs. Yang et al. in “RoSGAS: Adaptive Social Bot Detection with Reinforced Self-supervised GNN Architecture Search” proposed a novel Reinforced and Self-supervised GNN Architecture Search framework named RoSGAS, which gains improvement in terms of accuracy, training efficiency, and stability. And has better generalization when handling unseen samples. Du et al. in “Niffler: Real-time Device-level Anomalies Detection in Smart Home” proposed a novel notion—a correlated graph, and with the aid of that, they developed a system to detect misbehaving devices without modifying the existing system, which is crucial for the device-level security in the smart home system. And then they further proposed a linkage path model and a sensitivity ranking method to assist in detecting the abnormalities. Sun et al. in “GroupAligner: A Deep Reinforcement Learning with Domain Adaptation for Social Group Alignment” presented a novel GroupAligner, a deep reinforcement learning with domain adaptation for social group alignment, which solves the problems of feature inconsistency across different social networks and group discovery within a social network in social group alignment. Zhu et al. in “A Multi-task Graph Neural Network with Variational Graph Auto-encoders for Session-based Travel Packages Recommendation” proposed a novel session-based model named STR-VGAE, which provides robust attributes’ representations and takes the effects of historical sessions for the current session into consideration. The model obtained promising results in the session-based recommendation, and can fill subtasks of the travel packages recommendation and variational graph auto-encoders simultaneously.","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"17 1","pages":"1 - 2"},"PeriodicalIF":3.5,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46038205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Reinforced MOOCs Concept Recommendation in Heterogeneous Information Networks","authors":"Jibing Gong, Yao Wan, Ye Liu, Xuewen Li, Yi Zhao, Cheng Wang, Yuting Lin, Xiaohan Fang, Wenzheng Feng, Jingyi Zhang, Jie Tang","doi":"https://dl.acm.org/doi/10.1145/3580510","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3580510","url":null,"abstract":"<p><b>Massive open online courses (MOOCs)</b>, which offer open access and widespread interactive participation through the internet, are quickly becoming the preferred method for online and remote learning. Several MOOC platforms offer the service of course recommendation to users, to improve the learning experience of users. Despite the usefulness of this service, we consider that recommending courses to users directly may neglect their varying degrees of expertise. To mitigate this gap, we examine an interesting problem of concept recommendation in this paper, which can be viewed as recommending knowledge to users in a fine-grained way. We put forward a novel approach, termed <b>HinCRec-RL, for <underline>C</underline>oncept <underline>Rec</underline>ommendation in MOOCs, which is based on <underline>H</underline>eterogeneous <underline>I</underline>nformation <underline>N</underline>etworks and <underline>R</underline>einforcement <underline>L</underline>earning</b>. In particular, we propose to shape the problem of concept recommendation within a reinforcement learning framework to characterize the dynamic interaction between users and knowledge concepts in MOOCs. Furthermore, we propose to form the interactions among users, courses, videos, and concepts into a <b>heterogeneous information network (HIN)</b> to learn the semantic user representations better. We then employ an attentional graph neural network to represent the users in the HIN, based on meta-paths. Extensive experiments are conducted on a real-world dataset collected from a Chinese MOOC platform, <i>XuetangX</i>, to validate the efficacy of our proposed HinCRec-RL. Experimental results and analysis demonstrate that our proposed HinCRec-RL performs well when compared with several state-of-the-art models.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 20","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Constructing Spatio-Temporal Graphs for Face Forgery Detection","authors":"Zhihua Shang, Hongtao Xie, Lingyun Yu, Zhengjun Zha, Yongdong Zhang","doi":"https://dl.acm.org/doi/10.1145/3580512","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3580512","url":null,"abstract":"<p>Recently, advanced development of facial manipulation techniques threatens web information security, thus, face forgery detection attracts a lot of attention. It is clear that both spatial and temporal information of facial videos contains the crucial manipulation traces, which are inevitably created during the generation process. However, most existing face forgery detectors only focus on the spatial artifacts or the temporal incoherence, and they are struggling to learn a significant and general kind of representations for manipulated facial videos. In this work, we propose to construct spatial-temporal graphs for fake videos to capture the spatial inconsistency and the temporal incoherence at the same time. To model the spatial-temporal relationship among the graph nodes, a novel forgery detector named Spatio-Temporal Graph Network (STGN) is proposed, which contains two kinds of graph-convolution-based units, the Spatial Relation Graph Unit (SRGU) and the Temporal Attention Graph Unit (TAGU). To exploit spatial information, the SRGU models the inconsistency between each pair of patches in the same frame, instead of focusing on the low-level local spatial artifacts which are vulnerable to samples created by unseen manipulation methods. And, the TAGU is proposed to model the long-distance temporal relation among the patches at the same spatial position in different frames with a graph attention mechanism based on the inter-node similarity. With the SRGU and the TAGU, our STGN can combine the discriminative power of spatial inconsistency and the generalization capacity of temporal incoherence for face forgery detection. Our STGN achieves state-of-the-art performances on several popular forgery detection datasets. Extensive experiments demonstrate both the superiority of our STGN on intra manipulation evaluation and the effectiveness for new sorts of face forgery videos on cross manipulation evaluation.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 21","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Graph Attention Network for Text Classification and Detection of Mental Disorder","authors":"Usman Ahmed, Jerry Chun-Wei Lin, Gautam Srivastava","doi":"https://dl.acm.org/doi/10.1145/3572406","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3572406","url":null,"abstract":"<p>A serious issue in today’s society is Depression, which can have a devastating impact on a person’s ability to cope in daily life. Numerous studies have examined the use of data generated directly from users using social media to diagnose and detect Depression as a mental illness. Therefore, this paper investigates the language used in individuals’ personal expressions to identify depressive symptoms via social media. Graph Attention Networks (GATs) are used in this study as a solution to the problems associated with text classification of depression. These GATs can be constructed using masked self-attention layers. Rather than requiring expensive matrix operations such as similarity or knowledge of network architecture, this study implicitly assigns weights to each node in a neighbourhood. This is possible because nodes and words can carry properties and sentiments of their neighbours. Another aspect of the study that contributed to the expansion of the emotion lexicon was the use of hypernyms. As a result, our method performs better when applied to data from the Reddit subreddit Depression. Our experiments show that the emotion lexicon constructed by using the Graph Attention Network ROC achieves 0.91 while remaining simple and interpretable.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 18","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Type Information Utilized Event Detection via Multi-Channel GNNs in Electrical Power Systems","authors":"Qian Li, Jianxin Li, Lihong Wang, Cheng Ji, Yiming Hei, Jiawei Sheng, Qingyun Sun, Shan Xue, Pengtao Xie","doi":"https://dl.acm.org/doi/10.1145/3577031","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3577031","url":null,"abstract":"<p>Event detection in power systems aims to identify triggers and event types, which helps relevant personnel respond to emergencies promptly and facilitates the optimization of power supply strategies. However, the limited length of short electrical record texts causes severe information sparsity, and numerous domain-specific terminologies of power systems makes it difficult to transfer knowledge from language models pre-trained on general-domain texts. Traditional event detection approaches primarily focus on the general domain and ignore these two problems in the power system domain. To address the above issues, we propose a <b>Multi-Channel graph neural network utilizing Type information for Event Detection</b> in power systems, named <b>MC-TED</b>, leveraging a semantic channel and a topological channel to enrich information interaction from short texts. Concretely, the semantic channel refines textual representations with semantic similarity, building the semantic information interaction among potential event-related words. The topological channel generates a relation-type-aware graph modeling word dependencies, and a word-type-aware graph integrating part-of-speech tags. To further reduce errors worsened by professional terminologies in type analysis, a type learning mechanism is designed for updating the representations of both the word type and relation type in the topological channel. In this way, the information sparsity and professional term occurrence problems can be alleviated by enabling interaction between topological and semantic information. Furthermore, to address the lack of labeled data in power systems, we built a Chinese event detection dataset based on electrical Power Event texts, named <b>PoE</b>. In experiments, our model achieves compelling results not only on the PoE dataset, but on general-domain event detection datasets including ACE 2005 and MAVEN.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 19","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"RoSGAS: Adaptive Social Bot Detection with Reinforced Self-supervised GNN Architecture Search","authors":"Yingguang Yang, Renyu Yang, Yangyang Li, Kai Cui, Zhiqin Yang, Yue Wang, Jie Xu, Haiyong Xie","doi":"https://dl.acm.org/doi/10.1145/3572403","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3572403","url":null,"abstract":"<p>Social bots are referred to as the automated accounts on social networks that make attempts to behave like humans. While Graph Neural Networks (GNNs) have been massively applied to the field of social bot detection, a huge amount of domain expertise and prior knowledge is heavily engaged in the state-of-the-art approaches to design a dedicated neural network architecture for a specific classification task. Involving oversized nodes and network layers in the model design, however, usually causes the over-smoothing problem and the lack of embedding discrimination. In this article, we propose <span>RoSGAS</span>, a novel <underline>R</underline>einf<underline>o</underline>rced and <underline>S</underline>elf-supervised <underline>G</underline>NN <underline>A</underline>rchitecture <underline>S</underline>earch framework to adaptively pinpoint the most suitable multi-hop neighborhood and the number of layers in the GNN architecture. More specifically, we consider the social bot detection problem as a user-centric subgraph embedding and classification task. We exploit the heterogeneous information network to present the user connectivity by leveraging account metadata, relationships, behavioral features, and content features. <span>RoSGAS</span> uses a multi-agent deep reinforcement learning (RL), 31 pages. mechanism for navigating the search of optimal neighborhood and network layers to learn individually the subgraph embedding for each target user. A nearest neighbor mechanism is developed for accelerating the RL training process, and <span>RoSGAS</span> can learn more discriminative subgraph embedding with the aid of self-supervised learning. Experiments on five Twitter datasets show that <span>RoSGAS</span> outperforms the state-of-the-art approaches in terms of accuracy, training efficiency, and stability and has better generalization when handling unseen samples.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 15","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"sGrow: Explaining the Scale-Invariant Strength Assortativity of Streaming Butterflies","authors":"Aida Sheshbolouki, M. Tamer Özsu","doi":"https://dl.acm.org/doi/10.1145/3572408","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3572408","url":null,"abstract":"<p>Bipartite graphs are rich data structures with prevalent applications and characteristic structural features. However, less is known about their growth patterns, particularly in streaming settings. Current works study the patterns of static or aggregated temporal graphs optimized for certain downstream analytics or ignoring multipartite/non-stationary data distributions, emergence patterns of subgraphs, and streaming paradigms. To address these, we perform statistical network analysis over web log streams and identify the governing patterns underlying the bursty emergence of mesoscopic building blocks, 2, 2-bicliques, leading to a phenomenon that we call <i>scale-invariant strength assortativity of streaming butterflies</i>. We provide the graph-theoretic explanation of this phenomenon. We further introduce a set of micro-mechanics in the body of a streaming growth algorithm, <i>sGrow</i>, to pinpoint the generative origins. <i>sGrow</i> supports streaming paradigms, emergence of four-vertex graphlets, and provides user-specified configurations for the scale, burstiness, level of strength assortativity, probability of out-of-order records, generation time, and time-sensitive connections. Comprehensive evaluations on pattern reproducing and stress testing validate the effectiveness, efficiency, and robustness of <i>sGrow</i> in realization of the observed patterns independent of initial conditions, scale, temporal characteristics, and model configurations. Theoretical and experimental analysis verify <i>sGrow</i>’s robustness in generating streaming graphs based on user-specified configurations that affect the scale and burstiness of the stream, level of strength assortativity, probability of out-of-order streaming records, generation time, and time-sensitive connections.</p>","PeriodicalId":50940,"journal":{"name":"ACM Transactions on the Web","volume":"43 22","pages":""},"PeriodicalIF":3.5,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138495138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}