ACM Home Page
Please provide us with feedback. Feedback
A measure for cluster cohesion in semantic overlay networks
Full text PdfPdf (331 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval table of contents
Napa Valley, California, USA
SESSION: Potpourri table of contents
Pages 59-66  
Year of Publication: 2008
ISBN:978-1-60558-254-2
Authors
Paraskevi Raftopoulou  Max-Planck Institute for Informatics, Saarbruecken, Germany and Technical University of Crete, Chania, Greece
Euripides G.M. Petrakis  Technical University of Crete, Chania, Greece
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 96,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458469.1458480
What is a DOI?

ABSTRACT

Semantic overlay networks cluster peers that are semantically, thematically or socially close into groups by means of a rewiring procedure that is periodically executed by each peer. Rewiring proceeds by establishing new connections to similar peers, and by discarding connections that are outdated or pointing to dissimilar peers. This process aims at improving cluster quality (how well peers with similar content are clustered together) and by this, at improving the flow of information in the network by reducing the number of messages that are exchanged. Therefore, measuring the quality of clustering is an important issue by itself. This is exactly the issue this work is dealing with. In this paper, we introduce a new clustering measure that takes into account the whole neighborhood of a peer (rather than its direct neighbors) thus, providing better insight on the quality of the underlying clustered organisation. Our experimental evaluation with real-word data and queries confirms our assumption that the new measure is better suited for measuring clustering quality than other known measures, such as the (generalised) clustering coefficient.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
C. Doulkeridis, K. Noervaag, and M. Vazirgiannis. Scalable Semantic Overlay Generation for P2P-based Digital Libraries. In ECDL, 2006.
 
3
 
4
A. Fronczak, J.A. HoImage, M. Jedynak, and J. Sienkiewicz. Higher Order Clustering Coefficients in Barabasi-Albert Networks. Physica A: Statistical Mechanics and its Applications, 316(1--4), 2002.
 
5
H. Garcia-Molina and B. Yang. Efficient Search in Peer-to-Peer Networks. In ICDCS, 2002.
 
6
 
7
H.F. Hansen, C.A. Andresen, and A. Hansen. A Quantitative Measure for Path Structures of Complex Networks. EPL: A Letters Journal Exploring the Frontiers of Physics, 78, May 2007.
 
8
9
 
10
G. Koloniari and E. Pitoura. Recall-based Cluster Reformulation by Selfish Peers. In NetDB, 2008.
 
11
 
12
A. Linari and M. Patella. Metric Overlay Networks: Processing Similarity Queries in P2P Databases. In DBISP2P, 2007.
 
13
A. Loser and C. Tempich. On Ranking Peers in Semantic Overlay Networks. In WM, 2005.
 
14
A. Loser, M. Wolpers, W. Siberski, and W. Nejdl. Semantic Overlay Clusters within Super-Peer Networks. In DBISP2P, 2003.
15
16
 
17
C. H. Ng, K. C. Sia, and C. H. Chang. Advanced Peer Clustering and Firework Query Model in the Peer-to-Peer Network. In WWW, 2002.
 
18
 
19
 
20
P. Raftopoulou and E.G.M. Petrakis. iCluster: a Self-Organising Overlay Network for P2P Information Retrieval. In ECIR, 2008.
21
 
22
J. Sacha, J. Dowling, R. Cunningham, and R. Meier. Discovery of Stable Peers in a Self-organising Peer-to-Peer Gradient Topology. In DAIS, 2006.
 
23
C. Schmitz. Self-Organization of a Small World by Topic. In P2PKM, 2004.
 
24
J. Sedmidubsky, S. Barton, V. Dohnal, and P. Zezula. Adaptive Approximate Similarity Searching through Metric Social Networks. In ICDE, 2008.
 
25
K. Spripanidkulchai, B. Maggs, and H. Zhang. Efficient Content Location using Interest-Based Locality in Peer-to-Peer Systems. In INFOCOM, 2003.
26
 
27
P. Triantafillou, C. Xiruhaki, M. Koubarakis, and N. Ntarmos. Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. In CIDR, 2003.
 
28
 
29
D. J. Watts and S. H. Strogatz. Collective Dynamics of 'Small-World' Networks. Nature, 393, 1998.
30

Collaborative Colleagues:
Paraskevi Raftopoulou: colleagues
Euripides G.M. Petrakis: colleagues