2011 International Conference on Computational Aspects of Social Networks (CASoN)最新文献_第3页

A portable and extensible community object 一个可移植和可扩展的社区对象

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085924

Y. S. Huang, S. Tsai, C. M. Lee, G. Huang, U. Dai, H. C. Jiau

{"title":"A portable and extensible community object","authors":"Y. S. Huang, S. Tsai, C. M. Lee, G. Huang, U. Dai, H. C. Jiau","doi":"10.1109/CASON.2011.6085924","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085924","url":null,"abstract":"Many community networks have emerged on the Internet. They provide various functionalities to serve the community users. However, most of the community networks lacks of the convenient tools in packaging the information users are interested in. Therefore, the information posted and exchanged in the community networks is not easy to be extracted and reused somewhere else. In another aspect, the functions and services provided by the community networks are not fully satisfactory to most users. The community networks in general do not provide the mechanism to extend or modify the functions or services provided for users. In this paper, we apply the information object model to construct a portable and extensible community object for organize a small and personalized virtual community. An actor object and a community object are applied to serve as a user and a community respectively. The actor object is an entity represents the user. A service which is provided or needed by the user can be installed to the entity as a method of the actor object. Similarly, the community object is an entity represents the community. A service provided by the community can be installed to the community object as a method. In our development, an actor object or a community object is basically an information object which is portable and extensible in functionality. We will describe the basic concept of the actor object and the community object and the design of the prototype system developed on the Web platform.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129525027","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

Primary role identification in dynamic social networks 动态社会网络中的主要角色识别

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085918

R. Brendel, H. Krawczyk

引用次数: 5

Visual investigation of similarities in Global Terrorism Database by means of synthetic social networks 基于合成社会网络的全球恐怖主义数据库相似性可视化研究

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085954

J. Gorecki, K. Slaninová, V. Snás̃el

引用次数: 8

Modelling strategic information for networks during collaboration 协作过程中网络战略信息建模

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085956

C. Durugbo

引用次数: 0

Forcoa.NET: An interactive tool for exploring the significance of authorship networks in DBLP data Forcoa。一个交互式工具，用于探索作者网络在DBLP数据中的意义

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085955

Z. Horak, M. Kudelka, V. Snás̃el, A. Abraham, H. Řezanková

引用次数: 19

Generating private recommendations in a social trust network 在社会信任网络中生成私人推荐

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085923

Z. Erkin, T. Veugen, R. Lagendijk

{"title":"Generating private recommendations in a social trust network","authors":"Z. Erkin, T. Veugen, R. Lagendijk","doi":"10.1109/CASON.2011.6085923","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085923","url":null,"abstract":"Recommender systems have become increasingly important in e-commerce as they can guide customers with finding personalized services and products. A variant of recommender systems that generates recommendations from a set of trusted people is recently getting more attention in social networks. However, people are concerned about their privacy as the information revealed in recommender systems, particularly in social networks, can be misused easily. A way to eliminate the privacy risks is to make the privacy-sensitive data inaccessible by means of encryption. While the private data is inaccessible to any outsiders and the server, the same functionality of the system can be achieved by processing the encrypted data. Unfortunately, the efficiency of processing encrypted data constitutes a big challenge. In this paper, we present a privacy-enhanced recommender system in a social trust network, which is designed to be highly efficient. The cryptographic protocol for generating recommendations is based on homomorphic encryption and secure multi-party computation techniques. The additional overhead with regard to computation and communication is minimized by packing data. The experimental results show that our proposal is promising to be deployed in real world.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121747836","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}

引用次数: 16

An effort based social diffusion approach for mobile encounter networks 基于努力的移动相遇网络社会扩散方法

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085935

Bernhard Klein, H. Hlavacs

{"title":"An effort based social diffusion approach for mobile encounter networks","authors":"Bernhard Klein, H. Hlavacs","doi":"10.1109/CASON.2011.6085935","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085935","url":null,"abstract":"Mobile information systems use publish-subscribe mechanisms to distribute content between users. Unfortunately, content that is close to the user is not necessarily accessible unless users have specified so earlier. Mobile encounter networks (MENs) represent an alternative, which spread content in a spatial diffusion process. A drawback of MENs is their high resource usage. Some researchers have proposed diffusion methods that utilize knowledge about the social network behind the user community. Such approaches work well in the wired Internet since robust bandwidths exist. This, however, cannot be assumed for MENs where the bandwidth is determined by the encounter duration. We use an effort based knowledge diffusion approach to solve this problem. Effort based diffusion mechanisms differentiate between simple and complex content types and adapt content exchanges to the capabilities of involved peers. We emulate content diffusion between humans with an urban simulator. During the simulation we obtain data about content exchanges and cached contents. Results show that the least effort theory outperforms traditional approaches. Being aware of content transfer efforts, such routing approaches increase the overall transparency of large scale urban communities and to the same time enable richer content exchanges within friend networks.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125185499","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

A bio-inspired algorithm for searching relationships in Social Networks 一种在社交网络中搜索关系的仿生算法

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085919

Jessica Rivero-Espinosa, D. Cuadra, Francisco Javier Calle-Gómez, P. I. Viñuela

引用次数: 9

Application of social network to improve effectiveness of classifiers in churn modelling 应用社会网络提高分类器在客户流失建模中的有效性

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085947

Witold Gruszczynski, P. Arabas

引用次数: 4

A new genetics-based diffusion model for social networks 基于遗传的社交网络扩散新模型

2011 International Conference on Computational Aspects of Social Networks (CASoN) Pub Date : 2011-12-01 DOI: 10.1109/CASON.2011.6085922

Liangxiu Li, Shenghong Li, Xiuzhen Chen

{"title":"A new genetics-based diffusion model for social networks","authors":"Liangxiu Li, Shenghong Li, Xiuzhen Chen","doi":"10.1109/CASON.2011.6085922","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085922","url":null,"abstract":"A variety of stochastic diffusion models are used to simulate spreading processes in networks, but they focus on either one single object or exclusive objects spreading. In this paper, a genetics-based diffusion model (GDM) is introduced as a general model. It can simulate multiple objects with different relationships spreading in social networks. To simulate information diffusion, GDM regards an individual in a network as a ‘chromosome’, and a message that spreads in as a ‘gene’, and specifies a rule for the interactions between chromosomes to model the information interactions between individuals. We find that when modeling one single message spreading in networks, GDM would be exactly the same with the SI (Susceptible-Infected) case of independent cascade model. Besides, GDM can model many other cases of spreading processes, including competing processes. By applying GDM to simulating different cases of information diffusion process, we get many interesting results, including ‘break point’ in a diffusion process. The diffusion scale of a piece of information hardly increases before this point, but increases rapidly after it. So if we want to limit the diffusion scale of a piece of information, it would be very effective to block the propagation paths before its ‘break point’.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115225030","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