Abstract — Exploiting the concepts of social networking rep-resents a novel approach to the approximate similarity query processing. We present a metric social network where relations between peers, giving similar results, are established on per-query basis. Based on the universal law of generalization, a new query forwarding algorithm is proposed. The same principle is used to manage query histories of individual peers with the possibility to tune the tradeoff between the extent of the history and the level of the query-answer approximation. All algorithms are tested on real data and real network of computers. I
Similarity join is an interesting complement of the well-established similarity range and nearest ne...
Similarity search is a fundamental problem in network analysis and can be applied in many applicatio...
Similarity search is a fundamental problem in network analysis and can be applied in many applicatio...
Exploiting the concepts of social networking represents a novel approach to the approximate similari...
Abstract. In this paper we tackle the issues of exploiting the concepts of social networking in proc...
Similarity estimation between nodes based on structural properties of graphs is a basic building blo...
Online social networks have provided a promising communication platform for an activity inherently d...
In this paper we present some preliminary results on the processing of similarity queries in a self-...
In this paper we present some preliminary results on the processing of similarity queries in a self-...
In this paper we present some preliminary results on the processing of similarity queries in a self-...
Abstract. Peer-to-peer systems constitute a promising solution for de-ploying novel applications, su...
The goal of a similarity search system is to allow users to retrieve data that presents a required s...
Aggregate similarity search, a.k.a. aggregate nearest neighbor (Ann) query, finds many useful applic...
<p>We first calculate pairwise similarities between users via cosine similarity measure or Jaccard i...
Abstract—Discovering similar objects in a social network has many interesting issues. Here, we prese...
Similarity join is an interesting complement of the well-established similarity range and nearest ne...
Similarity search is a fundamental problem in network analysis and can be applied in many applicatio...
Similarity search is a fundamental problem in network analysis and can be applied in many applicatio...
Exploiting the concepts of social networking represents a novel approach to the approximate similari...
Abstract. In this paper we tackle the issues of exploiting the concepts of social networking in proc...
Similarity estimation between nodes based on structural properties of graphs is a basic building blo...
Online social networks have provided a promising communication platform for an activity inherently d...
In this paper we present some preliminary results on the processing of similarity queries in a self-...
In this paper we present some preliminary results on the processing of similarity queries in a self-...
In this paper we present some preliminary results on the processing of similarity queries in a self-...
Abstract. Peer-to-peer systems constitute a promising solution for de-ploying novel applications, su...
The goal of a similarity search system is to allow users to retrieve data that presents a required s...
Aggregate similarity search, a.k.a. aggregate nearest neighbor (Ann) query, finds many useful applic...
<p>We first calculate pairwise similarities between users via cosine similarity measure or Jaccard i...
Abstract—Discovering similar objects in a social network has many interesting issues. Here, we prese...
Similarity join is an interesting complement of the well-established similarity range and nearest ne...
Similarity search is a fundamental problem in network analysis and can be applied in many applicatio...
Similarity search is a fundamental problem in network analysis and can be applied in many applicatio...