{"title":"A Tempest in a Teacup? Analyzing firestorms on Twitter","authors":"Hemank Lamba, M. Malik, J. Pfeffer","doi":"10.1145/2808797.2808828","DOIUrl":"https://doi.org/10.1145/2808797.2808828","url":null,"abstract":"`Firestorms,' sudden bursts of negative attention in cases of controversy and outrage, are seemingly widespread on Twitter and are an increasing source of fascination and anxiety in the corporate, governmental, and public spheres. Using media mentions, we collect 80 candidate events from January 2011 to September 2014 that we would term `firestorms.' Using data from the Twitter decahose (or gardenhose), a 10% random sample of all tweets, we describe the size and longevity of these firestorms. We take two firestorm exemplars, #myNYPD and #CancelColbert, as case studies to describe more fully. Then, taking the 20 firestorms with the most tweets, we look at the change in mention networks of participants over the course of the firestorm as one method of testing for possible impacts of firestorms. We find that the mention networks before and after the firestorms are more similar to each other than to those of the firestorms, suggesting that firestorms neither emerge from existing networks, nor do they result in lasting changes to social structure. To verify this, we randomly sample users and generate mention networks for baseline comparison, and find that the firestorms are not associated with a greater than random amount of change in mention networks.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116455376","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}
Mark Kibanov, M. Atzmüller, Jens Illig, Christoph Scholz, A. Barrat, C. Cattuto, Gerd Stumme
{"title":"Is web content a good proxy for real-life interaction? A case study considering online and offline interactions of computer scientists","authors":"Mark Kibanov, M. Atzmüller, Jens Illig, Christoph Scholz, A. Barrat, C. Cattuto, Gerd Stumme","doi":"10.1145/2808797.2810060","DOIUrl":"https://doi.org/10.1145/2808797.2810060","url":null,"abstract":"Today, many people spend a lot of time online. Their social interactions captured in online social networks are an important part of the overall personal social profile, in addition to interactions taking place offline. This paper investigates whether relations captured by online social networks can be used as a proxy for the relations in offline social networks, such as networks of human face-to-face (F2F) proximity and coauthorship networks. Particularly, the paper focuses on interactions of computer scientists in online settings (homepages, social networks profiles and connections) and offline settings (scientific collaboration, face-to-face communications during the conferences). We focus on quantitative studies and investigate the structural similarities and correlations of the induced networks; in addition, we analyze implications between networks. Finally, we provide a qualitative user analysis to find characteristics of good and bad proxies.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130798035","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":"Influence of the null-model on motif detection","authors":"W. Schlauch, K. Zweig","doi":"10.1145/2808797.2809400","DOIUrl":"https://doi.org/10.1145/2808797.2809400","url":null,"abstract":"This paper focuses on the suitability of three different null-models to motif analysis that all get as an input a desired degree sequence. A graph theoretic null-model is defined as a set of graphs together with a probability function. Here we discuss the configuration model, as the simplest model; a variant of the configuration model where multi-edges are deleted; and the set of all graphs with a given degree sequence (FDSM), that most scientists would recommend to use but that has the disadvantage of a high time-complexity to sample from it. Furthermore, we develop equations for the expected number of motifs in the FDSM, based on the degree sequence and the assumption of simple independence. We present the motif count for several real-world graphs and compare them with the sampled average number of these motif counts in the different null-models. We check with a Kolmogorov-Smirnow two-sample test whether the samples originated from the same distribution. It can then be shown that the motif counts in the configuration model do not coincide with those of the FDSM. The equations are a good enough approximation of the motif count in generated graphs based on a prescribed degree sequence.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114098294","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}
Pravallika Devineni, Danai Koutra, M. Faloutsos, C. Faloutsos
{"title":"If walls could talk: Patterns and anomalies in Facebook wallposts","authors":"Pravallika Devineni, Danai Koutra, M. Faloutsos, C. Faloutsos","doi":"10.1145/2808797.2808880","DOIUrl":"https://doi.org/10.1145/2808797.2808880","url":null,"abstract":"How do people interact with their Facebook wall? At a high level, this question captures the essence of our work. While most prior efforts focus on Twitter, the much fewer Facebook studies focus on the friendship graph or are limited by the amount of users or the duration of the study. In this work, we model Facebook user behavior: we analyze the wall activities of users focusing on identifying common patterns and surprising phenomena. We conduct an extensive study of roughly 7K users over three years during four month intervals each year. We propose PowerWall, a lesser known heavy-tailed distribution to fit our data. Our key results can be summarized in the following points. First, we find that many wall activities, including number of posts, number of likes, number of posts of type photo, etc., can be described by the PowerWall distribution. What is more surprising is that most of these distributions have similar slope, with a value close to 1! Second, we show how our patterns and metrics can help us spot surprising behaviors and anomalies. For example, we find a user posting every two days, exactly the same count of posts; another user posting at midnight, with no other activity before or after. Our work provides a solid step towards a systematic and quantitative wall-centric profiling of Facebook user activity.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114292558","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":"Information extraction of regulatory enforcement actions: From anti-money laundering compliance to countering terrorism finance","authors":"Vassilis Plachouras, Jochen L. Leidner","doi":"10.1145/2808797.2809368","DOIUrl":"https://doi.org/10.1145/2808797.2809368","url":null,"abstract":"Financial fines imposed by regulatory bodies to penalize illegal activities and violations against regulations (cases of non-compliance) have recently become more common, and the sizes of fines have increased. This development coincides with the ongoing increase of complexity of regulatory rules. Huge fines have been imposed on banks for financial fraud and regulations have been made more stringent after 9/11 to curb funding of terrorist groups. Market players would also like to have available a database of fine events for a range of applications, such as to benchmark their competitors performance, or to use it as an early warning system for detecting shifts in regulators' enforcement behavior. To this end, we introduce the task of extracting fines from regulatory enforcement actions and we present a method to extract such fine event instances from timeline-like descriptions of regulatory investigation activities authored by legal professionals for a commercial product. We evaluate how well a rule-based method can extract information about fine events and we compare its performance to a machine-learning baseline. To the best of our knowledge, this work is the first one addressing this task.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128310439","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":"Multi-state open opinion model based on positive and negative social influences","authors":"Yuan-Chang Chen, Hao-Shang Ma, Jen-Wei Huang","doi":"10.1145/2808797.2808901","DOIUrl":"https://doi.org/10.1145/2808797.2808901","url":null,"abstract":"Since the tremendous success of social networking websites, the related analytical research has been widely studied. Among these studies, social influence has been a significant and popular topic. We rely on the social influence model to predict and learn the influence diffusion process. However, traditional models only categorize nodes into two types of states, active and inactive. In addition, most previous models have only taken positive influences into account. Moreover, if inactive nodes are influenced successfully and turn into active nodes, these nodes cannot change their states forever. In this work, we not only break the above limitations but also propose a novel propagation method in our model. We proposes five states to represent the multiple states of influence. According to the new propagation method, the strength of the social influence may be reduced over time. Eventually, we utilize the measurement of precisions to compare with related models. The proposed multi-state model outperforms other two-state models in precisions of prediction. The experimental results show the superiority of multiple states.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133712044","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}
Ioanna K. Lekea, P. Karampelas, Konstantinos F. Xylogiannopoulos, R. Alhajj
{"title":"Tactics, weapons, targets and rationale behind the actions of the mostly operational terrorist groups across Europe","authors":"Ioanna K. Lekea, P. Karampelas, Konstantinos F. Xylogiannopoulos, R. Alhajj","doi":"10.1145/2808797.2809314","DOIUrl":"https://doi.org/10.1145/2808797.2809314","url":null,"abstract":"This paper discusses the practices employed by various terrorist groups that operated in European countries between the years of 1968 and 2009. We focus on the deployment of the terrorist operations as presented in the RAND Database of Worldwide Terrorism Activities. In this context we elaborate on the tactics of the terrorist groups with the highest frequency of actions that operated in the European countries showing the highest rate of terrorist activity. Their targets, the weapons used and the consequences suffered as a result of their actions (both fatalities and injuries intended for the original targets, as well as any kind of collateral damage caused to third parties) are analyzed, in order to evaluate their ideological and - perhaps - ethical standing. In particular, we look at the groups' targets as well as the tactics they used to achieve them, in a bid to explore whether there is a correlation between targeting of specific people or groups of people or other types of targets with certain international events - and if so, how these events influenced the actions of the terrorists. Within this line of thought, we also provide an outline of the political and ideological framework of the groups on focus in an effort to place them within the general historical and political context during their operational years. This is of great importance, as it enables us to run a comparison between terrorist groups that operated in different countries (albeit with similar aims) both from an ideological and operational viewpoint.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126081937","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":"Phonetic normalization of microtext","authors":"R. Khoury","doi":"10.1145/2808797.2809352","DOIUrl":"https://doi.org/10.1145/2808797.2809352","url":null,"abstract":"Microtext normalization is the challenge of discovering the English words corresponding to the unusually-spelled words used in social-media messages and posts. In this paper, we propose a novel method for doing this by rendering both English and microtext words phonetically based on their spelling, and matching similar ones together. We present our algorithm to learn spelling-to-phonetic probabilities and to efficiently search the English language and match words together. Our results demonstrate that our system correctly handles many types of normalization problems.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130406212","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":"Community detection in social network with pairwisely constrained symmetric non-negative matrix factorization","authors":"Xiaohua Shi, Hongtao Lu, Yangcheng He, Shan He","doi":"10.1145/2808797.2809383","DOIUrl":"https://doi.org/10.1145/2808797.2809383","url":null,"abstract":"Non-negative Matrix Factorization (NMF) aims to find two non-negative matrices whose product approximates the original matrix well, and is widely used in clustering condition with good physical interpretability and universal applicability. Detecting communities with NMF can keep non-negative network physical definition and effectively capture communities-based structure in the low dimensional data space. However some NMF methods in community detection did not concern with more network inner structures or existing ground-truth community information. In this paper, we propose a novel pairwisely constrained non-negative symmetric matrix factorization (PCSNMF) method, which not only consider symmetric community structures of undirected network, but also takes into consideration the pairwise constraints generated from some ground-truth group information to enhance the community detection. We compare our approaches with other NMF-based methods in three social networks, and experimental results for community detection show that our approaches are all feasible and achieve better community detection results.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127154860","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":"Network vs market relations: The effect of friends in crowdfunding","authors":"Emőke-Ágnes Horvát, Jayaram Uparna, Brian Uzzi","doi":"10.1145/2808797.2808904","DOIUrl":"https://doi.org/10.1145/2808797.2808904","url":null,"abstract":"Crowds offer a new form of efficacious collective decision making, yet knowledge about the mechanisms by which they achieve superior outcomes remains nascent. It has been suggested that crowds work best with market-like relationships when individuals make independent decisions and possess dissimilar information. By contrast, sociological discussions of markets argue that risky decisions are mitigated by network relations that embed economic transactions in social ties that promote trustworthiness and reciprocity. To investigate the role of networks within crowds and their performance effects, we examined the complete record of financial lending decisions on Prosper.com, 1/2006-3/2012, the first U.S. crowdfunding platform and a chief gateway to capital for entrepreneurs and general borrowers that continues to disrupt conventional financial lending structures infusing more than $5.1 billion into the market in 2013. Our study reveals how reciprocity, recurring borrower-lender dyads, and persistent co-lending underpin the dynamics of network lending. Further, we show how network ties influence the evolution of the lending behavior. We find that in the early stage of fundraising, network relations provide larger proportions of loans, typically lending four times more per bid than strangers. They also respond to loan requests on average 59.5% sooner than strangers. The size of the first loan and the time to lending also tend to prompt lending by strangers, suggesting that network relations might move the market, a finding that persists even as fewer lenders dominate more of the market for loans on Prosper. Finally, network relations are associated with greater engagement: when the first loan is underwritten by a friend, 50% of the remaining loans come from friends as well.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129114638","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}