{"title":"Comparing Deep and Machine Learning Models for Sentiment and Emotion Classification from Vaccine #sideffects","authors":"Aditya Dubey, S. Gokhale","doi":"10.1109/ASONAM55673.2022.10068605","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068605","url":null,"abstract":"The accelerated development of Covid-19 vaccines offered tremendous promise and hope, yet stirred significant trepidation and fear. These conflicting emotions motivated many to turn to social media to share their experiences and side effects during the process of getting vaccinated. This paper analyzes sentiment and emotions from tweets collected using the hashtag #sideffects during the early roll out of the Covid-19 vaccine. Each tweet was labeled according to its sentiment polarity (positive vs. negative), and was assigned one of four emotion labels (joy, gratitude, apprehension, and sadness). Exploratory analysis of the tweets through word cloud visualizations revealed that the negativity of emotions intensified with the severity of side effects. Word and numerical features extracted from the text of the tweets and metadata were used to train conventional machine learning and deep learning models. These models resulted in an accuracy of 81% for binary sentiment classification, and 71 % for multi-label emotion identification. The proposed framework, which yielded competitive performance, may be employed to gain insights into people's thoughts and feelings from vaccine-related conversations. These insights can be helpful in devising communication and education strategies to mitigate vaccine hesitancy.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122712828","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}
Robert Chen Bao, Matthew Hancock, C. Kuhlman, Sujith Ravi
{"title":"Using Dominating Sets to Block Contagions in Social Networks","authors":"Robert Chen Bao, Matthew Hancock, C. Kuhlman, Sujith Ravi","doi":"10.1109/ASONAM55673.2022.10068610","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068610","url":null,"abstract":"There are myriad real-life examples of contagion processes on human social networks, e.g., spread of viruses, information, and social unrest. Also, there are many methods to control or block contagion spread. In this work, we introduce a novel method of blocking contagions that uses nodes from dominating sets (DSs). To our knowledge, this is the first use of DS nodes to block contagions. Finding minimum dominating sets of graphs is an NP-Complete problem, so we generalize a well-known heuristic, enabling us to customize its execution. Our method produces a prioritized list of dominating nodes, which is, in turn, a prioritized list of blocking nodes. Thus, for a given network, we compute this list of blocking nodes and we use it to block contagions for all blocking node budgets, contagion seed sets, and parameter values of the contagion model. We report on computational experiments of the blocking efficacy of our approach using two mined networks. We also demonstrate the effectiveness of our approach by comparing blocking results with those from the high degree heuristic, which is a common standard in blocking studies.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125219556","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}
{"title":"Quarantine in Motion: A Graph Learning Framework to Reduce Disease Transmission Without Lockdown","authors":"Sofia Hurtado, R. Marculescu, Justin Drake","doi":"10.1109/ASONAM55673.2022.10068686","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068686","url":null,"abstract":"Exposure notification applications are developed to increase the scale and speed of disease contact tracing. Indeed, by taking advantage of Bluetooth technology, they track the infected population's mobility and then inform close contacts to get tested. In this paper, we ask whether these applications can extend from reactive to preemptive risk management tools? To this end, we propose a new framework that utilizes graph neural networks (GNN) and real-world Foursquare mobility data to predict high risk locations on an hourly basis. As a proof of concept, we then simulate a risk-informed Foursquare population of over 36,000 people in Austin TX after the peak of an outbreak. We find that even after 50% of the population has been infected with COVID-19, they can still maintain their mobility, while reducing the new infections by 13%. Consequently, these results are a first step towards achieving what we call Quarantine in Motion.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"4 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134562621","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}
Simon Hiel, Lore Nicolaers, Carlos Ortega Vázquez, Sandra Mitrovic, B. Baesens, Jochen De Weerdt
{"title":"Evaluation of Joint Modeling Techniques for Node Embedding and Community Detection on Graphs","authors":"Simon Hiel, Lore Nicolaers, Carlos Ortega Vázquez, Sandra Mitrovic, B. Baesens, Jochen De Weerdt","doi":"10.1109/ASONAM55673.2022.10068594","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068594","url":null,"abstract":"Novel joint techniques capture both the microscopic context and the mesoscopic structure of networks by leveraging two previously separated fields of research: node representation learning (NRL) and community detection (CD). However, several limitations exist in the literature. First, a comprehensive comparison between these joint NRL-CD techniques is non-existent. Second, baseline techniques, datasets, evaluation metrics, and classification algorithms differ significantly between each method. Thirdly, the literature lacks a synchronized experimental approach, thus rendering comparison between these methods strenuous. To overcome these limitations, we present a uni-fied experimental setup mutually comparing six joint NRL-CD techniques and comparing them with corresponding NRL/CD baselines in three different settings: non-overlapping and over-lapping CD and node classification. Our results show that joint methods underperform on the node classification task but achieve relatively solid results for overlapping community detection. Our research contribution is two-fold: first, we show specific weaknesses of selected joint techniques in different tasks and data sets; and second, we suggest a more thorough experimental setup to benchmark joint techniques with simpler NRL and CD techniques.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134129846","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}
{"title":"Whole-File Chunk-Based Deduplication Using Reinforcement Learning for Cloud Storage","authors":"Xincheng Yuan, M. Moh, Teng-Sheng Moh","doi":"10.1109/ASONAM55673.2022.10068661","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068661","url":null,"abstract":"Deduplication is the process of removing replicated data content from storage facilities like online databases, cloud datastore, local file systems, etc. It is commonly performed as part of data preprocessing to eliminate redundant data that requires extra storage spaces and computing power and is crucial for data storage management in cloud computing. Deduplication is essential for file backup systems since duplicated files will presumably consume more storage space, especially with a short backup period such as daily. A common technique in this field involves splitting files into chunks whose hashes can be compared using data structures or techniques like clustering. This paper explores the possibility of performing such file chunk deduplication leveraging an innovative reinforcement learning approach to achieve a high deduplication ratio. The proposed system is named SegDup, which achieves 13% higher deduplication ratio than Extreme Binning, a state-of-the art deduplication algorithm.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114962723","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}
{"title":"Stylometric and Semantic Analysis of Demographically Diverse Non-native English Review Data","authors":"Salim Sazzed","doi":"10.1109/ASONAM55673.2022.10068612","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068612","url":null,"abstract":"The demographic knowledge facilitates a fine-grained interpretation of the user-generated review text and enables better decision-making. In this study, we aim to com-prehend how various attributes of non-native English text vary across demographically distinct groups. We introduce a non-native English corpus of around 1150 reviews representing four demographically diverse country-specific groups: Finland, Kenya, Bangladesh, and China. The reviews differ in various contexts, including geography, native language family, race and culture, and English proficiency levels of the reviewers. We then perform stylometric and semantic analysis on these distinct sets of reviews to unveil how the linguistic characteristics differ across the demography. The investigation reveals that stylometric features are mostly similar across the reviews of various groups; nevertheless, dissimilarities are observed in attributes, such as review length, presence of articles, or prepositions. We employ classical machine learning (ML) algorithms and transformer-based fine-tuned language models for categorizing the reviews into distinct demographic groups. We observe that semantic features yield slightly better efficacy than syntactic features for distinguishing the demography-specific reviews.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116303507","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}
S. E. Ayeb, B. Hemery, Fabrice Jeanne, Christophe Charrier, Estelle Cherrier
{"title":"Multigraph transformation for community detection applied to financial services","authors":"S. E. Ayeb, B. Hemery, Fabrice Jeanne, Christophe Charrier, Estelle Cherrier","doi":"10.1109/ASONAM55673.2022.10068607","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068607","url":null,"abstract":"Networks have provided a representation for a wide range of real systems, including communication networks, money transfer networks and biological systems. Communities repre-sent fundamental structures for understanding the organization of real-world networks. Uncovering coherent groups in these networks is the goal of community detection. A community is a mesoscopic structure with nodes heavily connected in their groups by comparison to the nodes in other groups. Commu-nities might also overlap as they may share one or multiple nodes. This paper lays the foundation for an application on transactional multigraphs (networks of financial transactions in which nodes can be linked with multiple edges), through the discovery of communities. Due to their complexity, our goal is to find the most effective way of simplifying multigraphs to weighted graphs, while preserving properties of the network. We tested five weights' calculation function and community detection algorithms were applied. A comparison of the outputs based on extrinsic and intrinsic evaluation metrics is then held.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114634655","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}
{"title":"Impact of Work from Home During the Pandemic in Saudi Arabia","authors":"Omar Hammad, Shivakant Mishra","doi":"10.1109/ASONAM55673.2022.10068624","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068624","url":null,"abstract":"The unprecedented health situation in the year 2020 and to some extent 2021 has forced most businesses to operate online with people working from home (WFH). Like almost all countries in the world, Saudi Arabia has suffered from the shocking unstable health situation facing the COVID-19 pandemic. This study investigates different WFH impressions and behaviors that Saudi employees have built during the pandemic and how that has changed over time. We have conducted surveys in two different phases among Saudi employees that have come from varied personal and job-related demographics, including different gender, marital status, cities, managerial roles, job sectors and company sizes. Our data provides a good comprehensive coverage along different demographics. Key findings includes that for 75% of the people it was a brand new experience especially for big companies employees, people's performance and satisfaction depended on the sector that they work for and their marital status, while life work split was the top challenge and flexibility was the top advantage.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132239911","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}
Narimene Dakiche, K. Benatchba, F. B. Tayeb, Y. Slimani, Mehdi Anis Brahmi
{"title":"A Hybrid Artificial Bee Colony Algorithm with Simulated Annealing for Enhanced Community Detection in Social Networks","authors":"Narimene Dakiche, K. Benatchba, F. B. Tayeb, Y. Slimani, Mehdi Anis Brahmi","doi":"10.1109/ASONAM55673.2022.10068713","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068713","url":null,"abstract":"In this paper, we propose a hybrid Artificial Bee Colony algorithm with Simulated Annealing (ABC-SA) to address the community detection problem. SA enhances the exploitation by searching the most promising regions located by ABC algorithm. Besides, in order to accommodate the characteristics of social networks, we use locus-based adjacency encoding scheme, in which communities are identified as a graph connected components and Pearson's correlation as structural information to guide the solutions' construction. Results obtained on synthetic and real-word networks show that the proposed algorithm can discover communities more successfully in comparison with traditional ABC algorithm and other state-of-the-art algorithms.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123608572","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}
Faezeh Faez, Ali Akhoondian Amiri, M. Baghshah, H. Rabiee
{"title":"DMNP: A Deep Learning Approach for Missing Node Prediction in Partially Observed Graphs","authors":"Faezeh Faez, Ali Akhoondian Amiri, M. Baghshah, H. Rabiee","doi":"10.1109/ASONAM55673.2022.10068642","DOIUrl":"https://doi.org/10.1109/ASONAM55673.2022.10068642","url":null,"abstract":"Missing data is unavoidable in graphs, which can significantly affect the accuracy of downstream tasks. Many methods have been proposed to mitigate missing data in partially observed graphs. Most of these approaches assume they have complete access to graph nodes and only focus on recovering missing links, while in practice a part of the graph nodes can also be out of access. This work presents Deep Missing Node Predictor (DMNP), a novel deep learning-based approach to recovering missing nodes in partly observed graphs. Our proposed approach does not rely on additional information that in many cases does not exist. We compare our model with graph completion and deep graph generation baselines. The experimental results show that the DMNP model outperforms previous state-of-the-art approaches.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129158959","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}