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

Social relevance of topological communities in ad hoc communication networks 自组织通信网络中拓扑社区的社会相关性

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

Guillaume-Jean Herbiet, P. Bouvry, F. Guinand

引用次数: 5

Friendlink: Link prediction in social networks via bounded local path traversal Friendlink:基于有界局部路径遍历的社交网络链接预测

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

Alexis Papadimitriou, P. Symeonidis, Y. Manolopoulos

{"title":"Friendlink: Link prediction in social networks via bounded local path traversal","authors":"Alexis Papadimitriou, P. Symeonidis, Y. Manolopoulos","doi":"10.1109/CASON.2011.6085920","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085920","url":null,"abstract":"Online social networks (OSNs) like Facebook, Myspace, and Hi5 have become popular, because they allow users to easily share content or expand their social circle. OSNs recommend new friends to registered users based on local graph features (i.e. based on the number of common friends that two users share). However, OSNs do not exploit all different length paths of the network. Instead, they consider only pathways of maximum length 2 between a user and his candidate friends. On the other hand, there are global approaches, which detect the overall path structure in a network, being computationally prohibitive for huge-size social networks. In this paper, we provide friend recommendations, also known as the link prediction problem, by traversing all paths of a bounded length, based on the “algorithmic small world hypothesis”. As a result, we are able to provide more accurate and faster friend recommendations. We perform an extensive experimental comparison of the proposed method against existing link prediction algorithms, using two real data sets (Hi5 and Epinions). Our experimental results show that our FriendLink algorithm outperforms other approaches in terms of effectiveness and efficiency in both real data sets.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"16 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":"116639900","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}

引用次数: 41

Web social networks meters and business usage analisys 网络社交网络计量和商业使用分析

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

H. Tavante, M. P. Coutinho

引用次数: 5

On the temporal analysis of scientific network evolution 科学网络演化的时间分析

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

F. Amblard, A. Casteigts, P. Flocchini, Walter Quattrociocchi, N. Santoro

引用次数: 27

An ontology-based repository for a spontaneous social network 用于自发社交网络的基于本体的存储库

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

B. Silva, C. Costa, D. Zaupa, Gustavo Freitas

引用次数: 6

Social networking for anonymous communication systems: A survey 匿名通信系统的社会网络:调查

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

R. Marques, A. Zúquete

引用次数: 6

Log management comprehensive architecture in Security Operation Center (SOC) SOC (Security Operation Center)日志管理综合架构

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

Afsaneh Madani, Saed Rezayi, Hossein Gharaee

{"title":"Log management comprehensive architecture in Security Operation Center (SOC)","authors":"Afsaneh Madani, Saed Rezayi, Hossein Gharaee","doi":"10.1109/CASON.2011.6085959","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085959","url":null,"abstract":"With the widespread use of information, variety of security logs have increased greatly, which due need for security log management. Organizations requirements have imposed to collect, store, and analyze tremendous volumes of log data across entire infrastructure for extended durations and at increasingly granular levels. It is the process of generating, transmitting, storing, analyzing, and disposing security log data from network to databases. Due to the wide variety of logs, storing comprises different methods. Recorded events in collection module are processed, normalized and classified. Logs are stored in storage module in order to use in forensic, reviewing, auditing and providing further necessities of correlation module. Routine log correlation analysis is beneficial for identifying security incidents, policy violations, fraudulent activities, troubleshooting and operational network problems. So log management is an important and efficient activity in network monitoring. Finding an effective log management functional architecture for network events analysis is the main goal of this paper. In this paper, we aim to suggest log management architecture with more common functions that are used by vendors. By studying logging architectures the main functions are administration of log collection, normalizing, categorization, queuing prioritizing and storing logged events/alarms by sensors. Log functions are different but the suitable architecture must justify the functions to send a normative, synchronized and prioritized log in an efficient way. The mentioned functions are gathered from SIEM products characteristics. Suggested architecture includes functions and activities in log collection server and storage server.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"74 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":"124650484","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}

引用次数: 28

Distributed collaboration models for social networks 社交网络的分布式协作模型

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

J. Kawash

引用次数: 0

Tracking changes in dynamic information networks 跟踪动态信息网络的变化

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

M. Takaffoli, Justin Fagnan, Farzad Sangi, Osmar R Zaiane

{"title":"Tracking changes in dynamic information networks","authors":"M. Takaffoli, Justin Fagnan, Farzad Sangi, Osmar R Zaiane","doi":"10.1109/CASON.2011.6085925","DOIUrl":"https://doi.org/10.1109/CASON.2011.6085925","url":null,"abstract":"Social network analysis is a discipline that has emerged to analyze social structures and information networks to uncover patterns of interaction among the vertices in the network. Most social networks are dynamic, and studying the evolution of these networks over time could provide insight into the behavior of individuals expressed by the nodes in the graph and the flow of information among them. In a dynamic network, communities, which are groups of densely interconnected nodes, are affected by changes in the underlying population. The analysis of communities and their evolutions can help determine the shifting structural properties of the networks. We present a framework for modeling and detecting community evolution over time. First, our proposed community matching algorithm efficiently identifies and tracks similar communities over time. Then, a series of significant events and transitions are defined to characterize the evolution of networks in terms of its communities and individuals. We also propose two metrics called stability and influence metrics to describe the active behavior of the individuals. We present experiments to explore the dynamics of communities on the Enron email and DBLP datasets. Evaluating the events using topics extracted from the detected communities demonstrates that we can successfully track communities over time in real datasets.","PeriodicalId":342597,"journal":{"name":"2011 International Conference on Computational Aspects of Social Networks (CASoN)","volume":"1 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":"129588737","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}

引用次数: 52

Enabling fine-tuned relationship and privacy in social networks 在社交网络中实现微调关系和隐私

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

Antoine Fressacourt, Colombe Hérault, Marie Blin, Stéphane Cauchie

引用次数: 0