By Topic

Computational Aspects of Social Networks (CASoN), 2011 International Conference on

Date 19-21 Oct. 2011

Filter Results

Displaying Results 1 - 25 of 52
  • [Title page]

    Page(s): i - xv
    Save to Project icon | Request Permissions | PDF file iconPDF (164 KB)  
    Freely Available from IEEE
  • Core/periphery structure versus clustering in international weblogs

    Page(s): 1 - 6
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (308 KB) |  | HTML iconHTML  

    When analyzing social networks, centrality and community identification are among the most popular topics for researchers. Depending on their motivation and the resulting hypothesis, they usually focus on one of these two structural properties, leaving the other aspect aside. In this paper we investigate the relation between structural centralization, which follows a core/periphery model, and structural clustering, which is given by more or less disjoint cohesive groups. We present our concept of Group Adjacency Matrices for graphical evaluations of such structures, and analyze these properties in networks of top blogs in six different languages. We show that the two properties are present in parallel in our datasets, making the respective identification more difficult. We want to raise awareness of this potential issue, and demonstrate that the knowledge about the clustering structure in a network can be utilized to make the analysis of the core/periphery structure more reliable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What did you say? A cross-cultural analysis of the distributive communicative behaviors of global virtual teams

    Page(s): 7 - 12
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (150 KB) |  | HTML iconHTML  

    In this empirical study, the general research question is “How do cultural values impact the global virtual teams (GVTs) practices when they communicate and collaborate using computer mediated communication (CMC)?” In particular, we explore the phenomenon of Malaysian GVTs working with culturally diverse members at a distance. In order to obtain in-depth understanding of such phenomenon, we employed a qualitative research methodology. We conducted semi-structured interviews with twenty-two (22) managers (from middle to high level) working in government link corporations (GLCs) and multinational corporations (MNCs). We found that there were distinctive intercultural communicative behaviors, all rooted in their diverse cultural values, beliefs, and attitudes. We establish interesting insights and understanding of computer mediated communication behaviors pertaining to patterns of usage and decision making processes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulation of Online Social Networks with Krowdix

    Page(s): 13 - 18
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (276 KB) |  | HTML iconHTML  

    Online Social Networks (OSNs) are a key phenomenon of Internet. Simulations are widely used in their study as means to harness their size and complexity, and to overcome the difficulties to set up experiments in real environments. However, these tools are still limited. They are usually focused on the structure of relationships and emulate changes only from statistical data. This approach is unsuitable to study OSN evolution as a result of the personal attributes and behaviours of their members. Our work addresses this issue with an agent-based simulation framework for OSNs called Krowdix. It provides support to specify simulations of discrete time where agents represent members acting according to their profiles and context. This context comprehends the environment, other agents, groups of agents and the whole network. Agent actions are responsible of network changes. Additionally, system actions can be used to represent unexpected events. This agent-based approach facilitates the translation of actual observations to simulation models, and explaining networks in terms of their members. A case study on Facebook illustrates the use of the framework. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Social relevance of topological communities in ad hoc communication networks

    Page(s): 19 - 24
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (195 KB) |  | HTML iconHTML  

    In this article, we investigate the social relevance of dynamic community structures that can be determined on dynamic communication networks. We first present and validate SAND/SHARC (Stability And Network Dynamics over Sharper Heuristic for Assignment of Robust Communities), a distributed algorithm for community detection. Then, based on real-world communication traces and social information, we evaluate how the structures found by SAND/SHARC can be translated to social links and favor interaction between users with similar social characteristics. Such a study is important to envision community detection algorithm in the design of ubiquitous social interaction protocols, like those used in mobile social networks (MoSoNets). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards the implementation of an internet-based neighbourhood watch scheme-Impacts of inclusive technologies on societies

    Page(s): 25 - 30
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (160 KB) |  | HTML iconHTML  

    In this paper we discuss the current state of our work regarding the development and planned in-situ testing of a computer-based system to enhance community relations through the Neighbourhood Watch scheme. The system is intended for use in a community to help the residents interact with each other more easily and to encourage the reporting of suspicious behaviour or crime. We discuss some details of the system and how we plan to test it in the field using an iterative process. We also discuss the possible implications of the work for the future. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comparison of influence metrics in information diffusion networks

    Page(s): 31 - 36
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1139 KB) |  | HTML iconHTML  

    The importance of social networks has pushed the analysis of the interactions among their users. The fact that a user may influence their friends or the friends of their friends makes the study of these social interactions necessary for many disciplines. We design a flexible model that can be mapped to many social-like networks. Specifically, we study and compare three of these networks: Enron, Twitter and Scopus. We present a comparison of several variables of influence and how important they are in each network. In addition, we study how correlated they are and the depth of influence propagation. We observe that in general variables exhibit correlation between them but they are not strongly correlated when we study the most influencing users. Finally, the influence is not very deep in all cases which means that influence propagation is generally local. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A novel social network platform by using e-marketing and evaluating models

    Page(s): 37 - 41
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (221 KB) |  | HTML iconHTML  

    Social networking system is not just for seeking and keeping customers but it has also proven to be a highly effective business tool. On the other hand, E-Tourism marketing and its technology cause the change of power balance between the industries and the service companies by providing better harmony between organizations, practical and easier method of production, less error in input and output data and the increasing accuracy, while causing complexity in programming and editing the approaches. There are many problems in integrated management of social networks. The majority of E-commerce models are based on traditional approaches without considering the electronic revolution of the recent decades. By using the analyze model of SWOT and by recognizing the fundamental properties of international e-tourism marketing, one can present some strategies to find a balance between the environment data and the digital data. In this paper, we propose some recommendations to improve the performance of E-tourism by using SWOT output results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Privacy-preserving profile matching using the social graph

    Page(s): 42 - 47
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (259 KB) |  | HTML iconHTML  

    We present a privacy-preserving protocol for users to test a match with potential new friends in an environment where all users cryptographically encrypt their private information. The following scenario is considered. Suppose that user Alice thinks that Bob might be a good new friend. So, Alice and the Online Social Network (representing Bob) engage in a two-party matching protocol. In this protocol no work from Bob is required, Bob can be offline. The matching protocol is designed to give Alice an indication if Bob is similar to her based on their profiles. We show that the process does so without revealing the private information of Alice and Bob to one another and to the Online Social Network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed collaboration models for social networks

    Page(s): 48 - 53
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (342 KB) |  | HTML iconHTML  

    In this paper, we model social networks from a memory-consistency perspective, which is based on partial order constraints of interaction histories. Unlike previous research which focuses on studying social interaction, our modelling is targeted for virtual community application designers. An intuitive collaboration model (post-reply) is formally defined, where social network participants interact through a collection of shared objects. Then, two distribution models for these shared objects are formally defined, one is based on replication and the other is based on partitioning of the shared objects. We prove that if interaction is limited to three operations: POST, REPLY, and QUERY, then these distribution models passively admit post-reply. However, if the social network allows UPDATE actions, then the social network implementation requires additional synchronization measures between the replicas or partitions in order to correctly support post-reply collaboration. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Primary role identification in dynamic social networks

    Page(s): 54 - 59
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (225 KB) |  | HTML iconHTML  

    Social networks often forms very complex structures that additionally change over time. Description of actors' roles in such structures requires to take into account this dynamics reflecting behavioral characteristics of the actors. A role can be defined as a sequence of different types of activities. Various types of activities are modeled by pattern subgraphs, whereas sequences of these activities are modeled by sequence diagrams. For such defined roles, a role identification procedure is proposed assigning to each actor his or her primary role played in a dynamic social network. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bio-inspired algorithm for searching relationships in Social Networks

    Page(s): 60 - 65
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (332 KB) |  | HTML iconHTML  

    Nowadays the Social Networks are experiencing a growing importance. The reason of this is that they enable the information exchange among people, meeting people in the same field of work or establishing collaborations with other research groups. In order to manage social networks and to find people inside them, they are usually represented as graphs with persons as nodes and relationships between them as edges. Once this is done, establishing contact with anyone involves searching the chain of people to reach him/her, that is, the search of the path inside the graph which joins two nodes. In this paper, a new algorithm based on nature is proposed to realize this search: SoS-ACO (Sense of Smell - Ant Colony Optimization). This algorithm improves the classical ACO algorithm when it is applied in huge graphs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Friendlink: Link prediction in social networks via bounded local path traversal

    Page(s): 66 - 71
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (244 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A computational model to textual extraction and construction of social and complex networks

    Page(s): 72 - 75
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (273 KB) |  | HTML iconHTML  

    This work aims presenting a computational modeling to extract specific data from textual repository, in order to build social and complex networks. These networks structures are implicit in texts. This paper presents the model process, which involves text mining by regular expressions, and the construction of networks. To validate the model, an experimental procedure was applied to build scientific collaboration networks in the context of post-graduation programs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new genetics-based diffusion model for social networks

    Page(s): 76 - 81
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (187 KB) |  | HTML iconHTML  

    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'. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generating private recommendations in a social trust network

    Page(s): 82 - 87
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (220 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A portable and extensible community object

    Page(s): 88 - 93
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (712 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking changes in dynamic information networks

    Page(s): 94 - 101
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (534 KB) |  | HTML iconHTML  

    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. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Category-based routing in social networks: Membership dimension and the small-world phenomenon

    Page(s): 102 - 107
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (209 KB) |  | HTML iconHTML  

    A classic experiment by Milgram shows that individuals can route messages along short paths in social networks, given only simple categorical information about recipients (such as “he is a prominent lawyer in Boston” or “she is a Freshman sociology major at Harvard”). That is, these networks have very short paths between pairs of nodes (the so-called small-world phenomenon); moreover, participants are able to route messages along these paths even though each person is only aware of a small part of the network topology. Some sociologists conjecture that participants in such scenarios use a greedy routing strategy in which they forward messages to acquaintances that have more categories in common with the recipient than they do, and similar strategies have recently been proposed for routing messages in dynamic ad-hoc networks of mobile devices. In this paper, we introduce a network property called membership dimension, which characterizes the cognitive load required to maintain relationships between participants and categories in a social network. We show that any connected network has a system of categories that will support greedy routing, but that these categories can be made to have small membership dimension if and only if the underlying network exhibits the small-world phenomenon. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SoSIReČR - IT professional social network

    Page(s): 108 - 113
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (422 KB) |  | HTML iconHTML  

    This paper describes the concept of a social network of the ICT specialists in the regions of the Czech Republic. In particular, we focus on the web portal under development, i.e. a software tool serving for the network implementation. Associated activities concerning collecting and analyzing ICT requirements from companies and educational ICT knowledge of university graduates are presented. The novelty of our approach is in focusing on specificities of the social network (entities and relationships specific for ICT) and in the concept of professional profile (PP). Professional profiles enable to express the ICT focus of a given entity (e.g., person, research team or project) in a structured way. Based of the PP concept, we introduce specific portal functionalities which are not offered by existing portals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Social Media in the context of Academic Marketing — Case study: The Umwelt-Campus Blog

    Page(s): 114 - 119
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (490 KB) |  | HTML iconHTML  

    Academic Marketing is on the rise in Germany. So is Social Media Marketing. In this paper we present a concept for academic marketing based on a social media marketing strategy developed and implemented at the Environmental Campus Birkenfeld, a site of Trier University of Applied Sciences. We discuss the development and implementation of this strategy starting from an evaluation of the use and needs of social media of students, professors and other university staff. This survey provides the basis for the requirements analysis for a platform for internal and external communication, whose structure is presented here. We outline some considerations about launching such a platform and we report some very first results in terms of user acceptance and feedback. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Social networking APIs for companies — An example of using the Facebook API for companies

    Page(s): 120 - 123
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (157 KB) |  | HTML iconHTML  

    The use and integration of social networks is becoming increasingly important to many companies. Such networks are used within a company not only to publish information, but also to recruit new customers. Of particular interest is the provision of a vehicle for direct, effective communication between the company and its customers. Most of the well-known social networks provide what are known as “Application Programming Interfaces” (APIs), which provide flexible tools to enhance and customize the use of the networking platform. We discuss the uses and possibilities of APIs using Facebook as an example. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context and social networks interaction modeling for context aware alert systems

    Page(s): 124 - 129
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (637 KB) |  | HTML iconHTML  

    Web 2.0 allows users to freely publish information regarding several subjects. Social content websites may take advantage of such by creating means for dissemination and creation of collaborative knowledge. However, an adequate environment is needed for the insertion of such information on social content websites. Mobile 2.0 incorporates some Web 2.0 concepts on mobile platforms using context-aware information captured from sensors, like GPS. This paper presents a model based on social content websites that uses context ontologies for the provision of personalized services on mobile platforms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solearn: A Social Learning Network

    Page(s): 130 - 135
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (349 KB) |  | HTML iconHTML  

    We have assisted the development of a significant number of e-learning systems, which have achieved great success in distance teaching and education, but most of these systems present some limitations and some disadvantages. Most of them are closed where learning resources are fixed and the adaptability, the flexibility, and social relations are ignored and in most cases are not taken into account at all, actors of such systems tend to have a minimal collaborative navigation, awareness features and social relations analysis and they often find themselves isolated without sensing what the rest of learning community is doing. Significantly, new technologies had recently emerged: the social concepts and the social awareness features leading significant change to collaboration and learning. These emerging technologies are increasingly being adopted to improve remote education and providing better enhancement for learning. These improvements are offered to students who, regardless of their computer systems, can collaborate to improve their cognitive and social skills. In this article, we present the concepts of a new learning paradigm: CSSL (Computer Supported Social Learning) and we have implemented a first prototype called SoLearn that groups some of those concepts. SoLearn (A Social Learning Network) aims to provide its users with a new learning experience based on social networks and enhanced with social awareness concepts. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconstruction of a social network graph from incomplete call detail records

    Page(s): 136 - 140
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (268 KB) |  | HTML iconHTML  

    Real-life call detail data (CDR) are used to build a graph of a social network of telecommunication operator customers. Affiliation network is used in graph construction since CDR data are partially kept anonymous. A number of the resulting network properties are examined to prove the correctness of the graph construction algorithm. Cliques in the network and network dynamics are analyzed; suggestions are given about possible utilization of the obtained information in the operation of a telecommunication operator. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.