Modelling efficient novelty-based search result diversification in metric spaces

Journal of Discrete Algorithms

Volumn 18, Issue , 2013, Pages 75-88

  Gil Costa, Veronica ^b,c   Santos, Rodrygo L T ^a   MacDonald, Craig ^a   Ounis, Iadh ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b CONICET ^*

^c Universidad Nacional de Río Cuarto Consejo Nacional de Investigaciones Científicas y Técnicas   (Argentina)

Author keywords

Clustering; Diversification; Metric spaces; Permutation; Pivoting

Indexed keywords

CLUSTERING; DIVERSIFICATION; METRIC SPACES; PERMUTATION; PIVOTING;

SEARCH ENGINES; SET THEORY;

TOPOLOGY;

EID: 84872111879     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2012.07.004     Document Type: Conference Paper

References (62)

1. R. Agrawal, S. Gollapudi, A. Halverson, S. Ieong, Diversifying search results, in: WSDM, 2009, pp. 5-14.
2. G. Amati, E. Ambrosi, M. Bianchi, C. Gaibisso, G. Gambosi, FUB, IASI-CNR and University of Tor Vergata at TREC 2007 Blog track, in: TREC, 2007.
3. G. Amato, P. Savino, Approximate similarity search in metric spaces using inverted files, in: Infoscale, 2008, p. 28.
4. F. Aurenhammer Voronoi diagrams - a survey of a fundamental geometric data structure ACM Comput. Surv. 23 3 1991 345 405
5. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu Proximity matching using fixed-queries trees CPM LNCS vol. 807 1994 198 212
6. J.M. Barrios, D. Diaz-Espinoza, B. Bustos, Text-based and content-based image retrieval on Flickr: DEMO, in: SISAP, 2009, pp. 156-157.
7. M. Batko, D. Novak, F. Falchi, and P. Zezula Scalability comparison of peer-to-peer similarity search structures Future Generat. Comp. Syst. 24 8 2008 834 848
8. T. Bozkaya, and M. Ozsoyoglu Distance-based indexing for high-dimensional metric spaces SIGMOD Sigmod Record 26 2 1997 357 368
9. N.R. Brisaboa, A. Farina, O. Pedreira, N. Reyes, Similarity search using sparse pivots for efficient multimedia information retrieval, in: ISM, 2006, pp. 881-888.
10. W. Burkhard, and R. Keller Some approaches to best-match file searching Comm. ACM 16 4 1973 230 236
11. P. Burstein, A.J. Smith, Efficient search in file-sharing networks, in: ICPADS, 2007, pp. 1-9.
12. G. Capannini, F.M. Nardini, R. Perego, and F. Silvestri Efficient diversification of web search results Proc. VLDB Endow. 4 7 Apr. 2011 451 459
13. J. Carbonell, J. Goldstein, The use of MMR, diversity-based reranking for reordering documents and producing summaries, in: SIGIR, 1998, pp. 335-336.
14. B. Carterette, P. Chandar, Probabilistic models of ranking novel documents for faceted topic retrieval, in: CIKM, 2009, pp. 1287-1296.
15. U.V. Catalyurek, E.G. Boman, K.D. Devine, D. Bozdaǧ, R.T. Heaphy, and L.A. Riesen A repartitioning hypergraph model for dynamic load balancing J. Parallel Distr. Comput. 69 2009 711 724
16. O. Chapelle, D. Metlzer, Y. Zhang, P. Grinspan, Expected reciprocal rank for graded relevance, in: CIKM, 2009, pp. 621-630.
17. E. Chavez, and G. Navarro A compact space decomposition for effective metric indexing PRL 26 9 2005 1363 1376
18. E. Chavez, K. Figueroa, and G. Navarro Effective proximity retrieval by ordering permutations PAMI 30 2008 1647 1658
19. E. Chavez, J. Marroquín, and R. Baeza-Yates Spaghettis: an array based algorithm for similarity queries in metric spaces SPIRE 1999 IEEE CS Press 38 46
20. E. Chavez, J. Marroquín, and G. Navarro Fixed queries array: A fast and economical data structure for proximity searching Multimed. Tool. Appl. 14 2 2001 113 135
21. E. Chávez, G. Navarro, R. Baeza-Yates, and J.L. Marroquín Searching in metric spaces ACM Comput. Surv. 33 3 2001 273 321
22. P. Ciaccia, M. Patella, P. Zezula, M-tree: An efficient access method for similarity search in metric spaces, in: VLDB, 1997, pp. 426-435.
23. C.L.A. Clarke, N. Craswell, I. Soboroff, Overview of the TREC 2009 Web track, in: TREC, 2009.
24. C.L.A. Clarke, N. Craswell, I. Soboroff, Overview of the TREC 2011 Web track, in: TREC, 2011.
25. C.L.A. Clarke, N. Craswell, I. Soboroff, G.V. Cormack, Overview of the TREC 2010 Web track, in: TREC, 2010.
26. C.L.A. Clarke, M. Kolla, G.V. Cormack, O. Vechtomova, A. Ashkan, S. Büttcher, I. MacKinnon, Novelty and diversity in information retrieval evaluation, in: SIGIR, 2008, pp. 659-666.
27. A. Esuli, MIDI: Using the pp-index to build an efficient and scalable similarity search system, in: SISAP, 2009, pp. 146-148.
28. A. Esuli, Pp-index: Using permutation prefixes for efficient and scalable similarity search, in: SEBD, 2010, pp. 318-325.
29. C. Gennaro, G. Amato, P. Bolettieri, P. Savino, An approach to content-based image retrieval based on the Lucene search engine library, in: ECDL, 2010, pp. 55-66.
30. C. Gennaro, M. Mordacchini, S. Orlando, F. Rabitti, A scalable distributed data structure for multi-feature similarity search, in: SEBD, 2008, pp. 302-309.
31. V. Gil-Costa, M. Marin, and N. Reyes Parallel query processing on distributed clustering indexes J. Discrete Algorithms 7 1 2009 3 17
32. V. Gil-Costa, R.L.T. Santos, C. Macdonald, I. Ounis, Sparse spatial selection for novelty-based search result diversification, in: SPIRE, 2011, pp. 344-355.
33. W. Hersh, P. Over, TREC-8 interactive track report, in: TREC, 2000.
34. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 4598 1983 671 680
35. M. Lux, S.A. Chatzichristofis, Lire: Lucene image retrieval: an extensible java CBIR library, in: ACM Multimedia, 2008, pp. 1085-1088.
36. M. Mamede, F. Barbosa, Range queries in natural language dictionaries with recursive lists of clusters, in: ISCIS, 2007.
37. M. Marin, V. Gil-Costa, C. Hernández, Dynamic P2P indexing and search based on compact clustering, in: SISAP, 2009, pp. 124-131.
38. M. Marin, V. Gil-Costa, R. Uribe, Hybrid index for metric space databases, in: ICCS, 2008, pp. 327-336.
39. L. Mico, J. Oncina, and R.C. Carrasco A fast branch & bound nearest neighbour classifier in metric spaces Pattern Recogn. Lett. 17 7 1996 731 739
40. L. Mico, J. Oncina, and E. Vidal A new version of the nearest-neighbor approximating and eliminating search (AESA) with linear preprocessing-time and memory requirements Pattern Recogn. Lett. 15 1994 9 17
41. G. Navarro, Searching in metric spaces by spatial approximation, in: VLDB, 2002, pp. 28-46.
42. G. Navarro, N. Reyes, Fully dynamic spatial approximation trees, in: SPIRE, 2002, pp. 254-270.
43. G. Navarro, N. Reyes, Dynamic spatial approximation trees for massive data, in: SISAP, 2009, pp. 81-88.
44. S. Nene, and S. Nayar A simple algorithm for nearest neighbor search in high dimensions IEEE Trans. Pattern Anal. Mach. Intell. 19 9 1997 989 1003
45. D. Novak, M. Batko, Metric index: An efficient and scalable solution for similarity search, in: SISAP, 2009, pp. 65-73.
46. D. Novak, M. Batko, and P. Zezula Large-scale similarity data management with distributed metric index IPM 2011
47. I. Ounis, G. Amati, V. Plachouras, B. He, C. Macdonald, C. Lioma, Terrier: a high performance and scalable information retrieval platform, in: OSIR, 2006, pp. 18-25.
48. A. Papadopoulos, and Y. Manolopoulos Distributed processing of similarity queries Distrib. Parallel Databases 9 1 2001 67 92
49. S.E. Robertson, S. Walker, S. Jones, M. Hancock-Beaulieu, M. Gatford, Okapi at TREC-3, in: TREC, 1994.
50. H. Samet Foundations of Multidimensional and Metric Data Structures The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling 2005 Morgan Kaufmann Publishers Inc.
51. R.L.T. Santos, C. Macdonald, I. Ounis, Exploiting query reformulations for Web search result diversification, in: WWW, 2010, pp. 881-890.
52. R.L.T. Santos, C. Macdonald, I. Ounis, On the role of novelty for search result diversification, in: Information Retrieval, 2012.
53. R.L.T. Santos, J. Peng, C. Macdonald, I. Ounis, Explicit search result diversification through sub-queries, in: ECIR, 2010, pp. 87-99.
54. M. Skala Counting distance permutations J. Discrete Algorithms 7 1 2009 49 61
55. J. Uhlmann Satisfying general proximity/similarity queries with metric trees Inform. Process. Lett. 40 1991 175 179
56. R.H. van Leuken, L. Garcia, X. Olivares, R. van Zwol, Visual diversification of image search results, in: WWW, 2009, pp. 341-350.
57. E. Vidal An algorithm for finding nearest neighbors in (approximately) constant average time Pattern Recogn. Lett. 4 1986 145 157
58. J. Wang, J. Zhu, Portfolio theory of information retrieval, in: SIGIR, 2009, pp. 115-122.
59. P. Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, in: SODA, 1993, pp. 311-321.
60. P. Yianilos, Locally lifting the curse of dimensionality for nearest neighbor search, in: SODA, 2000, pp. 361-370.
61. P. Zezula, G. Amato, V. Dohnal, and M. Batko Similarity Search: The Metric Space Approach Advances in Database Systems vol. 32 2006 Springer
62. C. Zhai, W.W. Cohen, J. Lafferty, Beyond independent relevance: Methods and evaluation metrics for subtopic retrieval, in: SIGIR, 2003, pp. 10-17.