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

筛选
英文 中文
Modeling individuals and making recommendations using multiple social networks 对个人进行建模并使用多个社交网络提出建议
Makbule Gülçin Özsoy, Faruk Polat, R. Alhajj
{"title":"Modeling individuals and making recommendations using multiple social networks","authors":"Makbule Gülçin Özsoy, Faruk Polat, R. Alhajj","doi":"10.1145/2808797.2808898","DOIUrl":"https://doi.org/10.1145/2808797.2808898","url":null,"abstract":"Web-based platforms, such as social networks, review web-sites, and e-commerce web-sites, commonly use recommendation systems to serve their users. The common practice is to have each platform captures and maintains data related to its own users. Later the data is analyzed to produce user specific recommendations. We argue that recommendations could be enriched by considering data consolidated from multiple sources instead of limiting the analysis to data captured from a single source. Integrating data from multiple sources is analogous to watching the behavior and preferences of each user on multiple platforms instead of a limited one platform based vision. Motivated by this, we developed a recommendation framework which utilizes user specific data collected from multiple platforms. To the best of our knowledge, this is the first work aiming to make recommendations by consulting multiple social networks to produce a rich modeling of user behavior. For this purpose, we collected and anonymized a specific dataset that contains information from BlogCatalog, Twitter and Flickr web-sites. We implemented several different types of recommendation methodologies to observe their performances while using single versus multiple features from a single source versus multiple sources. The conducted experiments showed that using multiple features from multiple social networks produces a wider perspective of user behavior and preferences leading to improved recommendation outcome.","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":"130645499","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}
引用次数: 4
Policy oriented exchange networks: Was a copenhagen climate treaty possible? Scientific analysis providing new insights for agreement and a better treaty for the planet 政策导向的交流网络:哥本哈根气候条约可能达成吗?科学分析为达成协议和为地球制定更好的条约提供了新的见解
F. Stokman
{"title":"Policy oriented exchange networks: Was a copenhagen climate treaty possible? Scientific analysis providing new insights for agreement and a better treaty for the planet","authors":"F. Stokman","doi":"10.1145/2808797.2808911","DOIUrl":"https://doi.org/10.1145/2808797.2808911","url":null,"abstract":"This paper presents our predictions for the outcomes of the most controversial issues at the 15th Conference of Parties (COP) Meeting in Copenhagen, December 7-15, 2009. For these predictions we used methodology that was developed at the University of Groningen, The Netherlands, in collaboration with consultancy firm Decide (dutch group). Based on these insights, a completely new strategy was developed, which could have resulted in a stronger treaty and could have created interests that are better harmonized among all states for a better climate and planet.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"60 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":"116699537","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
The influence of social status on consensus building in collaboration networks 社会地位对协作网络共识构建的影响
Ilire Hasani-Mavriqi, Florian Geigl, S. Pujari, E. Lex, D. Helic
{"title":"The influence of social status on consensus building in collaboration networks","authors":"Ilire Hasani-Mavriqi, Florian Geigl, S. Pujari, E. Lex, D. Helic","doi":"10.1145/2808797.2808887","DOIUrl":"https://doi.org/10.1145/2808797.2808887","url":null,"abstract":"In this paper, we analyze the influence of social status on opinion dynamics and consensus building in collaboration networks. To that end, we simulate the diffusion of opinions in empirical collaboration networks by taking into account both the network structure and the individual differences of people reflected through their social status. For our simulations, we adapt a well-known Naming Game model and extend it with the Probabilistic Meeting Rule to account for the social status of individuals participating in a meeting. This mechanism is sufficiently flexible and allows us to model various situations in collaboration networks, such as the emergence or disappearance of social classes. In this work, we concentrate on studying three well-known forms of class society: egalitarian, ranked and stratified. In particular, we are interested in the way these society forms facilitate opinion diffusion. Our experimental findings reveal that (i) opinion dynamics in collaboration networks is indeed affected by the individuals' social status and (ii) this effect is intricate and non-obvious. In particular, although the social status favors consensus building, relying on it too strongly can slow down the opinion diffusion, indicating that there is a specific setting for each collaboration network in which social status optimally benefits the consensus building process.","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":"131208070","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}
引用次数: 2
EnTwine: Feature analysis and candidate selection for social user identity aggregation 社交用户身份聚合的特征分析与候选选择
Niyati Chhaya, Dhwanit Agarwal, Nikaash Puri, Paridhi Jain, Deepak Pai, P. Kumaraguru
{"title":"EnTwine: Feature analysis and candidate selection for social user identity aggregation","authors":"Niyati Chhaya, Dhwanit Agarwal, Nikaash Puri, Paridhi Jain, Deepak Pai, P. Kumaraguru","doi":"10.1145/2808797.2809340","DOIUrl":"https://doi.org/10.1145/2808797.2809340","url":null,"abstract":"Organizations measure their social audience based on the number of users, fans, and followers on social media. Every social media platform has its user identity and a single user is present across varied platforms. Due to the disconnected user profiles, identifying duplicate users across media is non-trivial. There is a need to create a complete view of a user for various applications such as targeting and user profile construction. This view is not easily available due to the individual identities. In this work, we explore the feature space across social media that can be leveraged for intelligent user identity aggregation. Further, we present a two-phased unified identity creation process using our feature analysis, unsupervised candidate selection, and supervised user matching algorithms on four different social networks.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"14 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":"131514309","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}
引用次数: 2
Interaction prediction in dynamic networks exploiting community discovery 基于社区发现的动态网络交互预测
Giulio Rossetti, Riccardo Guidotti, Diego Pennacchioli, D. Pedreschi, F. Giannotti
{"title":"Interaction prediction in dynamic networks exploiting community discovery","authors":"Giulio Rossetti, Riccardo Guidotti, Diego Pennacchioli, D. Pedreschi, F. Giannotti","doi":"10.1145/2808797.2809401","DOIUrl":"https://doi.org/10.1145/2808797.2809401","url":null,"abstract":"Due to the growing availability of online social services, interactions between people became more and more easy to establish and track. Online social human activities generate digital footprints, that describe complex, rapidly evolving, dynamic networks. In such scenario one of the most challenging task to address involves the prediction of future interactions between couples of actors. In this study, we want to leverage networks dynamics and community structure to predict which are the future interactions more likely to appear. To this extent, we propose a supervised learning approach which exploit features computed by time-aware forecasts of topological measures calculated between pair of nodes belonging to the same community. Our experiments on real dynamic networks show that the designed analytical process is able to achieve interesting results.","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":"132909657","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
Human behaviour in different social medias: A case study of Twitter and Disqus 不同社交媒体中的人类行为:以Twitter和Disqus为例
H. Maruf, Nagib Meshkat, Mohammed Eunus Ali, J. Mahmud
{"title":"Human behaviour in different social medias: A case study of Twitter and Disqus","authors":"H. Maruf, Nagib Meshkat, Mohammed Eunus Ali, J. Mahmud","doi":"10.1145/2808797.2809395","DOIUrl":"https://doi.org/10.1145/2808797.2809395","url":null,"abstract":"Contemporary modern world has witnessed the widespread emergence of online social media and similar technologies. Peoples' behaviour over different social network platform has become an interesting topic of research. In this study, we investigate whether people express analogous identity over different platforms and analysis of different social platform usage contributes to reveal more of a person. We analyse people's usage pattern in two major online platforms, the most widely used social media platform Twitter and a major online commenting platform Disqus. We extract linguistic features and infer personality traits from both of these platforms. Our study reveals differential relationship between personality traits and Disqus and Twitter usage. We also find that social media has an influence on a person's discussion topic. People share opinion on varieties of topics and entities exclusively in Twitter and Disqus. Moreover Disqus provides stronger assessment of a person's sentiment over a topic or entity. Combination of these two profiles gives an extensive view of a user's interest and sensitivity which justify the inference that people use different social network for different purposes and single social network analysis is not enough to build a comprehensive virtual identity of a person.","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":"134214511","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
Finding the right social media site for questions 找到适合提问的社交媒体网站
Zhen Yang, Isaac Jones, Xia Hu, Huan Liu
{"title":"Finding the right social media site for questions","authors":"Zhen Yang, Isaac Jones, Xia Hu, Huan Liu","doi":"10.1145/2808797.2809391","DOIUrl":"https://doi.org/10.1145/2808797.2809391","url":null,"abstract":"Social media has become a part of our daily life and we use it for many reasons. One of its uses is to get our questions answered. Given a multitude of social media sites, however, one immediate challenge is to pick the most relevant site for a question. This is a challenging problem because (1) questions are usually short, and (2) social media sites evolve. In this work, we propose to utilize topic specialization to find the most relevant social media site for a given question. In particular, semantic knowledge is considered for topic specialization as it can not only make a question more specific, but also dynamically represent the content of social sites, which relates a given question to a social media site. Thus, we propose to rank social media sites based on combined search engine query results. Our algorithm yields compelling results for providing a meaningful and consistent site recommendation. This work helps further understand the innate characteristics of major social media platforms for the design of social Q&A systems.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"333 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":"122845578","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}
引用次数: 7
Networking in child exploitation — Assessing disruption strategies using registrant information 儿童剥削中的网络-利用注册者信息评估破坏策略
Russell Allsup, E. Thomas, Bryan Monk, Richard Frank, M. Bouchard
{"title":"Networking in child exploitation — Assessing disruption strategies using registrant information","authors":"Russell Allsup, E. Thomas, Bryan Monk, Richard Frank, M. Bouchard","doi":"10.1145/2808797.2809297","DOIUrl":"https://doi.org/10.1145/2808797.2809297","url":null,"abstract":"This research utilizes social network analysis to determine the success of three different disruption strategies on a child exploitation network extracted from the public internet. Using a custom-written web-crawler called LECEN, data from a set of hyperlinked child-exploitation websites was collected from the Internet. From these data, two types of networks were coded: the nodes of the first network consisted of only website domains, while the nodes of the second were generated using the registrant data, where the nodes represented the legal owners of those same domains. Three attack scenarios were carried out on these two networks: two types of hub attacks (one focused on in-degree and one focused on out-degree) and a bridge attack. Using these disruption strategies, it was found that bridge attacks were more suitable for disrupting the domain networks, while both hub-attacks could be favored when disrupting the network of registrants. These findings have implications for law enforcement, as it provides real-world applications to disruption where registrants may be targeted directly.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"511 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":"123904843","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}
引用次数: 4
Time evolution of the importance of nodes in dynamic networks 动态网络中节点重要性的时间演化
Clémence Magnien, Fabien Tarissan
{"title":"Time evolution of the importance of nodes in dynamic networks","authors":"Clémence Magnien, Fabien Tarissan","doi":"10.1145/2808797.2809322","DOIUrl":"https://doi.org/10.1145/2808797.2809322","url":null,"abstract":"For a long time now, researchers have worked on defining different metrics able to characterize the importance of nodes in networks. Among them, centrality measures have proved to be pertinent as they relate the position of a node in the structure to its ability to diffuse an information efficiently. The case of dynamic networks, in which nodes and links appear and disappear over time, led the community to propose extensions of those classical measures. Yet, they do not investigate the fact that the network structure evolves and that node importance may evolve accordingly. In the present paper, we propose temporal extensions of notions of centrality, which take into account the paths existing at any given time, in order to study the time evolution of nodes' importance in dynamic networks. We apply this to two datasets and show that the importance of nodes does indeed vary greatly with time. We also show that in some cases it might be meaningless to try to identify nodes that are consistently important over time, thus strengthening the interest of temporal extensions of centrality measures.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"78 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":"128738993","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}
引用次数: 24
Privacy preservation in social networks through alpha — Anonymization techniques 通过alpha -匿名化技术保护社交网络中的隐私
Saptarshi Chakraborty, B. Tripathy
{"title":"Privacy preservation in social networks through alpha — Anonymization techniques","authors":"Saptarshi Chakraborty, B. Tripathy","doi":"10.1145/2808797.2809354","DOIUrl":"https://doi.org/10.1145/2808797.2809354","url":null,"abstract":"We propose an (a, k) anonymity model based on the eigenvector centrality value of the nodes present in the raw graph and further extend it to propose (a, l) diversity model and recursive (a, c, l) diversity model which can handle the protection of the sensitive attributes associated with a particular actor. For anonymization purpose, we applied noise node addition technique to generate the anonymized graphs so that the structural property of the raw graph is preserved. Our proposed methods add noise nodes with very minimal social importance. We applied eigenvector centrality concept over traditional degree centrality concept to prevent mixing of highly influential nodes with less influential nodes in the equivalence groups.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"38 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":"115565184","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}
引用次数: 3
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学术文献互助群
群 号:481959085
Book学术官方微信