Advertisement

Content Search through Comparisons

  • Amin Karbasi
  • Stratis Ioannidis
  • Laurent Massoulié
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6756)

Abstract

We study the problem of navigating through a database of similar objects using comparisons under heterogeneous demand, a problem closely related to small-world network design. 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 network 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, again under heterogeneous demand; we use this to establish both upper and lower bounds on content search through comparisons.

Keywords

Target Object Search Cost Target Distribution Current Object Selection Policy 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Clarkson, K.L.: Nearest-neighbor searching and metric space dimensions. In: Shakhnarovich, G., Darrell, T., Indyk, P. (eds.) Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pp. 15–59. MIT Press, G. Shakhnarovich (2006)Google Scholar
  2. 2.
    Cover, T.M., Thomas, J.: Elements of Information Theory. Wiley, Chichester (1991)CrossRefzbMATHGoogle Scholar
  3. 3.
    Fraigniaud, P., Giakkoupis, G.: On the searchability of small-world networks with arbitrary underlying structure. In: STOC (2010)Google Scholar
  4. 4.
    Fraigniaud, P., Lebhar, E., Lotker, Z.: A doubling dimension threshold θ(loglogn) for augmented graph navigability. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 376–386. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Goyal, N., Lifshits, Y., Schutze, H.: Disorder inequality: a combinatorial approach to nearest neighbor search. In: WSDM (2008)Google Scholar
  6. 6.
    Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: STOC, pp. 604–613 (1998)Google Scholar
  7. 7.
    Karbasi, A., Ioannidis, S., Massoulie, L.: Content search through comparisons. Tech. Rep. CR-PRL-2010-07-0002, Technicolor (2010)Google Scholar
  8. 8.
    Karger, D., Ruhl, M.: Finding nearest neighbors in growth-restricted metrics. In: SODA (2002)Google Scholar
  9. 9.
    Kleinberg, J.: The small-world phenomenon: An algorithmic perspective. In: STOC (2000)Google Scholar
  10. 10.
    Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: SODA (2004)Google Scholar
  11. 11.
    Lifshits, Y., Zhang, S.: Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. In: SODA (2009)Google Scholar
  12. 12.
    Tschopp, D., Diggavi, S.N.: Approximate nearest neighbor search through comparisons (2009)Google Scholar
  13. 13.
    Tschopp, D., Diggavi, S.N.: Facebrowsing: Search and navigation through comparisons. In: ITA Workshop (2010)Google Scholar
  14. 14.
    White, R., Roth, R.: Exploratory Search: Beyond the Query-Response Paradigm. Morgan & Claypool (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Amin Karbasi
    • 1
  • Stratis Ioannidis
    • 2
  • Laurent Massoulié
    • 3
  1. 1.Ecole Polytechnique Federale de LausanneLausanneSwitzerland
  2. 2.TechnicolorPalo AltoUSA
  3. 3.TechnicolorParisFrance

Personalised recommendations