Skip to Content

Universal Indexing of Arbitrary Similarity Models

Authors: 
T. Bartoš
Indexed by WOS: 
Not indexed by WOS
Indexed by SCOPUS: 
Not indexed by SCOPUS
Type: 
Proceedings
State: 
Accepted
Language: 
EN
Conference/Journal name: 
Proceedings of the VLDB Endowment
Publisher: 
ACM
Year: 
2013
Volume: 
6
Issue: 
12
Pages: 
1392-1397
ISSN: 
2150-8097

Towards Efficient Indexing of Arbitrary Similarity

Authors: 
T. Bartoš, T. Skopal, J. Moško
Indexed by WOS: 
Indexed by WOS
Indexed by SCOPUS: 
Indexed by SCOPUS
Type: 
Journal
State: 
Published
Language: 
EN
Conference/Journal name: 
SIGMOD Record
Publisher: 
ACM
Year: 
2013
Volume: 
42
Issue: 
2
ISSN: 
0163-5808

GAUK 567312

Name: 
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.

Investigators
Investigator: 
tomas.bartos
Investigator role: 
Principal investigator
Investigator: 
tomas.skopal
Investigator role: 
Team member
Investigator: 
juraj.mosko
Investigator role: 
Team member

GAUK 910913

Name: 
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.

Investigators
Investigator: 
juraj.mosko
Investigator role: 
Principal investigator
Investigator: 
tomas.skopal
Investigator role: 
Team member
Investigator: 
tomas.bartos
Investigator role: 
Team member
Investigator: 
jakub.lokoc
Investigator role: 
Team member
Investigator: 
tomas.grosup
Investigator role: 
Team member

ICBET

Research area: 
Bioinformatics & Chemoinformatics
Paper due: 
20.12.2013
Publisher: 
Elsevier
Location: 
Penang, Malaysia

PSB 2013 (Pacific Symposium on Biocomputing)

Research area: 
Bioinformatics & Chemoinformatics
Paper due: 
31.07.2013
Publisher: 
PubMed Central
Location: 
Hawai, USA

GAUK 154613

Name: 
Efficient Molecular Representation
Start year: 
2013
End year: 
2014

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.

Investigators
Investigator: 
petr.skoda
Investigator role: 
Principal investigator

Petr Škoda

Name: 
Petr
Surname: 
Škoda
Homepage: 
http://siret.ms.mff.cuni.cz/members/skoda
Research interests: 
  • chemical space exploration
  • chemical space visualization
Type of member: 
Student
State: 
Active

BSB 2013

Research area: 
Bioinformatics & Chemoinformatics
Paper due: 
27.05.2013
Publisher: 
Springer
Location: 
Recife, Brazil

Efficient Indexing of Similarity Models with Inequality Symbolic Regression

Authors: 
T. Bartoš, T. Skopal, J. Moško
Indexed by WOS: 
Indexed by WOS
Indexed by SCOPUS: 
Indexed by SCOPUS
Type: 
Proceedings
State: 
Accepted
Language: 
EN
Conference/Journal name: 
Genetic and Evolutionary Computation Conference (GECCO) 2013
Publisher: 
ACM
Year: 
2013
ISBN: 
978-1-4503-1963-8
Syndicate content