2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing最新文献

筛选
英文 中文
Maintaining a Consistent Representation of Self across Multiple Social Networking Sites -- A Data-centric Perspective 在多个社交网站中保持自我的一致表现——以数据为中心的视角
Moritz Riesner, G. Pernul
{"title":"Maintaining a Consistent Representation of Self across Multiple Social Networking Sites -- A Data-centric Perspective","authors":"Moritz Riesner, G. Pernul","doi":"10.1109/SocialCom-PASSAT.2012.15","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.15","url":null,"abstract":"The rising pervasiveness and use of sensitive data on Social Networking Sites (SNS) requires careful consideration of one's privacy while using such sites. Also, users faced with a multitude of online contacts from various areas of life feel the need to create multiple representations of self and keeping them consistent. The difficulty of this task is compounded by the use of multiple SNS. We argue that for maintaining a consistent representation of self across multiple SNS, it needs to be carefully analyzed how personal attributes, which make up the online identity, are implemented and stored on each site. In this paper, we analyze criteria to classify how attributes and their values are implemented at SNS. Then, we present a structured approach to transform attribute values for use on multiple SNS. We evaluate the approach by applying it to selected attributes of major SNS.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"13 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128866549","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
Quantifying Behavioral Mimicry by Automatic Detection of Nonverbal Cues from Body Motion 通过自动检测身体动作的非语言线索来量化行为模仿
S. Feese, B. Arnrich, G. Tröster, Bertolt Meyer, K. Jonas
{"title":"Quantifying Behavioral Mimicry by Automatic Detection of Nonverbal Cues from Body Motion","authors":"S. Feese, B. Arnrich, G. Tröster, Bertolt Meyer, K. Jonas","doi":"10.1109/SocialCom-PASSAT.2012.48","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.48","url":null,"abstract":"Effective leadership can increase team performance, however the underlying micro-level behaviors that support team performance are still unclear. At the same time, traditional behavioral observation methods rely on manual video annotation which is a time consuming and costly process. In this work, we employ wearable motion sensors to automatically extract nonverbal cues from body motion. We utilize activity recognition methods to detect relevant nonverbal cues such as head nodding, gesticulating and posture changes. Further, we combine the detected individual cues to quantify behavioral mimicry between interaction partners. We evaluate our methods on data that was acquired during a psychological experiment in which 55 groups of three persons worked on a decision-making task. Group leaders were instructed to either lead with individual consideration orin an authoritarian way. We demonstrate that nonverbal cues can be detected with a F1-measure between 56% and 100%. Moreover, we show how our methods can highlight nonverbal behavioral differences of the two leadership styles. Our findings suggest that individually considerate leaders mimic head nods of their followers twice as often and that their face touches are mimicked three times as often by their followers when compared with authoritarian leaders.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117243197","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}
引用次数: 35
Vegas -- A Secure and Privacy-Preserving Peer-to-Peer Online Social Network 拉斯维加斯——一个安全和隐私保护的点对点在线社交网络
M. Dürr, Marco Maier, Florian Dorfmeister
{"title":"Vegas -- A Secure and Privacy-Preserving Peer-to-Peer Online Social Network","authors":"M. Dürr, Marco Maier, Florian Dorfmeister","doi":"10.1109/SocialCom-PASSAT.2012.42","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.42","url":null,"abstract":"Although Social Network Service (SNS) providers like Facebook and Google attempt to mitigate security and privacy-related concerns of their users, abuses and misuses of personal data still make the headlines. As centralized storage of personal data is a decisive factor for unintended information disclosure, several architectures for decentralized Online Social Networks (OSNs) have been proposed. System designs range from solutions based on a decentralized client server architecture like Diaspora to P2P systems like PeerSoN. Despite all efforts to accomplish strong decentralization, most proposals cannot achieve sufficient informational self-determination, i.e., users do not have full control over storage and dissemination of their personal data and published content. In this paper we follow a contrary approach and present Vegas, a secure and privacy-preserving P2P OSN which restricts the possibility to browse the social graph to the ego network. We show how Vegas achieves a maximum degree of security and privacy through encryption and decentralization. We present our mobile Vegas prototype and its context-dependent communication channel decision model. Finally we show how Vegas can be extended to support services like social-search and directory services in a secure and privacy-preserving way.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124221491","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}
引用次数: 29
Assessing User Bias in Affect Detection within Context-Based Spoken Dialog Systems 在基于上下文的口语对话系统中评估影响检测中的用户偏见
S. Lutfi, F. Martínez, Andrés Casanova-García, Lorena Lopez-Lebon, J. Montero-Martínez
{"title":"Assessing User Bias in Affect Detection within Context-Based Spoken Dialog Systems","authors":"S. Lutfi, F. Martínez, Andrés Casanova-García, Lorena Lopez-Lebon, J. Montero-Martínez","doi":"10.1109/SocialCom-PASSAT.2012.112","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.112","url":null,"abstract":"This paper presents an empirical evidence of user bias within a laboratory-oriented evaluation of a Spoken Dialog System. Specifically, we addressed user bias in their satisfaction judgements. We question the reliability of this data for modeling user emotion, focusing on contentment and frustration in a spoken dialog system. This bias is detected through machine learning experiments that were conducted on two datasets, users and annotators, which were then compared in order to assess the reliability of these datasets. The target used was the satisfaction rating and the predictors were conversational/dialog features. Our results indicated that standard classifiers were significantly more successful in discriminating frustration and contentment and the intensities of these emotions (reflected by user satisfaction ratings) from annotator data than from user data. Indirectly, the results showed that conversational features are reliable predictors of the two abovementioned emotions.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133039628","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
Towards Social Networking: A Proof-of-Concept Model 走向社会网络:一个概念验证模型
Yasuhiro Sato, Hirona Shimokawa, S. Ata, I. Oka
{"title":"Towards Social Networking: A Proof-of-Concept Model","authors":"Yasuhiro Sato, Hirona Shimokawa, S. Ata, I. Oka","doi":"10.1109/SocialCom-PASSAT.2012.82","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.82","url":null,"abstract":"The structure of the current Internet does not fully reflect the structure of human relationships in the real world. Human relationships are structured as various community networks, however IP-based network is essentially not structured in terms of information retrieval and sharing. In the communication style on the current network, end node can obtain information and contents from the whole of the network. In social-centric networking, information is likely to be diffused and shared within community network that is related to the topic of the information, members of community network can obtain information related to the community more efficiently and rapidly. We believe that a social-centric networking paradigm would be a fundamental principle of communications in the future. In this paper, we propose a social-centric network architecture that leverages multiple network structures. One of our objectives is elimination of inefficiency on information diffusion due to gaps between the current network structure and the real world human relationships and community structure. We also propose a proof-of-concept model to evaluate efficiency of information diffusion in consideration of workload of node. We then show the improvement of load-balancing and efficiency of information retrieval through the results of mathematical analysis and simulation.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125659548","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
Predicting Communication Intention in Social Networks 预测社交网络中的交际意图
C. Chelmis, V. Prasanna
{"title":"Predicting Communication Intention in Social Networks","authors":"C. Chelmis, V. Prasanna","doi":"10.1109/SocialCom-PASSAT.2012.44","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.44","url":null,"abstract":"In social networks, where users send messages to each other, the issue of what triggers communication between unrelated users arises: does communication between previously unrelated users depend on friend-of-a-friend type of relationships, common interests, or other factors? In this work, we study the problem of predicting directed communication intention between two users. Link prediction is similar to communication intention in that it uses network structure for prediction. However, these two problems exhibit fundamental differences that originate from their focus. Link prediction uses evidence to predict network structure evolution, whereas our focal point is directed communication initiation between users who are previously not structurally connected. To address this problem, we employ topological evidence in conjunction to transactional information in order to predict communication intention. It is not intuitive whether methods that work well for link prediction would work well in this case. In fact, we show in this work that network or content evidence, when considered separately, are not sufficiently accurate predictors. Our novel approach, which jointly considers local structural properties of users in a social network, in conjunction with their generated content, captures numerous interactions, direct and indirect, social and contextual, which have up to date been considered independently. We performed an empirical study to evaluate our method using an extracted network of directed @-messages sent between users of a corporate micro logging service, which resembles Twitter. We find that our method outperforms state of the art techniques for link prediction. Our findings have implications for a wide range of social web applications, such as contextual expert recommendation for Q&A, new friendship relationships creation, and targeted content delivery.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133018509","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
Unsupervised Construction of Topic-Based Twitter Lists 基于主题的Twitter列表的无监督构建
F. D. Villiers, M. Hoffmann, Steve Kroon
{"title":"Unsupervised Construction of Topic-Based Twitter Lists","authors":"F. D. Villiers, M. Hoffmann, Steve Kroon","doi":"10.1109/SocialCom-PASSAT.2012.64","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.64","url":null,"abstract":"The Twitter lists feature was launched in late 2009 and enables the creation of curated groups containing Twitter users. Each user can be a list author and decide the basis on which other users are added to a list. The most popular lists are those that associate with a topic. Twitter lists can be used as a powerful organisation tool, but its widespread adoption has been limited. The two main obstacles are the initial setup time and the effort of continual curation. In this paper we attempt to solve the first problem by applying unsupervised clustering algorithms to construct topic-based Twitter lists. We consider k-means and affinity propagation (AP) as clustering algorithms and evaluate these algorithms using two document representation techniques. The selected representation techniques are the popular term frequency-inverse document frequency (TF-IDF) and the latent Dirichlet allocation (LDA) topic model. We calculate the similarities for the clustering algorithms using five well-known similarity measures that have been used extensively in the text domain. The adjusted normalised information distance (ANID) was used to compare the clustering result yielded by k-means and affinity propagation. We found that the careful selection of a similarity measure, combined with the LDA topic model can provide a user with a sensible starting point for list creation.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"44 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133889029","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
Towards a Modeling and Analysis Framework for Privacy-Aware Systems 面向隐私感知系统的建模与分析框架
Pietro Colombo, E. Ferrari
{"title":"Towards a Modeling and Analysis Framework for Privacy-Aware Systems","authors":"Pietro Colombo, E. Ferrari","doi":"10.1109/SocialCom-PASSAT.2012.12","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.12","url":null,"abstract":"Nowadays, almost any software application deals with private information. However, effective tools that support the specification and implementation of privacy-aware systems are still missing. This work makes a step to address this issue. In this paper we present MAPaS, a model based framework for the modeling and analysis of privacy-aware systems. MAPaS provides a modeling language for the privacy domain and a rich set of functionalities that allow users to easily analyze privacy-preserving characteristics of a system at the early stages of its development. In this paper, besides presenting the main modules of MaPaS, we show how it can effectively help in the development of privacy-aware systems.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131449204","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}
引用次数: 29
Peer Influence and Homophily in the Diffusion of the iPhone 3G in a Very Large Social Network iPhone 3G在超大社交网络中传播的同伴影响和同质性
M. Matos, Pedro A. Ferreira, D. Krackhardt
{"title":"Peer Influence and Homophily in the Diffusion of the iPhone 3G in a Very Large Social Network","authors":"M. Matos, Pedro A. Ferreira, D. Krackhardt","doi":"10.1109/SocialCom-PASSAT.2012.32","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.32","url":null,"abstract":"This paper studies the effects of peer influence and homophily on the diffusion of the iPhone 3G across a number of communities sampled from a large dataset from a major European Mobile carrier in one country. We use Stochastic Actor Based Models to capture the co-evolution of the social network as well as the dynamics of adoption. This helps to separate the roles of homophily and peer influence in the process of diffusion. We provide evidence that the propensity of a subscriber to adopt, when she is called upon to make a decision about whether she should adopt, increases with the number of friends that have already adopted. A one standard deviation increase above the mean in the number of friends that had already adopted increases the likelihood odds of adoption relative to no adoption by a factor of 2.8. The effect of peer influence is robust across a number of different specifications. The results for the effect of homophily are less clear. While, on average, we find a positive significant effect of adoption on tie formation, in many communities this effect is significant and negative and in others there is no effect at all.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117220642","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
Understanding How Dominance Affects the Emergence of Agreement in a Social Network: The Case of Naming Game 理解支配如何影响社会网络中协议的出现:以命名游戏为例
S. Maity, Animesh Mukherjee
{"title":"Understanding How Dominance Affects the Emergence of Agreement in a Social Network: The Case of Naming Game","authors":"S. Maity, Animesh Mukherjee","doi":"10.1109/SocialCom-PASSAT.2012.61","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.61","url":null,"abstract":"We study the dynamics of the Naming Game as an opinion formation model on social networks. This agent-based model captures the essential features of the agreement dynamics by means of a memory-based negotiation process. Our study focuses on the impact of dominance of certain opinions over others in pursuit of faster agreement on social networks. We propose two models to incorporate dominance of the opinions. We observe that both these models lead to faster agreement among the agents on an opinion as compared to the base case reported in the literature. We perform extensive simulations on computer-generated networks as well as on a real online social network (Facebook) and in both cases the dominance based models converge significantly faster than the base case.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115136661","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学术官方微信