Mehdi Kaytoue-Uberall, Y. Pitarch, M. Plantevit, C. Robardet
{"title":"Triggering patterns of topology changes in dynamic graphs","authors":"Mehdi Kaytoue-Uberall, Y. Pitarch, M. Plantevit, C. Robardet","doi":"10.1109/ASONAM.2014.6921577","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921577","url":null,"abstract":"To describe the dynamics taking place in networks that structurally change over time, we propose an approach to search for attributes whose value changes impact the topology of the graph. In several applications, it appears that the variations of a group of attributes are often followed by some structural changes in the graph that one may assume they generate. We formalize the triggering pattern discovery problem as a method jointly rooted in sequence mining and graph analysis. We apply our approach on three real-world dynamic graphs of different natures - a co-authoring network, an airline network, and a social bookmarking system - assessing the relevancy of the triggering pattern mining approach.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131281214","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}
Jalal S. Alowibdi, U. Buy, Philip S. Yu, Leon Stenneth
{"title":"Detecting deception in Online Social Networks","authors":"Jalal S. Alowibdi, U. Buy, Philip S. Yu, Leon Stenneth","doi":"10.1109/ASONAM.2014.6921614","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921614","url":null,"abstract":"Over the past decade Online Social Networks (OSNs) have been helping hundreds of millions of people develop reliable computer-mediated relations. However, many user profiles in OSNs contain misleading, inconsistent or false information. Existing studies have shown that lying in OSNs is quite widespread, often for protecting a user's privacy. In order for OSNs to continue expanding their role as a communication medium in our society, it is crucial for information posted on OSNs to be trusted. Here we define a set of analysis methods for detecting deceptive information about user genders in Twitter. In addition, we report empirical results with our stratified data set consisting of 174,600 Twitter profiles with a 50-50 breakdown between male and female users. Our automated approach compares gender indicators obtained from different profile characteristics including first name, user name, and layout colors. We establish the overall accuracy of each indicator and the strength of all possible values for each indicator through extensive experimentations with our data set. We define male trending users and female trending users based on two factors, namely the overall accuracy of each characteristic and the relative strength of the value of each characteristic for a given user. We apply a Bayesian classifier to the weighted average of characteristics for each user. We flag for possible deception profiles that we classify as male or female in contrast with a self-declared gender that we obtain independently of Twitter profiles. Finally, we use manual inspections on a subset of profiles that we identify as potentially deceptive in order to verify the correctness of our predictions.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130443060","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":"Agent-based simulation research on group emotion evolution of public emergency","authors":"Bo Li, Duoyong Sun, Zi-Han Lin, Chaomin Ou","doi":"10.1109/ASONAM.2014.6921632","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921632","url":null,"abstract":"The use of agent based social simulation in computational analysis of public emergency management is becoming a prominent approach in social science research. Due to the complexity of rumor spreading and the radical emotion infecting processes, the results of the group emotion evolution analysis often lose effectiveness, which will affect the control and strategy establishment in emergency management. In this paper, we study the group emotion evolution process with the agent based simulation method. Along the way, the events-chain model is proposed to modeling the over-lapping influence of the temporal successive events. The simulation experiments of correlation events and events-chain model of a real public incident are performed based on the constructed framework. The results show that the group emotion evolution processes of correlation events have different patterns with the single event, and they cannot analyze as two independent events. Meanwhile, the results of real incident show that the events-chain model can simulate the real group response with consistency of the evolution.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"247 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123379089","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":"Detecting highly overlapping community structure based on Maximal Clique Networks","authors":"Peng Wu, Li Pan","doi":"10.1109/ASONAM.2014.6921582","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921582","url":null,"abstract":"Most of overlapping community detection algorithms cannot be applied to networks with highly overlapping community such as online social networks where individuals belong to many communities. One important reason is that many algorithms detect communities based on the explicit borders where nodes have more connections inside the communities, however, when the vertices' membership number gets large, the explicit borders between communities will fade away. To overcome this disadvantage, a new algorithm named MCNLPA is proposed by expanding the traditional Label Propagation Algorithm (LPA) based on the Maximal Clique Network for highly overlapping community detection. By finding all maximal cliques in networks and defining reasonable edges between them, the maximal clique network is established. Then the updated rule of classic LPA is modified to apply to the maximal network. Experiments show that MCNLPA has a relatively good performance in highly overlapping community detection and overlapping nodes identification.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"60 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120904699","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":"Application of network analysis on healthcare","authors":"Fei Wang, Uma Srinivasan, M. S. Uddin, S. Chawla","doi":"10.1109/ASONAM.2014.6921647","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921647","url":null,"abstract":"The healthcare sector holds large amounts of semantically rich electronic data generated and used by different sections of the health care community. Data analytic techniques such as data mining and predictive modelling are being used to gain new insights into health care costs, performance and quality of care. In this context, social network analysis (SNA) has the unique ability to play a new role in exploring the context and situations that lead to efficient and effective healthcare. In this paper we describe a specific context of private healthcare in Australia and describe our SNA based approach (applied to health insurance claims) to understand the nature of collaboration among doctors treating hospital inpatients and explore the impact of collaboration on cost and quality of care. In particular, we use network analysis to (a) design collaboration models among surgeons, anaesthetists and assistants who work together while treating patients admitted for specific types of treatments (b) identify and extract specific types of network topologies that indicate the way doctors collaborate while treating patients and (c) analyse the impact of these topologies on cost and quality of care provided to those patients.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130900586","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 in social networks: A unified model?","authors":"Ajitesh Srivastava, C. Chelmis, V. Prasanna","doi":"10.1109/ASONAM.2014.6921624","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921624","url":null,"abstract":"Understanding how information flows in online social networks is of great importance. It is generally difficult to obtain accurate prediction results of cascades over such networks, therefore a variety of diffusion models have been proposed in the literature to simulate diffusion processes instead. We argue that such models require extensive simulation results to produce good estimates of future spreads. In this work, we take a complimentary approach. We present a generalized, analytical model of influence in social networks that captures social influence at various levels of granularity, ranging from pairwise influence, to local neighborhood, to the general population, and external events, therefore capturing the complex dynamics of human behavior. We demonstrate that our model can integrate a variety of diffusion models. Particularly, we show that commonly used diffusion models in social networks can be reduced to special cases of our model, by carefully defining their parameters. Our goal is to provide a closed-form expression to approximate the probability of infection for every node in an arbitrary, directed network at any time t. We quantitatively evaluate the approximation quality of our analytical solution as compared to numerous popular diffusion models on a real-world dataset and a series of synthetic graphs.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130834516","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":"Who were you talking to - Mining interpersonal relationships from cellphone network data","authors":"Mo Yu, Wenjun Si, Guojie Song, Z. Li, J. Yen","doi":"10.1109/ASONAM.2014.6921630","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921630","url":null,"abstract":"People play different roles in various social networks. Even in a single network, people may interact with others based on different roles, and there are various relationships among them. However, current research usually treats all relationships homogeneously (i.e. friendship). In this paper, we try to identify different types of relationship (family, colleague, and social) within social networks. By analyzing a large-scale cellphone network, we gain insights about human mobility patterns. We design three metrics to capture colocation behaviors for cellphone users, taking spatial-temporal factors into consideration. These metrics show that users with different relationships demonstrate significantly different co-locating patterns. With these metrics as features, we adopt supervised approach to classify cellphone user pairs into different relationship categories. Comparing to using network and communication features, co-location metrics demonstrate better performance to fulfill the task of relationship identification.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"273 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114331401","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":"Overlapping Stochastic Community Finding","authors":"Aaron F. McDaid, N. Hurley, T. B. Murphy","doi":"10.1109/ASONAM.2014.6921554","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921554","url":null,"abstract":"Community finding in social network analysis is the task of identifying groups of people within a larger population who are more likely to connect to each other than connect to others in the population. Much existing research has focussed on non-overlapping clustering. However, communities in real-world social networks do overlap. This paper introduces a new community finding method based on overlapping clustering. A Bayesian statistical model is presented, and a Markov Chain Monte Carlo (MCMC) algorithm is presented and evaluated in comparison with two existing overlapping community finding methods that are applicable to large networks. We evaluate our algorithm on networks with thousands of nodes and tens of thousands of edges.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116318915","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":"Online Naive Bayes classification for network intrusion detection","authors":"Fatma Gumus, C. O. Sakar, Z. Erdem, Olcay Kursun","doi":"10.1109/ASONAM.2014.6921657","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921657","url":null,"abstract":"Intrusion detection system (IDS) is an important component to ensure network security. In this paper we build an online Naïve Bayes classifier to discriminate normal and bad (intrusion) connections on KDD 99 dataset for network intrusion detection. The classifier starts with a small number of training examples of normal and bad classes; then, as it classifies the rest of the samples one at a time, it continuously updates the mean and the standard deviations of the features (IDS variables). We present experimental results of parameter updating methods and their parameters for the online Naïve Bayes classifier. The obtained results show that our proposed method performs comparably to the simple incremental update.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131828860","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":"Time-aware reciprocity prediction in trust network","authors":"X. Feng, Jichang Zhao, Zhiwen Fang, Ke Xu","doi":"10.1109/ASONAM.2014.6921589","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921589","url":null,"abstract":"Study of reciprocity helps to find influential factors for users building relationships, which greatly facilitates the social behavior understanding in trust networks. In the previous literature, the dynamics of both network structure and user generated content are rarely considered. Our investigation of the available timing information from a real-world network demonstrates that time delay has significant impact on reciprocity formation. In particular, we find structural factors possess greater effect on short-term reciprocity while factors based on user generated content become more important for long-term reciprocity. Based on the empirical analysis, we redefine the reciprocity prediction problem as a learning task specific to each pair of users with different reciprocal delays. Evaluations show that our time-aware framework eventually outperforms the conventional classifiers that ignore the temporal information. Meanwhile, we tackle the problem of concept drift through fitting the evolving trend of features for Naive Bayes and performing periodic retraining for Logistic Regression classifiers, respectively.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133831548","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}