H. Mahyar, H. Rabiee, A. Movaghar, E. Ghalebi, Ali Nazemian
{"title":"CS-ComDet: A compressive sensing approach for inter-community detection in social networks","authors":"H. Mahyar, H. Rabiee, A. Movaghar, E. Ghalebi, Ali Nazemian","doi":"10.1145/2808797.2808856","DOIUrl":"https://doi.org/10.1145/2808797.2808856","url":null,"abstract":"One of the most relevant characteristics of social networks is community structure, in which network nodes are joined together in densely connected groups between which there are only sparser links. Uncovering these sparse links (i.e. intercommunity links) has a significant role in community detection problem which has been of great importance in sociology, biology, and computer science. In this paper, we propose a novel approach, called CS-ComDet, to efficiently detect the inter-community links based on a newly emerged paradigm in sparse signal recovery, called compressive sensing. We test our method on real-world networks of various kinds whose community structures are already known, and illustrate that the proposed method detects the inter-community links accurately even with low number of measurements (i.e. when the number of measurements is less than half of the number of existing links in the network).","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"48 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":"115614083","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":"Epitope mapping and antigenic evaluation of Helicobacter pylori Urease subunit beta fragment","authors":"E. Raoufi, H. Akrami, B. Khansarinejad, H. Abtahi","doi":"10.1145/2808797.2809365","DOIUrl":"https://doi.org/10.1145/2808797.2809365","url":null,"abstract":"Background: Helicobacter pylori (H.pylori) is one of the most common chronic infections worldwide. The H. pylori Urease is a high molecular mass (530 kDa) multimeric enzyme collected of two separate subunits, UreA (26.5 kDa) and UreB (61.7 kDa). Recently, many researchers are working in the expansion of a vaccine to prevent H. pylori infection, and of the various candidate antigens, the majority promising is the B subunit of the Urease protein (Urease B), for the reason that immunization of mice with purified Urease B has resulted in better immunogenicity and protection as contrast to the use of Urease A. The aim of this study was to high level expression and evaluation of antigenic property of recombinant UreB protein with infected human and mice sera as a vaccine candidate. Materials and Methods: In this experimental study, the highly antigenic region of UreB gene (609 base pair) was detected by best immunobioinformatics methods of epitope mapping, amplified by PCR method and was cloned into the cloning vector pBSK and then inserted into the expression vector pET-32a. The target protein was expressed and purified. Finally antigenicity was studied by western blotting using human sera infected with H. pylori UreB recombinant protein. Results: PCR and sequencing results showed the successful cloning of the target gene into the recombinant vector. The expression of protein was induced by IPTG and the expressed protein was purified with Ni-NTA kit and dialysis. The recombinant protein with molecular weight about 42 KDa was recognized by antibodies in western blotting. Conclusion: Evaluation of antibodies studies have shown that the predicted immunogenic fragment by best immunobioinformatics tools antigenic properties is high., so this Recombinant UreB protein is a good candidate for the design of H. pylori vaccine and diagnostic kits.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"39 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":"115899472","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}
Yue Ning, S. Muthiah, R. Tandon, Naren Ramakrishnan
{"title":"Uncovering news-Twitter reciprocity via interaction patterns","authors":"Yue Ning, S. Muthiah, R. Tandon, Naren Ramakrishnan","doi":"10.1145/2808797.2809329","DOIUrl":"https://doi.org/10.1145/2808797.2809329","url":null,"abstract":"In recent years, the amount of information shared (both implicit and explicit) between traditional news media and social media sources like Twitter has grown at a prolific rate. Traditional news media is dependent on social media to help identify emerging developments; social media is dependent on news media to supply information in certain categories. In this paper, we present a principled framework for understanding their symbiotic relationship, with the goal of (1) understanding the type of information flow between news articles and the Twitterverse by classifying it into four states; (2) chaining similar news articles together to form story chains and extracting interaction patterns for each story chain in terms of interaction states of news articles in the story chain, and (3) identifying major interaction patterns by clustering story chains and understanding their differences by identifying main topics of interest within such clusters.","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":"117035827","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}
Yunping Feng, Di Chen, Zihao Zhao, Hao-peng Chen, Puzhao Xi
{"title":"The impact of students and TAs' participation on students' academic performance in MOOC","authors":"Yunping Feng, Di Chen, Zihao Zhao, Hao-peng Chen, Puzhao Xi","doi":"10.1145/2808797.2809428","DOIUrl":"https://doi.org/10.1145/2808797.2809428","url":null,"abstract":"Massive open online course is now a popular choice for online learners. There are many MOOC platforms all over the world. They provide multiple variants of MOOC. Traditionally, students learn by watching videos and doing online quizzes. Course forum is also an important component of MOOC. It is a good place for opinions sharing and discussion. This paper focuses on the relationship between students' academic performance and their participation in the course forum. It also studies the semantics of both students and TAs' posts in the course forum in order to understand their behavior in the forum. We found those who achieve higher scores tend to be more active in forum. But they also write a higher percentage of posts that are unrelated to the course than those who get lower scores. TAs are not very active in the forum and they have limited impacts. This paper talks about the problems of current course forum participation and presents some suggestions for MOOC forum.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"29 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":"116809564","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":"Centrality for graphs with numerical attributes","authors":"Oualid Benyahia, C. Largeron","doi":"10.1145/2808797.2808844","DOIUrl":"https://doi.org/10.1145/2808797.2808844","url":null,"abstract":"Identification of important actors in social networks is a hard task but with various interesting applications such as in information recommendation or for viral marketing. Existing centrality measures evaluate the importance of an actor in considering only the structural positions regardless of prior information on these actors such as their popularity, accessibility or behavior. A few measures have been proposed for weighted networks, notably the three common measures of centrality: degree, closeness, and betweenness. However, these extended versions have solely focused on the weights of ties and not on the attributes of nodes. This article proposes generalizations that combine these both aspects. We present a set of measures, based on conventional centrality indicators, suited to weighted attributed graphs where the nodes are characterized by attributes. We illustrate the benefits of this approach on real attributed graphs. Experiments have validated the contribution of the links weights and attributes, especially for the detection of information broadcasters in social networks.","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":"125891352","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}
Yuanyuan Bao, Chengqi Yi, Jingchi Jiang, Y. Xue, Yingfei Dong
{"title":"Implementation of chaotic analysis on retweet time series","authors":"Yuanyuan Bao, Chengqi Yi, Jingchi Jiang, Y. Xue, Yingfei Dong","doi":"10.1145/2808797.2808881","DOIUrl":"https://doi.org/10.1145/2808797.2808881","url":null,"abstract":"Retweet has become one of the most prominent feature on social networks and an important mean for secondary content promotion. Most existing investigations of retweet behaviors on social networks are conducted based on empirical studies or information diffusion models (such as stochastic process or cascading model). To the best of our knowledge, such a retweet process has not been investigated as a chaotic process. In this paper, we have first examined that retweet time series by 0-1 test where the results provide identification of chaotic behaviors. Furthermore, taking into account of the proven chaotic characteristic, chaos LS-SVM prediction method is applied to form predictions using only a small fraction of the retweet time series. Our evaluation on Sina Weibo dataset and comparisons with a bayesian model and strawman modal show that this nonlinear prediction method can translate to good step ahead forecasts and perform high accuracy in retweet prediction.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"24 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":"125963314","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":"Linear threshold model in temporal networks — Seed selection for social influence","authors":"Radosław Michalski","doi":"10.1145/2808797.2809346","DOIUrl":"https://doi.org/10.1145/2808797.2809346","url":null,"abstract":"The problem of finding optimal set of users for influencing others in social networks has been studied for more than ten years. As it has been shown, it is a NP-hard problem, so since than some heuristics were proposed as suboptimal solutions. Still, one of the commonly used assumption is the one that seeds are chosen on the static network, not the temporal one. This static approach is in fact far from the real-world networks, where new nodes may appear and old ones dynamically disappear in course of time. An alternative and more realistic approach, recently extensively explored, are temporal networks, i.e. networks that reflect the occurrence of events in time [1] and change in its nodes and edges.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"71 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":"127370718","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":"Tweet sentiment: From classification to quantification","authors":"Wei Gao, F. Sebastiani","doi":"10.1145/2808797.2809327","DOIUrl":"https://doi.org/10.1145/2808797.2809327","url":null,"abstract":"Sentiment classification has become a ubiquitous enabling technology in the Twittersphere, since classifying tweets according to the sentiment they convey towards a given entity (be it a product, a person, a political party, or a policy) has many applications in political science, social science, market research, and many others. In this paper we contend that most previous studies dealing with tweet sentiment classification (TSC) use a suboptimal approach. The reason is that the final goal of most such studies is not estimating the class label (e.g., Positive, Negative, or Neutral) of individual tweets, but estimating the relative frequency (a.k.a. \"prevalence\") of the different classes in the dataset. The latter task is called quantification, and recent research has convincingly shown that it should be tackled as a task of its own, using learning algorithms and evaluation measures different from those used for classification. In this paper we show, on a multiplicity of TSC datasets, that using a quantification-specific algorithm produces substantially better class frequency estimates than a state-of-the-art classification-oriented algorithm routinely used in TSC. We thus argue that researchers interested in tweet sentiment prevalence should switch to quantification-specific (instead of classification-specific) learning algorithms and evaluation measures.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"29 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":"128897513","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":"A methodology for applying social network analysis metrics to biological interaction networks","authors":"J. S. Silva, A. Saraiva","doi":"10.1145/2808797.2808824","DOIUrl":"https://doi.org/10.1145/2808797.2808824","url":null,"abstract":"We propose a methodology for applying Social Network Analysis (SNA) metrics to biological Interaction Network studies in the Biodiversity Informatics domain, which may serve as a guide for this activity to other researchers. The methodology is structured into four steps: (i) mapping the data types and the interactions available; (ii) defining the key-questions to be answered and the analysis variables; (iii) choosing the SNA metrics appropriate to the context of the research; and (iv) performing the biological analysis with the support of SNA. Among the material resources used in the development of this research are: SNA metrics (network and species level) and the programs used for its calculation; Statistical Analysis approach (Exploratory Data Analysis and Multivariate Data Analysis) as a support tool; and Business Process Model and Notation (BPMN) to formalize the methodology. From this research, we found that a systematic method to guide the steps one research can facilitate the researchers' works and the interaction with experts from several fields of knowledge. In addition, we noted that there is the possibility of applying this methodology to underexplored knowledge fields.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"53 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":"130663668","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 analysis of TV drama characters via deep concept hierarchies","authors":"Chang-Jun Nan, Kyung-Min Kim, Byoung-Tak Zhang","doi":"10.1145/2808797.2809306","DOIUrl":"https://doi.org/10.1145/2808797.2809306","url":null,"abstract":"TV drama is a kind of big data, containing enormous knowledge of modern human society. As the character-centered stories unfold, diverse knowledge, such as economics, politics and the culture, is displayed. However, unless we have efficient dynamic multi-modal data processing and picture processing methods, we cannot analyze drama data effectively. Here, we adopt the recently proposed deep concept hierarchies (DCH) and convolutional-recursive neural network (C-RNN) models to analyze the social network between the drama characters. DCH uses multi hierarchies structure to translate the vision-language concepts of drama characters into diversified abstract concepts, and utilizes Markov Chain Monte Carlo algorithm to improve the retrieval efficiency of organizing conceptual spaces. Adopting approximately 4400-minute data of TV drama - Friends, we process face recognition on the characters by using convolutional-recursive deep learning model. Then we establish the social network between the characters by deep concept hierarchies model and analyze their affinity and the change of social network while the stories unfold.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"43 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":"130737934","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}