2013 Fifth International Conference on Computational Aspects of Social Networks最新文献

Finding groups of friends who are significant across multiple domains in social networks 在社交网络的多个领域中寻找重要的朋友群

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASoN.2013.6622608

S. Tanbeer, Fan Jiang, C. Leung, Richard Kyle MacKinnon, Irish J. M. Medina

引用次数: 18

Implementing quasi-parallel breadth-first search in MapReduce for large-scale social network mining 在MapReduce中实现准并行宽度优先搜索，用于大规模社交网络挖掘

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASoN.2013.6622606

L. Qian, Lei Fan, Jianhua Li

{"title":"Implementing quasi-parallel breadth-first search in MapReduce for large-scale social network mining","authors":"L. Qian, Lei Fan, Jianhua Li","doi":"10.1109/CASoN.2013.6622606","DOIUrl":"https://doi.org/10.1109/CASoN.2013.6622606","url":null,"abstract":"Online social networks like Weibo and Twitter consist of billions of users and connections, and traditional approaches which are based on serial algorithms and leveraged only a single node or even a single core cannot suffice the that scale of data any more. We propose new distributed quasi-parallel breadth-first search scheme, the common graph traversal algorithm, based on the MapReduce framework, which has better performance (up to one scale of magnitude less time complexity for single-source cases or even better for multiple-source cases) than Pegasus, the state-of-the-art graph mining library, in terms of the complexity of computation and the I/O load. We apply our algorithms on the Weibo dataset, crawled from its website, which contains 135 million users and 10.2 billion directed connections among them, and occupies up to 400 gigabytes. The dataset is by far the largest one of online social networks in research. Based on the Weibo dataset with extremely skewed degree distribution, we give the empirical time complexity and I/O load analysis in each iteration of our proposed methods. Also, We ran the experiments on a 20-node Hadoop cluster to validate our analysis, and the results conform to our predicted empirical results.","PeriodicalId":221487,"journal":{"name":"2013 Fifth International Conference on Computational Aspects of Social Networks","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116710206","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

An opinion mining approach for web user identification and clients' behaviour analysis 一种用于网络用户识别和客户行为分析的意见挖掘方法

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASoN.2013.6622605

G. Dziczkowski, K. Wegrzyn-Wolska, L. Bougueroua

引用次数: 12

Extraction and analysis social networks from process data 从过程数据中提取和分析社会网络

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASoN.2013.6622597

Martin Kopka, M. Kudelka, Jakub Stolfa, Ondrej Kobersky, V. Snás̃el

{"title":"Extraction and analysis social networks from process data","authors":"Martin Kopka, M. Kudelka, Jakub Stolfa, Ondrej Kobersky, V. Snás̃el","doi":"10.1109/CASoN.2013.6622597","DOIUrl":"https://doi.org/10.1109/CASoN.2013.6622597","url":null,"abstract":"Information systems support and ensure the practical running of most critical business processes. There exists or can be reconstructed a record (log) of the process running in the information system with information about the participants and the processed objects for most of the processes. This research was realized in the environment of the enterprise information system SAP. Participants of business processes stand in different relationships. We are interested in the relationships that are not explicitly seen from the process logs, but which are detectable by research methods of social networks and communities in social networks. Our work constructs the social network from the process log in the given context and then it finds communities in this network. Found communities were analyzed using knowledge of the business process and the environment in which the process operates. We found that identified communities have reasonable representation in the actual process, and this opened up a new dimension of knowledge that can be analyzed from the process log. This approach seems to be promising for detailed analysis.","PeriodicalId":221487,"journal":{"name":"2013 Fifth International Conference on Computational Aspects of Social Networks","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129054944","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

Using self-organizing maps for identification of roles in social networks 使用自组织地图识别社会网络中的角色

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASoN.2013.6622598

S. Zehnalova, Z. Horak, M. Kudelka, V. Snás̃el

引用次数: 4

Hippocratic social network 希波克拉底社会网络

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASoN.2013.6622599

R. Bedi, Nitinkumar Rajendra Gove, V. Wadhai

{"title":"Hippocratic social network","authors":"R. Bedi, Nitinkumar Rajendra Gove, V. Wadhai","doi":"10.1109/CASoN.2013.6622599","DOIUrl":"https://doi.org/10.1109/CASoN.2013.6622599","url":null,"abstract":"Social network is a network of people spread across all over the globe. Each social network user has a profile, which stores user's personal information, his likes, interests etc. The number of social network users is growing exponentially, every day. This makes social network an ultimate repository of large user data and an important live information source. The large information available over social network attracts the attention of business, corporate and marketing people. So, these people try mining the user data/profile through different ways. Also, as most of the user profiles are publicly visible, it is very easy to obtain a particular user's information without his concern. This leads to a privacy breach causing leakage of user's private information, without even a hint of it to the user. We studied 100 facebook live user's profiles and facebook privacy policy, to understand the privacy awareness in facebook users. In this paper, we present results of the surveys conducted in this study. We, further, propose a new generic framework named `Hippocratic Social Network', to enhance the personal level privacy in facebook and other online social networking sites.","PeriodicalId":221487,"journal":{"name":"2013 Fifth International Conference on Computational Aspects of Social Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124087512","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

Distributed port-scan attack in cloud environment 云环境下分布式端口扫描攻击

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASoN.2013.6622595

Prachi Deshpande, Aditi Aggarwal, S.C. Sharma, P.Sateesh Kumar, A. Abraham

引用次数: 15

Chinese SNS blog classification using semantic similarity 基于语义相似度的中文SNS博客分类

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASON.2013.6622603

Chenye Shi, Jianhua Li, Jieyuan Chen, Xiuzhen Chen

引用次数: 4

Information integration for detecting communities in attributed graphs 属性图中群体检测的信息集成

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASoN.2013.6622601

J. Cruz, Cécile Bothorel

{"title":"Information integration for detecting communities in attributed graphs","authors":"J. Cruz, Cécile Bothorel","doi":"10.1109/CASoN.2013.6622601","DOIUrl":"https://doi.org/10.1109/CASoN.2013.6622601","url":null,"abstract":"Real social networks can be described using two dimensions: first a structural dimension that contains the social graph, e.g. the actors and the relationships between them, and second a compositional dimension containing the actors' attributes, e.g. their profile. Each of these dimensions can be used independently to cluster the nodes and explain different phenomena occurring on the social network, whether from a connectivity or an individual perspective. In the case of community detection problem, an emergent research field explores how to include relationships and node attributes in an integrated clustering process. In this paper, we present a novel approach which integrate two partitions, one structural and one compositional, after they habe been generated by dedicated and specialized clustering steps. We rely on a contingency matrix with structural groups in rows and compositional ones in columns. The problem is to manipulate rows and columns to provide a new partition which maintains a good trade-off between both dimensions. In this paper we propose two strategies to control the combination. Tested on real-world social networks, the final partitions are evaluated in terms of entropy and density, and compared to pure structural or compositional partitions. The unified partitions show interesting properties, such as cohesive and homogeneous groups of actors. The method offers fine control on the combination process, giving new search capabilities to analysts without requiring the re-computation of the partitions.","PeriodicalId":221487,"journal":{"name":"2013 Fifth International Conference on Computational Aspects of Social Networks","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918946","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

Triads, transitivity, and social effects in user interactions on Facebook Facebook用户互动中的三位一体、传递性和社会效应

2013 Fifth International Conference on Computational Aspects of Social Networks Pub Date : 2013-10-08 DOI: 10.1109/CASoN.2013.6622602

Derek Doran, Huda Alhazmi, S. Gokhale

引用次数: 11