Skip to Main content Skip to Navigation
Journal articles

From Small-World Networks to Comparison-Based Search

Abstract : The problem of content search through comparisons has recently received considerable attention. In short, a user searching for a target object navigates through a database in the following manner. The user is asked to select the object most similar to her target from a small list of objects. A new object list is then presented to the user based on her earlier selection. This process is repeated until the target is included in the list presented, at which point the search terminates. This problem is known to be strongly related to the small-world network design problem. However, contrary to prior work, which focuses on cases where objects in the database are equally popular, we consider here the case where the demand for objects may be heterogeneous. We show that, under heterogeneous demand, the small-world network design problem is NP-hard. Given the above negative result, we propose a novel mechanism for small-world design and provide an upper bound on its performance under heterogeneous demand. The above mechanism has a natural equivalent in the context of content search through comparisons, and we establish both an upper bound and a lower bound for the performance of this mechanism. These bounds are intuitively appealing, as they depend on the entropy of the demand as well as its doubling constant, a quantity capturing the topology of the set of target objects. They also illustrate interesting connections between comparison-based search to classic results from information theory. Finally, we propose an adaptive learning algorithm for content search that meets the performance guarantees achieved by the above mechanisms.
Complete list of metadatas
Contributor : Laurent Massoulié <>
Submitted on : Tuesday, November 10, 2015 - 10:12:03 AM
Last modification on : Wednesday, June 24, 2020 - 4:19:00 PM

Links full text



Amin Karbasi, Stratis Ioannidis, Laurent Massoulié. From Small-World Networks to Comparison-Based Search. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2015, 61 (6), pp.19. ⟨10.1109/TIT.2015.2418284⟩. ⟨hal-01226763⟩



Record views