SSS
Scalable Similarity Search
| Coordinatore | IT University of Copenhagen
Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie. |
| Nazionalità Coordinatore | Denmark [DK] |
| Totale costo | 1˙889˙711 € |
| EC contributo | 1˙889˙711 € |
| Programma | FP7-IDEAS-ERC
Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) |
| Code Call | ERC-2013-CoG |
| Funding Scheme | ERC-CG |
| Anno di inizio | 2014 |
| Periodo (anno-mese-giorno) | 2014-05-01 - 2019-04-30 |
Partecipanti
| # | ||||
|---|---|---|---|---|
| 1 |
IT University of Copenhagen
Organization address
address: Rued Langgaardsvej 7 contact info |
DK (Copenhagen) | hostInstitution | 1˙889˙711.80 |
| 2 |
IT University of Copenhagen
Organization address
address: Rued Langgaardsvej 7 contact info |
DK (Copenhagen) | hostInstitution | 1˙889˙711.80 |
Mappa
Word cloud
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
Obiettivo del progetto (Objective)
'Similarity search is the task of identifying, in a collection of items, the ones that are “similar” to a given query item. This task has a range of important applications (e.g. in information retrieval, pattern recognition, statistics, and machine learning) where data sets are often big, high dimensional, and possibly noisy. State-of-the-art methods for similarity search offer only weak guarantees when faced with big data. Either the space overhead is excessive (1000s of times larger than the space for the data itself), or the work needed to report the similar items may be comparable to the work needed to go through all items (even if just a tiny fraction of the items are similar). As a result, many applications have to resort to the use of ad-hoc solutions with only weak theoretical guarantees.
This proposal aims at strengthening the theoretical foundation of scalable similarity search, and developing novel practical similarity search methods backed by theory. In particular we will:
- Leverage new types of embeddings that are kernelized, asymmetric, and complex-valued.
- Consider statistical models of noise in data, and design similarity search data structures whose performance guarantees are phrased in statistical terms.
- Build a new theory of the communication complexity of distributed, dynamic similarity search, emphasizing the communication bottleneck present in modern computing infrastructures.
The objective is to produce new methods for similarity search that are: 1) Provably robust, 2) scalable to large and high-dimensional data sets, 3) substantially more resource efficient than current state-ofthe- art solutions, and 4) able to provide statistical guarantees on query answers.
The study of similarity search has been an incubator for techniques (e.g. locality-sensitive hashing and random projections) that have wide-ranging applications. The new techniques developed in this project are likely to have significant impacts beyond similarity search.'