{"title":"Feature extraction and analysis for identifying disruptive events from social media","authors":"Nasser Alsaedi, P. Burnap","doi":"10.1145/2808797.2808867","DOIUrl":"https://doi.org/10.1145/2808797.2808867","url":null,"abstract":"Disruptive event identification is a concept that is crucial to ensuring public safety regarding large-scale events. Recent work on detecting events from social media shows that although these platforms are used for social purposes, they have been emerging as important source of information. Twitter, as a form of social media, is a popular micro-blogging web application serving hundreds of millions of users. User-generated content can be exploited as a rich source of information for identifying `real-world' disruptive events - events that threaten social safety and security, or could cause disruption to social order. In this paper, we present an in-depth comparison of two types of feature that could be useful for identifying disruptive events: temporal and textual features. On the basis of these features, we investigate the dynamics of event/topic identification over time. We make several interesting observations: first, disruptive events are identifiable regardless of the \"influence of the user\" discussing them, and over a variety of topics. Second, temporal features play a central role in event detection and hence should not be disregarded or ignored. Third, textual features can be used to improve the overall performance of the event detection. We believe that these findings provide new insights for gathering information around real-world events, in particular for detecting disruptive events.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"150 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":"129126793","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":"Graph-based term weighting for text categorization","authors":"Fragkiskos D. Malliaros, Konstantinos Skianis","doi":"10.1145/2808797.2808872","DOIUrl":"https://doi.org/10.1145/2808797.2808872","url":null,"abstract":"Text categorization is an important task with plenty of applications, ranging from sentiment analysis to automated news classification. In this paper, we introduce a novel graph-based approach for text categorization. Contrary to the traditional Bag-of-Words model for document representation, we consider a model in which each document is represented by a graph that encodes relationships between the different terms. The importance of a term to a document is indicated using graph-theoretic node centrality criteria. The proposed weighting scheme is able to meaningfully capture the relationships between the terms that co-occur in a document, creating feature vectors that can improve the categorization task. We perform experiments in well-known document collections, applying popular classification algorithms. Our preliminary results indicate that the proposed graph-based weighting mechanism is able to outperform existing frequency-based term weighting criteria, under appropriate parameter setting.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"22 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":"129566989","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":"Investigating the types and effects of missing data in multilayer networks","authors":"Rajesh Sharma, Matteo Magnani, D. Montesi","doi":"10.1145/2808797.2808889","DOIUrl":"https://doi.org/10.1145/2808797.2808889","url":null,"abstract":"A common problem in social network analysis is the presence of missing data. This problem has been extensively investigated in single layer networks, that is, considering one network at a time. However, in multilayer networks, in which a holistic view of multiple networks is taken, the problem has not been specifically studied, and results for single layer networks are reused with no adaptation. In this work, we take an exhaustive and systematic approach to understand the effect of missing data in multilayer networks. Differently from the single layer networks, depending on layer interdependencies, the common network properties can increase or decrease with respect to the properties of the complete network. Another important aspect we observed through our experiments on real datasets is that multilayer network properties like layer correlation and relevance can be used to understand the impact of missing data compared to measuring traditional network measures.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"30 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":"123048437","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":"Weak signals as predictors of real-world phenomena in social media","authors":"C. Charitonidis, A. Rashid, Paul J. Taylor","doi":"10.1145/2808797.2809332","DOIUrl":"https://doi.org/10.1145/2808797.2809332","url":null,"abstract":"Global and national events in recent years have shown that online social media can be a force for good (e.g., Arab Spring) and harm (e.g., the London riots). In both of these examples, social media played a key role in group formation and organization, and in the coordination of the group's subsequent collective actions (i.e., the move from rhetoric to action). Surprisingly, despite its clear importance, little is understood about the factors that lead to this kind of group development and the transition to collective action. This paper focuses on an approach to the analysis of data from social media to detect weak signals, i.e., indicators that initially appear at the fringes, but are, in fact, early indicators of such large-scale real-world phenomena. Our approach is in contrast to existing research which focuses on analysing major themes, i.e., the strong signals, prevalent in a social network at a particular point in time. Analysis of weak signals can provide interesting possibilities for forecasting, with online user-generated content being used to identify and anticipate possible offline future events. We demonstrate our approach through analysis of tweets collected during the London riots in 2011 and use of our weak signals to predict tipping points in that context.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"8 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":"115201161","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}
A. Papaoikonomou, Magdalini Kardara, T. Varvarigou
{"title":"Trust inference in online social networks","authors":"A. Papaoikonomou, Magdalini Kardara, T. Varvarigou","doi":"10.1145/2808797.2809418","DOIUrl":"https://doi.org/10.1145/2808797.2809418","url":null,"abstract":"We study the problem of trust inference in signed social networks, in which, in addition to rating items, users can also indicate their disposition towards each other through directional signed links. We explore the problem in a semi-supervised setting, where given a small fraction of signed edges we classify the remaining edges by leveraging contextual information (i.e. the users' ratings). In order to model user behavior, we use deep learning algorithms i.e. a variation of Restricted Boltzmann machine and Autoencoders for user encoding and edge classification respectively. We evaluate our approach on a large-scale real-world dataset and show that it outperforms state-of-the art methods.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"30 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":"115481607","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":"Birds of a feather flock together: The accidental communities of spammers","authors":"Yehonatan Cohen, Danny Hendler","doi":"10.1145/2808797.2808843","DOIUrl":"https://doi.org/10.1145/2808797.2808843","url":null,"abstract":"Outbound spam email is a serious issue for Email Service Providers (ESPs). If not resolved, or at least sufficiently mitigated, ESPs may incur higher costs and suffer damage to their reputation. In this work, we investigate the early detection of spamming accounts hosted by ESPs. Our study is based on a large real-life data set, consisting of mail logs involving tens of millions of email accounts hosted by a large, well-known, ESP. An analysis of our data set reveals that spammers tend to be clustered in the same communities within the graph induced by inter-account email communication. The reason for this phenomenon is, most likely, that spammers often use the same techniques for harvesting email addresses. As a result, they inadvertently spam each other or spam the same legitimate accounts. We leverage this accidental community structure for devising a highly accurate spammer detector that outperforms previous algorithms by a wide margin.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"10 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131452246","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":"Near linear-time community detection in networks with hardly detectable community structure","authors":"A. Rezaei, Saeed Mahlouji Far, Mahdieh Soleymani","doi":"10.1145/2808797.2808903","DOIUrl":"https://doi.org/10.1145/2808797.2808903","url":null,"abstract":"Identifying communities has always been a fundamental task in analysis of complex networks. Many methods have been devised over the last decade for detection of communities. Amongst them, the label propagation algorithm brings great scalability together with high accuracy. However, it has one major flaw; when the community structure in the network is not clear enough, it will assign every node the same label, thus detecting the whole graph as one giant community. We have addressed this issue by setting a capacity for communities, starting from a small value and gradually increasing it over time. Preliminary results show that not only our extension improves the detection capability of the classic label propagation algorithm when communities are not clearly detectable, but also improves the overall quality of the identified clusters in complex networks with a clear community structure.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"208 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":"131656516","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}
B. R. Sahraei, Haitham Bou-Ammar, K. Tuyls, Gerhard Weiss
{"title":"On the skewed degree distribution of hierarchical networks","authors":"B. R. Sahraei, Haitham Bou-Ammar, K. Tuyls, Gerhard Weiss","doi":"10.1145/2808797.2809409","DOIUrl":"https://doi.org/10.1145/2808797.2809409","url":null,"abstract":"In this paper, a prestige-based evolution process is introduced, which provides a formal framework for the study of linear hierarchies seen in human societies. Due to the deterministic characteristics of the proposed model, we are capable of determining equilibria in closed form. Surprisingly, these stationary points recover the power-law degree distribution as the shared property of the resulting hierarchal networks, explaining the prevalence of hierarchies in societies. This result sheds light on the evolutionary advantages of hierarchies.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"26 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":"131264841","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":"Importance of data mining in healthcare: A survey","authors":"Mohammad Hossein Tekieh, B. Raahemi","doi":"10.1145/2808797.2809367","DOIUrl":"https://doi.org/10.1145/2808797.2809367","url":null,"abstract":"In this survey, we collect the related information that demonstrate the importance of data mining in healthcare. As the amount of collected health data is increasing significantly every day, it is believed that a strong analysis tool that is capable of handling and analyzing large health data is essential. Analyzing the health datasets gathered by electronic health record (EHR) systems, insurance claims, health surveys, and other sources, using data mining techniques is very complex and is faced with very specific challenges, including data quality and privacy issues. However, the applications of data mining in healthcare, advantages of data mining techniques over traditional methods, special characteristics of health data, and new health condition mysteries have made data mining very necessary for health data analysis.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"32 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":"126528593","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":"Combining propensity and influence models for product adoption prediction","authors":"I. Verenich, R. Kikas, M. Dumas, D. Melnikov","doi":"10.1145/2808797.2808851","DOIUrl":"https://doi.org/10.1145/2808797.2808851","url":null,"abstract":"This paper studies the problem of selecting users in an online social network for targeted advertising so as to maximize the adoption of a given product. In previous work, two families of models have been considered to address this problem: direct targeting and network-based targeting. The former approach targets users with the highest propensity to adopt the product, while the latter approach targets users with the highest influence potential - that is users whose adoption is most likely to be followed by subsequent adoptions by peers. This paper proposes a hybrid approach that combines a notion of propensity and a notion of influence into a single utility function. We show that targeting a fixed number of high-utility users results in more adoptions than targeting either highly influential users or users with high propensity.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"54 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":"124290096","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}