Towards a personalized Internet: a case for a full decentralization

@article{Kermarrec2013TowardsAP,
  title={Towards a personalized Internet: a case for a full decentralization},
  author={Anne-Marie Kermarrec},
  journal={Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences},
  year={2013},
  volume={371}
}
  • Anne-Marie Kermarrec
  • Published 28 March 2013
  • Computer Science
  • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
The Web has become a user-centric platform where users post, share, annotate, comment and forward content be it text, videos, pictures, URLs, etc. This social dimension creates tremendous new opportunities for information exchange over the Internet, as exemplified by the surprising and exponential growth of social networks and collaborative platforms. Yet, niche content is sometimes difficult to retrieve using traditional search engines because they target the mass rather than the individual… 

Figures from this paper

Decentralizing news personalization systems

TLDR
This thesis exploits peer-to-peer networks to propose a recommendation system to disseminate news in a personalized manner and proposes obfuscation mechanisms to preserve privacy without sacrificing the quality of the recommendation.

Private Peer-to-peer similarity computation in personalized collaborative platforms. (Calcul de similarité confidentiel en pair-à-pair dans les plateformes collaboratives personnalisées)

TLDR
This thesis introduces a two-party cryptographic protocol that ensures differential privacy, a strong notion of privacy, and solves the privacy budget issue that would prevent peers from computing their similarities more than a fixed number of times by introducing the notion of bidirectional anonymous channel.

Open Peer-to-Peer Systems over Blockchain and IPFS: an Agent Oriented Framework

TLDR
This work presents a framework to build peer-to-peer systems using an agent-oriented approach in an open environment where agents have only partial information of the system data, and proposes a distributed architecture for these open systems.

Peer-to-Peer System Design Trade-Offs: A Framework Exploring the Balance between Blockchain and IPFS

TLDR
This work proposes a set of guidelines to design decentralized systems, taking the different trade-offs these technologies face with regard to their consistency requirements into consideration, and illustrated with the design of a decentralized questions and answers system.

Web science: a new frontier

TLDR
During the past 20 years, humans have built the largest information fabric in history; people shop, date, trade and communicate with one another using it.

References

SHOWING 1-10 OF 56 REFERENCES

Exploiting social relations for query expansion and result ranking

TLDR
A framework to cast the different entities of such networks into a unified graph model representing the mutual relationships of users, content, and tags is presented and derives scoring functions for each of the entities and relations.

Exploiting Social Networks for Internet Search

TLDR
It is argued that search techniques could benefit from integrating the different mechanisms used to find relevant content in the Web and social networks, and the potential of integrate the different search techniques used in these systems is speculated on.

SSW: A Small-World-Based Overlay for Peer-to-Peer Search

TLDR
Extensive experiments demonstrate that SSW is superior to the state of the art on various aspects, including scalability, maintenance overhead, adaptivity to distribution of data and locality of interest, resilience to peer failures, load balancing, and efficiency in support of various types of queries on data objects with high dimensions.

Epidemic-Style Management of Semantic Overlays for Content-Based Searching

TLDR
This paper proposes a proactive method to build a semantic overlay based on an epidemic protocol that clusters peers with similar content, and is worth noting that this peer clustering is done in a completely implicit way, that is, without requiring the user to specify his preferences or to characterize the content of files he shares.

Social ranking: uncovering relevant content using tag-based recommender systems

TLDR
This paper proposes Social Ranking, a method that exploits recommender system techniques to increase the efficiency of searches within Web 2.0, and proposes a mechanism to answer a user's query that ranks content based on the inferred semantic distance of the query to the tags associated to such content, weighted by the similarity of the querying user to the users who created those tags.

Peer-to-Peer Information Search: Semantic, Social, or Spiritual?

TLDR
This work considers the network structure and query processing capabilities of social communities like bookmarks and photo sharing communities such as del.icio.us, and identifies three query routing paradigms: semantic routing based on query-to-content similarities, social routingbased on friendship links within the community, and spiritual routing based upon user-to -user similarities.

Efficient search in unstructured peer-to-peer networks

TLDR
This paper proposes novel mechanisms for improving search efficiency in unstructured P2P networks that perform local dynamic topology adaptations, based on the query traffic patterns, in order to spontaneously create communities of peers that share similar interests.

Semantic Overlay Networks for P2P Systems

TLDR
The results show that SONs can significantly improve query performance while at the same time allowing users to decide what content to put in their computers and to whom to connect.

Tag data and personalized information retrieval

TLDR
Experiments show that a user's "bookmark history" can be used to improve search results via personalization, and it is found that profiles based on the content of bookmarked URLs are generally superior to those based on tags alone.

Efficient network aware search in collaborative tagging sites

TLDR
This paper investigates efficient top-k processing when the score of an answer is computed as its popularity among members of a seeker's network, and develops algorithms based on maintaining score upper-bounds.
...