发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Authenticated Top-K Aggregation in Distributed and Outsourced Databases 分布式和外包数据库中的认证Top-K聚合
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.103
Sunoh Choi, Hyo-Sang Lim, E. Bertino
{"title":"Authenticated Top-K Aggregation in Distributed and Outsourced Databases","authors":"Sunoh Choi, Hyo-Sang Lim, E. Bertino","doi":"10.1109/SocialCom-PASSAT.2012.103","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.103","url":null,"abstract":"Top-k queries have attracted interest in many different areas like network and system monitoring, information retrieval, sensor networks, and so on. Since today many applications issue top-k queries on distributed and outsourced databases, authentication of top-k query results becomes more important. This paper addresses the problem of authenticated top-k aggregation queries (e.g. “find the k objects with the highest aggregate values”) in a distributed system. We propose a new algorithm, called Authenticated Three Phase Uniform Threshold (A-TPUT), which provides not only efficient top-k aggregation over distributed databases but also authentication on the top-k results. We also introduce several enhancements for A-TPUT to reduce both the computation cost and the communication cost. Finally, we confirm the efficiency of our solutions through an extensive experimental evaluation.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"317 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":"115223188","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 Ensemble Based Learning for Insider Threat Detection 基于无监督集成的内部威胁检测学习
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.106
P. Parveen, Nathan McDaniel, Varun S. Hariharan, B. Thuraisingham, L. Khan
{"title":"Unsupervised Ensemble Based Learning for Insider Threat Detection","authors":"P. Parveen, Nathan McDaniel, Varun S. Hariharan, B. Thuraisingham, L. Khan","doi":"10.1109/SocialCom-PASSAT.2012.106","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.106","url":null,"abstract":"Insider threats are veritable needles within the haystack. Their occurrence is rare and when they do occur, are usually masked well within normal operation. The detection of these threats requires identifying these rare anomalous needles in a contextualized setting where behaviors are constantly evolving over time. To this refined search, this paper proposes and tests an unsupervised, ensemble based learning algorithm that maintains a compressed dictionary of repetitive sequences found throughout dynamic data streams of unbounded length to identify anomalies. In unsupervised learning, compression-based techniques are used to model common behavior sequences. This results in a classifier exhibiting a substantial increase in classification accuracy for data streams containing insider threat anomalies. This ensemble of classifiers allows the unsupervised approach to outperform traditional static learning approaches and boosts the effectiveness over supervised learning approaches.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"324 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":"115670616","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}
引用次数: 18
Efficient Graph Models for Retrieving Top-k News Feeds from Ego Networks 从Ego Networks中检索Top-k新闻源的高效图模型
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.73
Rene Pickhardt, Thomas Gottron, A. Scherp, Steffen Staab, J. Kunze
{"title":"Efficient Graph Models for Retrieving Top-k News Feeds from Ego Networks","authors":"Rene Pickhardt, Thomas Gottron, A. Scherp, Steffen Staab, J. Kunze","doi":"10.1109/SocialCom-PASSAT.2012.73","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.73","url":null,"abstract":"A key challenge of web platforms like social networking sites and services for news feed aggregation is the efficient and targeted distribution of new content items to users. This can be formulated as the problem of retrieving the top-k news items out of the d-degree ego network of each given user, where the set of all users producing feeds is of size n, with n ≫ d ≫ k and typically k <; 20. Existing approaches employ either expensive join operations on global indices or suffer from high redundancy through denormalization. This makes retrieval of different top-k news feeds for thousands of users per second very inefficient in a large social network. In this paper, we propose two graph models GRAPHITY and STOU to address this problem. GRAPHITY is optimized for fast retrieval of news feeds and has a runtime of O(k log(k)). The GRAPHITY index does not involve data redundancy. An update of the index upon insertion of a new item to the feed is possible in a runtime linear to the nodes' indegree din. New content can be stored in STOU in O(1) at the cost of slower retrieval speed of O(d log(d)). We verify the theoretical runtime complexity of GRAPHITY and STOU on two data sets of different characteristics and size. We show that on a single machine GRAPHITY is able to retrieve more than 10 000 unique news feeds per second in a network with more than one million users. Our evaluation confirms that retrieval of news feeds with GRAPHITY is independent of the node degree d of a user's ego network and network size n and does scale to networks of arbitrary size.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"78 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":"127168213","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
Multi-level Modeling of Quotation Families Morphogenesis 引文族形态发生的多层次建模
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.114
E. Omodei, T. Poibeau, Jean-Philippe Cointet
{"title":"Multi-level Modeling of Quotation Families Morphogenesis","authors":"E. Omodei, T. Poibeau, Jean-Philippe Cointet","doi":"10.1109/SocialCom-PASSAT.2012.114","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.114","url":null,"abstract":"This paper investigates cultural dynamics in social media by examining the proliferation and diversification of clearly-cut pieces of content: quoted texts. In line with the pioneering work of Leskovec et al. and Simmons et al. on memes dynamics we investigate in deep the transformations that quotations published online undergo during their diffusion. We deliberately put aside the structure of the social network as well as the dynamical patterns pertaining to the diffusion process to focus on the way quotations are changed, how often they are modified and how these changes shape more or less diverse families and sub-families of quotations. Following a biological metaphor, we try to understand in which way mutations can transform quotations at different scales and how mutation rates depend on various properties of the quotations.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"5 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":"126186181","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}
引用次数: 5
The SocioMetric Badges Corpus: A Multilevel Behavioral Dataset for Social Behavior in Complex Organizations 社会计量徽章语料库:复杂组织中社会行为的多层次行为数据集
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.71
B. Lepri, Jacopo Staiano, G. Rigato, Kyriaki Kalimeri, Ailbhe N. Finnerty, F. Pianesi, N. Sebe, A. Pentland
{"title":"The SocioMetric Badges Corpus: A Multilevel Behavioral Dataset for Social Behavior in Complex Organizations","authors":"B. Lepri, Jacopo Staiano, G. Rigato, Kyriaki Kalimeri, Ailbhe N. Finnerty, F. Pianesi, N. Sebe, A. Pentland","doi":"10.1109/SocialCom-PASSAT.2012.71","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.71","url":null,"abstract":"This paper presents the SocioMetric Badges Corpus, a new corpus for social interaction studies collected during a 6 weeks contiguous period in a research institution, monitoring the activity of 53 people. The design of the corpus was inspired by the need to provide researchers and practitioners with: a) raw digital trace data that could be used to directly address the task of investigating, reconstructing and predicting people's actual social behavior in complex organizations, b) information about participants' individual characteristics (e.g., personality traits), along with c) data concerning the general social context (e.g., participants' social networks) and the specific situations they find themselves in.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"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":"129523584","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}
引用次数: 45
Individual and Group Dynamics in the Reality Mining Corpus 现实挖掘语料库中的个体和群体动力学
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.75
Charlie K. Dagli, W. Campbell
{"title":"Individual and Group Dynamics in the Reality Mining Corpus","authors":"Charlie K. Dagli, W. Campbell","doi":"10.1109/SocialCom-PASSAT.2012.75","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.75","url":null,"abstract":"Though significant progress has been made in recent years, traditional work in social networks has focused on static network analysis or dynamics in a large-scale sense. In this work, we explore ways in which temporal information from sociographic data can be used for the analysis and prediction of individual and group behavior in dynamic, real-world situations. Using the MIT Reality Mining corpus, we show how temporal information in highly-instrumented sociographic data can be used to gain insights otherwise unavailable from static snapshots. We show how pattern of life features extend from the individual to the group level. In particular, we show how anonymized location information can be used to infer individual identity. Additionally, we show how proximity information can be used in a multilinear clustering framework to detect interesting group behavior over time. Experimental results and discussion suggest temporal information has great potential for improving both individual and group level understanding of real-world, dense social network data.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"122 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":"129079070","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
Enhancing Query Expansion through Folksonomies and Semantic Classes 通过大众分类法和语义类增强查询扩展
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SOCIALCOM-PASSAT.2012.67
Claudio Biancalana, Fabio Gasparetti, A. Micarelli, G. Sansonetti
{"title":"Enhancing Query Expansion through Folksonomies and Semantic Classes","authors":"Claudio Biancalana, Fabio Gasparetti, A. Micarelli, G. Sansonetti","doi":"10.1109/SOCIALCOM-PASSAT.2012.67","DOIUrl":"https://doi.org/10.1109/SOCIALCOM-PASSAT.2012.67","url":null,"abstract":"Adaptive query expansion (QE) allows users to better define their search domain by supplementing the original query with additional terms related to their preferences and information needs. The system we present is an extension of the traditional QE techniques, which rely on the computation of two-dimensional co-occurrence matrices. Our system makes use of three-dimensional co-occurrence matrices, where the added dimension is represented by semantic classes (i.e., categories comprising all the terms that share a semantic property) related to the folksonomy extracted from social book marking services such as delicious, Digg, and Stumble Upon. The results of an indepth experimental evaluation on artificial datasets and real users show that our system outperforms some well-known approaches in the literature, as well as a state-of-the-art search engine.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"33 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":"132354448","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
With a Little Help from the Crowd: Receiving Unauthorized Academic Assistance through Online Labor Markets 从人群中获得一点帮助:通过在线劳动力市场获得未经授权的学术援助
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.140
Christopher G. Harris, P. Srinivasan
{"title":"With a Little Help from the Crowd: Receiving Unauthorized Academic Assistance through Online Labor Markets","authors":"Christopher G. Harris, P. Srinivasan","doi":"10.1109/SocialCom-PASSAT.2012.140","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.140","url":null,"abstract":"Although a vast majority of crowd sourcing tasks are for ethical purposes, the anonymity and global reach of online labor markets also create a clearinghouse for unethical crowd sourcing tasks. Recent studies show a majority of students have engaged in academic dishonesty using the Internet, and a growing number find this behavior is acceptable. We conduct a study to see if crowd workers will provide solutions to exams and homework assignments, and knowingly permit these solutions to be used for this purpose. For those who don't agree, we examine if additional financial incentives can entice them. Our findings indicate most crowd workers are willing to permit the use of their work, however, for those that are unwilling, additional financial incentives have little effect on altering their decision.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"423 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":"134219061","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
Understanding Social Machines 理解社交机器
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SOCIALCOM-PASSAT.2012.25
Ramine Tinati, L. Carr
{"title":"Understanding Social Machines","authors":"Ramine Tinati, L. Carr","doi":"10.1109/SOCIALCOM-PASSAT.2012.25","DOIUrl":"https://doi.org/10.1109/SOCIALCOM-PASSAT.2012.25","url":null,"abstract":"This framework introduced in this paper aims to reflect the characteristics that social machines have been described to have. The framework uses a mixed methods approach underpinned by social theory to provide a detailed and rich understanding of the socio-technical nature of a social machine. The strength of this lies in the diversity of the data being used; whilst the quantitative approach can provide mathematical rigor to the structure and properties of the networks and appreciate its scale, the qualitative approach seeks to examine the `social relations' [12], and the context to how the social machine is enabling humans and technologies to interact and shape each other. Like many studies using empirical-based research [10], this framework takes advantage of the complementary nature that mixed methods offers, and pushes it further by using an analytical socio-technical lens.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"115 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":"117131453","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
Decoding Social Influence and the Wisdom of the Crowd in Financial Trading Network 解读金融交易网络中的社会影响力与群体智慧
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing Pub Date : 2012-09-03 DOI: 10.1109/SocialCom-PASSAT.2012.133
Wei Pan, Yaniv Altshuler, A. Pentland
{"title":"Decoding Social Influence and the Wisdom of the Crowd in Financial Trading Network","authors":"Wei Pan, Yaniv Altshuler, A. Pentland","doi":"10.1109/SocialCom-PASSAT.2012.133","DOIUrl":"https://doi.org/10.1109/SocialCom-PASSAT.2012.133","url":null,"abstract":"In this paper, we study roles of social mechanisms in a financial system. Our data come from a novel on-line foreign exchange trading brokerage for individual investors, which also allows investors to form social network ties between each other and copy others' trades. From the dataset, we analyze the dynamics of this connected social influence systems in decision making processes. We discover that generally social trades outperform individual trades, but the social reputation of the top traders is not completely determined by their performance due to social feedback even when users are betting their own money. We also find that social influence plays a significant role in users' trades, especially decisions during periods of uncertainty. We report evidences suggesting that the dynamics of social influence contribute to market overreaction.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"34 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":"116178435","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}
引用次数: 103
下一页 尾页
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学术官方微信