The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Friend of a Friend (FOAF) introductions are an effective means to grow detected social graphs in mobile applications. By detecting triadic closure in the social graph they both introduce co-present users who are not already acquainted, and improve the accuracy of the social graph. We searched for the presence of triadic closure in a real mobile social network, and tested the suitability of FOAF introductions...
Recently, social network privacy becomes a hot issue in the field of privacy. We are concerned about the path nodes in the social network. With the knowledge of the two endpoints of a path, the adversary can attack the privacy of the nodes on this path. In this paper, we define the adversary's background knowledge, propose the anonymity model, and propose PN- Anonymity algorithm to adjust paths. Experimental...
In open environments, deciding if an individual is trustworthy, based on his past behavior, is fundamentally important. To accomplish this, centrality in a so-called feedback graph is often used as a trust measure. The nodes of this graph represent the individuals, and an edge represents feedback that evaluates a past interaction. In the open environments envisioned where individuals can specify for...
Today's world is characterized by the multiplicity of interconnections through many types of links between the people, that is why mining social networks appears to be an important topic. Extracting information from social networks becomes a challenging problem, particularly in the case of the discovery of community structures. Mining bibliographical data can be useful to find communities of researchers...
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional associations in biological pathways. In these domains, there is a need to perform aggregation operations on large-scale networks. Unfortunately the existing implementation of aggregation operations on relational databases does...
With the increasing availability of large social network data, there is also an increasing interest in analyzing how those networks evolve over time. Traditionally, the analysis of social networks has focused only on a single snapshot of a network. Researchers have already verified that social networks follow power-law degree distribution, have a small diameter, and exhibit small-world structure and...
We consider the problem of making graph databases such as social network structures available to researchers for knowledge discovery while providing privacy to the participating entities. We show that for a specific parametric graph model, the Kronecker graph model, one can construct an estimator of the true parameter in a way that both satisfies the rigorous requirements of differential privacy and...
In this paper we propose an approach that allows one to get information about the social network of an individual by complementing the information provided by its (smart)phone with the data publicly available on the net. Our approach is based on a profile graph, whose nodes are the people involved and the (weighted) edges represent their mutual links. In a first phase, a preliminary version of the...
Asynchronous discussion forum can provide a platform for online learners to communicate with one another easily, without the constraint of place and time. This study explores the analysis process of online asynchronous discussion. We focus upon content analysis and social network analysis, which is the technique often used to measure online discussion in formal educational settings. In addition, Soller's...
In this paper, we present a system that optimally and dynamically allocates the available computing resources to virtual machines that support virtual collaboration environments. Such environments are emerging fast via on-line social networks, virtual worlds, and the "Web 3.0" or "collaborative Web" paradigm. We use a utility-based framework to differentiate the applications hosted...
Complex adaptive system (CAS) theory is used to analyze the e-commerce system and the concept of e-commerce transaction network is proposed. The e-commerce transaction network can be viewed as a complex network which is constructed by transaction behaviors between buyers and sellers. Then we give a formal definition of the e-commerce transaction network and establish a multi-agent model for e-commerce...
The emergence of large-scale online social networks has attracted much interest in recent years, and the structure of online social networks has been rigorously studied in the last few years. However, to date, only selected silos of fragmented online social networks have been investigated. This is due to the lack of information about the people who participate in several online social networks. However,...
In the last decade, there has been a massive increase in network research across both the social and physical sciences. In Physics and Mathematics, there have been extensive work on phenomenological models and generative models concerning large networks with applications tobiology and social networks. In the social sciences, on the other hand, much attention has been devoted to the study of personal...
Discovering communities from networks is one of the important and challenging research topics of social network analysis. Although Newman's modularity is often used for evaluating division of unipartite networks, it is not suitable for evaluating division of bipartite networks that are composed of two types of vertices. To compensate for the situation, Guimera and Barber propose bipartite modularities...
In online social networks (OSNs), user connections can be represented as a network. The network formed has distinct properties that distinguish it from other network topologies. In this work, we consider an unstructured keyword based social network topology where each edge has a trust value associated with it to represent the mutual relationship between the corresponding nodes. Users have keywords...
Edges in social network graphs may represent sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge anonymity, called graph confidence, which is general enough to capture the privacy breach made by an adversary who can pinpoint target persons in a graph partition based on any given set of topological features of vertexes...
In this work we define the term of phonebook centric-social networks, describe a graph model and study structural properties of this. The key difference between phonebook-centric social networks and usual social networks is allowing synchronization between the phonebook of the mobile phone and the network. By the synchronization the goal is to identify the persons listed in the phonebook and the network,...
This paper proposes a new approach that uses social networks and common sense deduction rules to adapt the description tags of the photos for the current viewer. We exploit social graphs to enrich the tags associated to the concerned persons in the photo by following the different links between people (i.e. viewer and captured people in the photos). The main contributions of our work are: (i) addition...
We introduce a new data set which contains both a self-declared friendship network and self-chosen attributes from a finite list defined by the social networking site. We propose Gaussian field harmonic functions (GFHF), a state-of-the-art graph transduction algorithm, as a novel way of testing the relevance of the friendship network for predicting individual attributes. We show that the underlying...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.