Genetic programming (videotape): the movie
Genetic programming (videotape): the movie
ACM Computing Surveys (CSUR)
A Representation for the Adaptive Generation of Simple Sequential Programs
Proceedings of the 1st International Conference on Genetic Algorithms
An exploration of axiomatic approaches to information retrieval
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
Similarity Search: The Metric Space Approach (Advances in Database Systems)
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Unified framework for fast exact and approximate search in dissimilarity spaces
ACM Transactions on Database Systems (TODS)
Artificial Intelligence Review
Signature Quadratic Form Distance
Proceedings of the ACM International Conference on Image and Video Retrieval
On nonmetric similarity search problems in complex domains
ACM Computing Surveys (CSUR)
Ptolemaic indexing of the signature quadratic form distance
Proceedings of the Fourth International Conference on SImilarity Search and APplications
On upper bounds for dynamic pruning
ICTIR'11 Proceedings of the Third international conference on Advances in information retrieval theory
Lower-bounding term frequency normalization
Proceedings of the 20th ACM international conference on Information and knowledge management
Algorithmic exploration of axiom spaces for efficient similarity search at large scale
SISAP'12 Proceedings of the 5th international conference on Similarity Search and Applications
Universal indexing of arbitrary similarity models
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
The popularity of similarity search expanded with the increased interest in multimedia databases, bioinformatics, or social networks, and with the growing number of users trying to find information in huge collections of unstructured data. During the exploration, the users handle database objects in different ways based on the utilized similarity models, ranging from simple to complex models. Efficient indexing techniques for similarity search are required especially for growing databases. In this paper, we study implementation possibilities of the recently announced theoretical framework SIMDEX, the task of which is to algorithmically explore a given similarity space and find possibilities for efficient indexing. Instead of a fixed set of indexing properties, such as metric space axioms, SIMDEX aims to seek for alternative properties that are valid in a particular similarity model (database) and, at the same time, provide efficient indexing. In particular, we propose to implement the fundamental parts of SIMDEX by means of the genetic programming (GP) which we expect will provide highquality resulting set of expressions (axioms) useful for indexing.