Algorithmic exploration of axiom spaces for efficient similarity search at large scale
Start year:
2012
End year:
2014
Similarity search is becoming popular in even more disciplines, such as multimedia databases, bioinformatics, data mining, or social networks. The large-scale search engines for such data are mostly based on models involving low-level features and simple similarity functions. There also exist complex models employing local features and higher-level similarities which provide higher retrieval effectiveness. An application of complex models, however, is not feasible at large scale due to insufficient portfolio of indexing techniques enabling fast search.
Real-time Exploration Queries in Multimedia Databases
Start year:
2013
End year:
2015
Nowadays, the similarity search in multimedia databases is performed through similarity queries explicitly specified by users. The queries return a certain part of the database that is relevant to the user specified query parameters. However, this approach suffers in case the user does not know how to specify the query, or actually she/he only wants to know what the database contains in the whole picture. In such case non-standard access to data is more appropriate, e.g., the exploration of a multimedia database.
Many areas of chemical biology, e.g. drug discovery, largely rely on libraries of molecules for production processes. Since the space of all molecules, called the chemical space, is huge, those libraries contain only small subspace of the whole space. An alternative to statical libraries is dynamic exploration of the space. The exploration generates molecules dynamically based on paths between given molecules in the chemical space.