2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)最新文献

筛选
英文 中文
How do biological networks differ from social networks? (an experimental study) 生物网络与社会网络有何不同?(实验性研究)
Tatiana Gutierrez-Bunster, U. Stege, Alex Thomo, John Taylor
{"title":"How do biological networks differ from social networks? (an experimental study)","authors":"Tatiana Gutierrez-Bunster, U. Stege, Alex Thomo, John Taylor","doi":"10.1109/ASONAM.2014.6921669","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921669","url":null,"abstract":"In this paper we outline important differences between (1) protein interaction networks and (2) social and other complex networks, in terms of fine-grained network community profiles. While these families of networks present some general similarities, they also have some stark differences in the way the communities are formed. Namely, we find that the sizes of the best communities in such biological networks are an order of magnitude smaller than in social and other complex networks. We furthermore find that the generative model describing biological networks is very different from the model describing social networks. While for latter the Forest-Fire model best approximates their network community profile, for biological networks it is a random rewiring model that generates networks with the observed profiles. Our study suggests that these families of networks should be treated differently when deriving results from network analysis, and a fine-grained analysis is needed to better understand their structure.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"82 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":"125055239","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}
引用次数: 12
A uniform framework for community detection via influence maximization in social networks 基于社交网络中影响力最大化的社区检测统一框架
Fei Jiang, Shuyuan Jin, Yanlei Wu, Jin Xu
{"title":"A uniform framework for community detection via influence maximization in social networks","authors":"Fei Jiang, Shuyuan Jin, Yanlei Wu, Jin Xu","doi":"10.1109/ASONAM.2014.6921556","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921556","url":null,"abstract":"Community structure as a significant feature helps us understand networks in a mesoscopic view. Existing approaches for community detection haven't considered about the formation of communities, whereas community in real social networks is usually established around influential nodes. In this paper, we present an efficient and effective framework based on local influence to detect both overlapping and hierarchical communities. We try to illuminate two fundamental questions: 1)Whether local influence regarded as a new property can affect the formation of communities; 2)How to quantify node's local influence and utilize it to detect communities. To demonstrate the effectiveness of local influence in terms of evaluating node importance, nodes with high local influence are selected to perform the influence maximization experiments on real social networks. Experimental results show that our framework is effective and efficient for both community detection and influence maximization.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"2 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":"125523773","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}
引用次数: 22
A multi-generational social learning model: The effect of information cascade on aggregate welfare 多代社会学习模型:信息级联对社会总福利的影响
Marziyeh Barghandan, M. Malekzadeh, Atefeh Safdel, Iren Mazloomzadeh
{"title":"A multi-generational social learning model: The effect of information cascade on aggregate welfare","authors":"Marziyeh Barghandan, M. Malekzadeh, Atefeh Safdel, Iren Mazloomzadeh","doi":"10.1109/ASONAM.2014.6921637","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921637","url":null,"abstract":"For the past decades, people combine both environmental learnings (observations) and social learnings (intercommunication links) in their decision process. People in the communities face limitations or conditions which have effects on their decisions. In this paper, we present a multigenerational social learning model to analyse a world with some limitations. Then we turn the world to a free world and people try to find correct decisions utilizing these changes. In the presented model, people make their initial decisions based on sequential decision model which leads them into the herd behavior. Then we change the world so that making connections with other communities is possible. We show how aggregate welfare will be improved when people use their observations, their new obtained information on social ties and their personality factors to review their current decisions. We also have a parameter in our model that examines the effect of personality factor value on the percentage of the correct decision among the communities. Our main results show when people use their obtained information rather than sticking to the herd behavior, the aggregate welfare will be better in the world, even if people use only their own observations.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"17 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":"124696121","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}
引用次数: 0
CAPER: Crawling and analysing Facebook for intelligence purposes CAPER:以情报为目的抓取和分析Facebook
C. Aliprandi, Antonio Ercole De Luca, Giulia Di Pietro, Matteo Raffaelli, Davide Gazzè, M. L. Polla, Andrea Marchetti, M. Tesconi
{"title":"CAPER: Crawling and analysing Facebook for intelligence purposes","authors":"C. Aliprandi, Antonio Ercole De Luca, Giulia Di Pietro, Matteo Raffaelli, Davide Gazzè, M. L. Polla, Andrea Marchetti, M. Tesconi","doi":"10.1109/ASONAM.2014.6921656","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921656","url":null,"abstract":"Organised crime uses information technology systems to communicate, work or expand its influence. The EU FP7 Security Research Project CAPER (Collaborative information, Acquisition, Processing, Exploitation and Reporting for the prevention of organised crime), created in cooperation with European Law Enforcement Agencies (LEAs), aims to build a common collaborative and information sharing platform for the detection and prevention of organised crime, which exploits Open Source Intelligence (OSINT). LEAs are becoming more inclined to using OSINT tools, and particularly tools able to manage Online Social Networks (OSNs) data. This paper presents the CAPER Facebook crawling and analysis subsystem. Heuristic algorithms have been implemented in order to extract specific properties of Facebook's social graph, in particular user interactions. To support analysis tasks specifically, extensive effort has been spent on the analysis of textual user generated content and on the recognition of named-entities, in particular person names, locations and organisations. Relationships between users and entities mentioned in posts and in related comments are created and merged into the users networks extracted from the social graph. All entity relationships are finally visualised in user-friendly network graphs.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"122 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":"116675022","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}
引用次数: 9
#tag: Meme or event? #tag:迷因还是事件?
D. Kotsakos, Panos Sakkos, I. Katakis, D. Gunopulos
{"title":"#tag: Meme or event?","authors":"D. Kotsakos, Panos Sakkos, I. Katakis, D. Gunopulos","doi":"10.1109/ASONAM.2014.6921615","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921615","url":null,"abstract":"Users in social networks use hashtags for various reasons, some of them being serving search purposes, gaining attention or popularity or starting new conversation - thus, creating viral memes. In this paper we address the problem of classifying these hashtags in different categories, based on whether they represent a real life event or a social network generated meme. We compute a set of language-agnostic features to aid the classification of hashtags into events and memes and we provide an extensive study of the behavior that characterizes memes and events. We focus on Twitter social network, we apply our methods on a big dataset and reveal interesting characteristics of the two classes of hashtags.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"76 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":"117100025","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}
引用次数: 9
The security awareness paradox: A case study 安全意识悖论:一个案例研究
M. Tariq, J. Brynielsson, H. Artman
{"title":"The security awareness paradox: A case study","authors":"M. Tariq, J. Brynielsson, H. Artman","doi":"10.1109/ASONAM.2014.6921663","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921663","url":null,"abstract":"Knowledge-intensive organizations are characterized by their dependency on highly skilled personnel who perform their daily work in a decentralized manner. In these organizations it is the users who make the important decisions, and therefore the organization's information security awareness is upheld by and depends on its users' combined security awareness. To assess the overall organizational security awareness it therefore becomes interesting to assess both the users' individual level of security awareness, as well as their level of consistency and conformity with regard to other users' awareness. In the present case study, 15 semi-structured interviews have been undertaken within a large telecommunication company in order to understand how significant IT security aspects are understood within the organization. The study highlights a number of perception differences where the technical IT staff and the ordinary users do not share the same understanding. It is suggested that these perception differences result from a paradoxical situation where the users' possibility to uphold security awareness is hindered because of security concerns.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"102 14 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":"121184323","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}
引用次数: 17
Improving energetic feature selection to classify protein-protein interactions 改进能量特征选择以分类蛋白质-蛋白质相互作用
Tatiana Gutierrez-Bunster, Germán Poo-Caamaño
{"title":"Improving energetic feature selection to classify protein-protein interactions","authors":"Tatiana Gutierrez-Bunster, Germán Poo-Caamaño","doi":"10.1109/ASONAM.2014.6921668","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921668","url":null,"abstract":"Protein-protein interactions (PPIs) are known for its important role in diverse biological processes. One of the crucial issues to understand and classify PPI is to characterize their interfaces in order to discriminate between transient and permanent complexes. The stability of protein-protein interactions depends on the energetic features of interaction surfaces. This work explores the surfaces of complex interaction classified as permanent and transient, in order to find those energetic features that can differentiate between both type of complexes. We claim that the number of energetic features and their contribution to the interactions can be key factors to predict between transient and permanent interactions. Moreover, the features used can be adjusted according to the size of the complex studied. We evaluate different classifiers to predict these interactions, using a set of 298 complexes extracted from databases of protein complexes -in terms of their known three-dimensional structure-, and which were already classified as transient or permanent. As a result, we obtained an improved accuracy up to 86.6% when using SVM with kernel linear.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"93 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":"116194996","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}
引用次数: 1
Analysis of two crime-related networks derived from bipartite social networks 从二元社会网络衍生的两种犯罪相关网络分析
T. Alzahrani, K. Horadam
{"title":"Analysis of two crime-related networks derived from bipartite social networks","authors":"T. Alzahrani, K. Horadam","doi":"10.1109/ASONAM.2014.6921691","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921691","url":null,"abstract":"In this paper we investigate two real crime-related networks, which are both bipartite. The bipartite networks are: a spatial network where crimes of various types are committed in different local government areas; and a dark terrorist network where individuals attend events or have common affiliations. In each case we analyse the communities found by a random-walk based algorithm in the primary weighted projection network. We demonstrate that the identified communities represent meaningful information, and in particular, that the small communities found in the terrorist network represent meaningful cliques.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"3 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":"121600874","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}
引用次数: 12
Diversified social influence maximization 多元化社会影响力最大化
F. Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu
{"title":"Diversified social influence maximization","authors":"F. Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu","doi":"10.1109/ASONAM.2014.6921625","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921625","url":null,"abstract":"For better viral marketing, there has been a lot of research on social influence maximization. However, the problem that who is influenced and how diverse the influenced population is, which is important in real-world marketing, has largely been neglected. To that end, in this paper, we propose to consider the magnitude of influence and the diversity of the influenced crowd simultaneously. Specifically, we formulate it as an optimization problem, i.e., diversified social influence maximization. First, we present a general framework for this problem, under which we construct a class of diversity measures to quantify the diversity of the influenced crowd. Meanwhile, we prove that a simple greedy algorithm guarantees to provide a near-optimal solution to the optimization problem. Furthermore, we relax the problem by focusing on the diversity of the nodes targeted for initial activation, and show how this relaxed form could be used to diversify the results of many heuristics, e.g., PageRank. Finally, we run extensive experiments on two real-world datasets, showing that our formulation is effective in generating diverse results.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"14 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":"126361202","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}
引用次数: 42
Accurately detecting trolls in Slashdot Zoo via decluttering 在Slashdot动物园通过整理准确检测巨魔
Srijan Kumar, Francesca Spezzano, V. S. Subrahmanian
{"title":"Accurately detecting trolls in Slashdot Zoo via decluttering","authors":"Srijan Kumar, Francesca Spezzano, V. S. Subrahmanian","doi":"10.1109/ASONAM.2014.6921581","DOIUrl":"https://doi.org/10.1109/ASONAM.2014.6921581","url":null,"abstract":"Online social networks like Slashdot bring valuable information to millions of users - but their accuracy is based on the integrity of their user base. Unfortunately, there are many “trolls” on Slashdot who post misinformation and compromise system integrity. In this paper, we develop a general algorithm called TIA (short for Troll Identification Algorithm) to classify users of an online “signed” social network as malicious (e.g. trolls on Slashdot) or benign (i.e. normal honest users). Though applicable to many signed social networks, TIA has been tested on troll detection on Slashdot Zoo under a wide variety of parameter settings. Its running time is faster than many past algorithms and it is significantly more accurate than existing methods.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"1997 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":"127320318","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}
引用次数: 73
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信