{"title":"ClassStrength","authors":"Walid Magdy, M. Eldesouky","doi":"10.1145/3110025.3110162","DOIUrl":"https://doi.org/10.1145/3110025.3110162","url":null,"abstract":"In this paper we present our multilingual tweet classification tool. ClassStrength provides a set of classification models in different languages that classify tweets into 14 general-purpose categories, including: sports, politics, entertainment, comedy, etc. Our classifier uses a distant-supervision approach for creating training data in any available language on Twitter. The classifier uses a soft-classification scheme, where it generates a likelihood score for a tweet to match each of the 14 categories. The initial version of our tool covers five languages, namely: English, Arabic, French, German, and Russian. More languages are to be covered in next releases. The classification model created for each language is generated from hundreds of thousands of training tweets. Our evaluation to the classifier shows superior accuracy compared to standard manual methods. Our reported accuracy is 84% based on crowd preferences over a balanced test set of English tweets covering all 14 classes.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130902207","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":"Ego-centered community detection in directed and weighted networks","authors":"A. O. E. Moctar, Idrissa Sarr","doi":"10.1145/3110025.3121243","DOIUrl":"https://doi.org/10.1145/3110025.3121243","url":null,"abstract":"Community detection is one of the most studied topics in Social Network Analysis. Research in this realm has predominantly focus on finding out communities by considering the network as a whole. That is, all nodes are put in the same pool to define central metrics for finding out communities while ignoring the particularity of some nodes and their impact. Yet, if the position of some nodes matters when defining the metrics (i.e. node centric approach), the found communities may differ and can make more sens in real life situations. For instance, identifying the communities based on drug dealers and their interactions with others sounds better than finding communities while ignoring the individuals status. The purpose of this paper is to detect ego-centered community, which is defined as a community built from a particular node. Our solution is set to combine both link direction and weight, and therefore, differs from many existing solutions. Basically, we rely on a metric called a quality function that uses link properties to assess the cohesion of identified groups. Our method detect communities that reflect not only the structure but the reality regarding to the interaction nature in terms of intensity. We implement our solution and use \"Les Miserables\" dataset to demonstrate the effectiveness of our solution.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"88 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128828300","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":"HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs","authors":"Andrew Stolman, Kevin Matulef","doi":"10.1145/3110025.3119395","DOIUrl":"https://doi.org/10.1145/3110025.3119395","url":null,"abstract":"We introduce HyperHeadTail, a streaming algorithm for estimating the degree distribution of a graph from a stream of edges using very little storage space. Real world graph streams, such as those generated by network traffic or other communication networks, tend to contain repeated elements as well as a temporal nature. Our algorithm handles these situations by extending the HeadTail algorithm of Simpson, Seshadhri, and McGregor [20]. We provide an implementation of HyperHeadTail and demonstrate its utility on both synthetic and real-world data sets. We show that HyperHeadTail offers similar performance to HeadTail, while also providing additional functionality for tracking dynamic graphs that previous algorithms cannot efficiently achieve. We show that with a space usage on the order of 8% of the number of vertices in a graph, we were able to achieve a Relative Hausdorff distance of .27.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133682667","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":"Observe Locally Rank Globally","authors":"A. Saxena, Ralucca Gera, S. Iyengar","doi":"10.1145/3110025.3110063","DOIUrl":"https://doi.org/10.1145/3110025.3110063","url":null,"abstract":"Most real world dynamic networks are evolving very fast with time. It is not feasible to collect the entire network at any given time to study its characteristics. This creates the need to propose local algorithms to study various properties of the network. In the present work, we estimate degree rank of a node without having the entire network. The proposed methods are based on the power law degree distribution characteristic or sampling techniques. We further study the efficiency and feasibility of these approaches in different contexts. The proposed methods are simulated on synthetic networks, as well as on real world social networks. Results show that the degree rank of a node can be estimated with high accuracy using only 1% samples of the network size. The accuracy of the estimation decreases from high ranked to low ranked nodes.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134521074","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":"Towards Diversified Local Users Identification Using Location Based Social Networks","authors":"Chao Huang, Dong Wang, Shenglong Zhu","doi":"10.1145/3110025.3110159","DOIUrl":"https://doi.org/10.1145/3110025.3110159","url":null,"abstract":"Identifying a set of diversified users who are local residents in a city is an important task for a wide spectrum of applications such as target ads of local business, surveys and interviews, and personalized recommendations. While many previous studies have investigated the problem of identifying the local users in a given area using online social network information (e.g., geotagged posts), few methods have been developed to solve the diversified user identification problem. In this paper, we propose a new analytical framework, Diversified Local Users Finder (DLUF), to accurately identify a set of diversified local users using a principled approach. In particular, the DLUF scheme first defines a new distance metric that measures the diversity between local users from physical dimension. The DLUF scheme then provides a solution to find the set of local users with maximum diversity. The performance of DLUF scheme is compared to several representative baselines using two real world datasets obtained from Foursquare application. We observe that the DLUF scheme accurately identifies the local users with a great diversity and significantly outperforms the compared baselines.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128033253","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":"Social Network Based Anomaly Detection of Organizational Behavior using Temporal Pattern Mining","authors":"Ze Li, Duoyong Sun, Feng Xu, Bo Li","doi":"10.1145/3110025.3116200","DOIUrl":"https://doi.org/10.1145/3110025.3116200","url":null,"abstract":"The interaction between members within an organization evolves continuously and drives the organizational behavior to change over time. To understand the temporal behaviors of the organization and recognize the evolving characteristics of the networks, we need effective tools that can capture evolution of the objects. In this paper, we propose a novel and important problem in evolution behavior discovery. Given a series of snapshots of a temporal dataset, which are modeled as evolving social networks, our goal is to find networks which evolve in a dramatically different way that deviate from temporal pattern norm. We define such objects as organizational behavior anomalies. It is a challenging problem as temporal patterns are hidden deeply in noisy evolving datasets and thus it is difficult to distinguish anomalous objects from normal ones. To this end, we propose a social network based temporal pattern mining framework to detect organizational behavior anomalies. Specifically, we first give the definition and a brief description of organizational behavior anomalies. Then, we extract a number of features in the temporal dataset for profiling organizational networks. Third, we use the temporal pattern mining framework to evaluate anomalies of networks deviating from the normal evolutionary patterns. Within the proposed framework, a two-step procedure that exploits the strengths of unsupervised anomaly detection and supervised classification is used. Experimental results on two real-world datasets show that the proposed framework is highly effective in discovering interesting organizational behavior anomalies.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128093560","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":"Automatic Construction of an Emoji Sentiment Lexicon","authors":"Mayu Kimura, Marie Katsurai","doi":"10.1145/3110025.3110139","DOIUrl":"https://doi.org/10.1145/3110025.3110139","url":null,"abstract":"Emojis have been frequently used to express users' sentiments, emotions, and feelings in text-based communication. To facilitate sentiment analysis of users' posts, an emoji sentiment lexicon with positive, neutral, and negative scores has been recently constructed using manually labeled tweets. However, the number of emojis listed in the lexicon is smaller than that of currently existing emojis, and expanding the lexicon manually requires time and effort to reconstruct the labeled dataset. This paper presents a simple and efficient method for automatically constructing an emoji sentiment lexicon with arbitrary sentiment categories. The proposed method extracts sentiment words from WordNet-Affect and calculates the cooccurrence frequency between the sentiment words and each emoji. Based on the ratio of the number of occurrences of each emoji among the sentiment categories, each emoji is assigned a multidimensional vector whose elements indicate the strength of the corresponding sentiment. In experiments conducted on a collection of tweets, we show a high correlation between the conventional lexicon and our lexicon for three sentiment categories. We also show the results for a new lexicon constructed with additional sentiment categories.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127297402","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":"EmotionSensing: Predicting Mobile User Emotion","authors":"M. Roshanaei, Richard O. Han, Shivakant Mishra","doi":"10.1145/3110025.3110127","DOIUrl":"https://doi.org/10.1145/3110025.3110127","url":null,"abstract":"User emotions are important contextual features in building context-aware pervasive applications. In this paper, we explore the question of whether it is possible to predict user emotions from their smartphone activities. To get the ground truth data, we have built an Android app that collects user emotions along with a number of features including their current location, activity they are engaged in, and smartphones apps they are currently running. We deployed this app for over a period of three months and collected a large amount of useful user data. We describe the details of this data in terms of statistics and user behaviors, provide a detailed analysis in terms of correlations between user emotions and other features, and finally build classifiers to predict user emotions. Performance of these classifiers is quite promising with high accuracy. We describe the details of these classifiers along with the results.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123008205","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}
D. Malikireddy, M. Jens, Amarette Filut, Anupama Bhattacharya, Elizabeth L. Pier, You Geon Lee, M. Carnes, A. Kaatz
{"title":"Network analysis of NIH grant critiques","authors":"D. Malikireddy, M. Jens, Amarette Filut, Anupama Bhattacharya, Elizabeth L. Pier, You Geon Lee, M. Carnes, A. Kaatz","doi":"10.1145/3110025.3116212","DOIUrl":"https://doi.org/10.1145/3110025.3116212","url":null,"abstract":"Network analysis has widespread applications for studying many social phenomena. Our research is focused on investigating why highly qualified women and racial/ethnic minorities tend to fare worse in peer review processes, such as for scientific grants, which limits their participation in research careers. Our prior work shows that gender and racial bias can be detected in reviewers' narrative critiques, but our work has yet to harness the power of varied learning algorithms for text analysis. To this end, we show preliminary evidence of the usefulness of network algorithms to study reviewers' written critiques of grant applications submitted to the U.S. National Institutes of Health (NIH). We construct word co-occurrence networks and show that network measures vary by applicant sex.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116331349","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}
Ema Kusen, Mark Strembeck, Giuseppe Cascavilla, M. Conti
{"title":"On the Influence of Emotional Valence Shifts on the Spread of Information in Social Networks","authors":"Ema Kusen, Mark Strembeck, Giuseppe Cascavilla, M. Conti","doi":"10.1145/3110025.3110031","DOIUrl":"https://doi.org/10.1145/3110025.3110031","url":null,"abstract":"In this paper, we present a study on 4.4 million Twitter messages related to 24 systematically chosen real-world events. For each of the 4.4 million tweets, we first extracted sentiment scores based on the eight basic emotions according to Plutchik's wheel of emotions. Subsequently, we investigated the effects of shifts in the emotional valence on the spread of information. We found that in general OSN users tend to conform to the emotional valence of the respective real-world event. However, we also found empirical evidence that prospectively negative real-world events exhibit a significant amount of shifted emotions in the corresponding tweets (i.e. positive messages). To explain this finding, we use the theory of social connection and emotional contagion. To the best of our knowledge, this is the first study that provides empirical evidence for the undoing hypothesis in online social networks (OSNs). The undoing hypothesis postulates that positive emotions serve as an antidote during negative events.","PeriodicalId":399660,"journal":{"name":"Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124018833","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}