An interest-based peer clustering algorithm using ant paradigm

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The interest-based clustering is one of promising approaches to achieve low-cost search in peer-to-peer file sharing. It organizes the logical overlay network where peers having similar interests are closely located. In this paper, we propose an interest-based peer clustering algorithm using ant paradigm. Our algorithm is inspired by the ant-based clustering algorithm, which is one of heuristic methods to categorize many data items. We also evaluate this algorithm by simulations. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Izumi, T., & Masuzawa, T. (2006). An interest-based peer clustering algorithm using ant paradigm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3853 LNCS, pp. 379–386). https://doi.org/10.1007/11613022_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free