For Manuscript Submission, Check or Review Login please go to Submission Websites List.
For the academic login, please select your country in the dropdown list. You will be redirected to verify your credentials.
Is Selection Optimal for Scale-Free Small Worlds?Palotai Z.a · Farkas C.b · Lorincz A.a
aDepartment of Information Systems, Eötvös Loránd University, Budapest, Hungary; bDepartment of Computer Science and Engineering, University of South Carolina, Columbia, S.C., USA Corresponding Author
Department of Information Systems, Eötvös Loránd University
Pázmány Péter sétány 1/c, HU–1117 Budapest (Hungary)
Tel. +36 1 209 0555/8473, Fax +36 1 381 2140, E-Mail email@example.com
The ‘no free lunch theorem’ claims that for the set of all problems no algorithm performs better than random search and, thus, selection can be advantageous only on a limited set of problems. In this paper we investigate how the topological structure of the environment influences algorithmic efficiency. We study the performance of algorithms, using selective learning, reinforcement learning, and their combinations, in random, scale-free, and scale-free small world (SFSW) environments. The learning problem is to search for novel, not-yet-found information. We ran our experiments on a large news site and on its downloaded portion. Controlled experiments were performed on this downloaded portion: we modified the topology, but preserved the publication time of the news. Our empirical results show that the selective learning is the most efficient in SFSW topology. In non-small world topologies, however, the combination of the selective and reinforcement learning algorithms performs the best.
© 2006 S. Karger AG, Basel