PINTS: peer-to-peer infrastructure for tagging systems

Self-organizing structure and availability of almost unlimited resource capacities make the peer-to-peer architecture very attractive for large-scale sharing of annotated data in Web 2.0 scenarios. This paper addresses the problem of information aggregation and utilization in a decentralized tagging environment. We introduce the vector space model for characterization of users, resources, and tags. We analyze the problem of constructing a reliable approximation for feature vectors in a fully decentralized setting and introduce possible solutions. The results of large-scale systematic evaluation with realistic data sets witness the viability of our approach.

[1]  Anne-Marie Kermarrec,et al.  Peer counting and sampling in overlay networks: random walk methods , 2006, PODC '06.

[2]  Andreas Hotho,et al.  Mining Association Rules in Folksonomies , 2006, Data Science and Classification.

[3]  Indranil Gupta,et al.  Decentralized Schemes for Size Estimation in Large and Dynamic Groups , 2005, Fourth IEEE International Symposium on Network Computing and Applications.

[4]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[5]  Márk Jelasity,et al.  Epidemic-style proactive aggregation in large overlay networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[6]  Dahlia Malkhi,et al.  Estimating network size from local information , 2003, Information Processing Letters.

[7]  Andreas Hotho,et al.  Information Retrieval in Folksonomies: Search and Ranking , 2006, ESWC.

[8]  Gerhard Weikum,et al.  Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[9]  Marcel Ausloos,et al.  Contextualising tags in collaborative tagging systems , 2009, HT '09.

[10]  M - Estimating Aggregates on a Peer-to-Peer Network , 2003 .