Filters








61,570 Hits in 5.4 sec

SPLX-Perm: A Novel Permutation-Based Representation for Approximate Metric Search [chapter]

Lucia Vadicamo, Richard Connor, Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti
2019 Lecture Notes in Computer Science  
Many approaches for approximate metric search rely on a permutation-based representation of the original data objects.  ...  We tested the proposed approach on two benchmarks for similarity search.  ...  Experiments We compared our permutation representations (SPLX-Perms) with the traditional permutation-based representations (Perms) in an approximate similarity search scenario.  ... 
doi:10.1007/978-3-030-32047-8_4 fatcat:qotbnm3fqbfj7f5dexb7yads7a

Re-ranking Permutation-Based Candidate Sets with the n-Simplex Projection [chapter]

Giuseppe Amato, Edgar Chávez, Richard Connor, Fabrizio Falchi, Claudio Gennaro, Lucia Vadicamo
2018 Lecture Notes in Computer Science  
In the realm of metric search, the permutation-based approaches have shown very good performance in indexing and supporting approximate search on large databases.  ...  We propose to reuse the distances computed for building the data permutations to derive these bounds and we show how to use them to improve the permutation-based results.  ...  For reference, we Re-ranking Permutation-Based Candidate Sets with the n-Simplex proj.  ... 
doi:10.1007/978-3-030-02224-2_1 fatcat:kuyhrkzlrzeznlutpkss3px7ji

Geometric surrogate-based optimisation for permutation-based problems

Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
2011 Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO '11  
In this work, we apply this framework to combinatorial problems using the permutation representation and report experimental results on the quadratic assignment problem.  ...  solution representation by extending their natural geometric interpretation from continuous to general metric spaces.  ...  To search the surrogate model we used a memetic algorithm on permutations with cycle crossover, swap mutation and local search based on the 2-opt neighborhood.  ... 
doi:10.1145/2001858.2001934 dblp:conf/gecco/MoraglioKY11 fatcat:r44ery2neza25lk2ohrmlnycta

Geometry of evolutionary algorithms

Alberto Moraglio
2011 Proceedings of the 13th annual conference companion on Genetic and evolutionary computation - GECCO '11  
Concave Fitness Landscapes This generalises to general metric spaces with ANY representation Convex search works well on (approximately) concave landscapes Steady-Improvement Theorem On a concave fitness  ...  Are there general conditions on the fitness landscape that guarantee good performance of the convex search for any space/representation?  ... 
doi:10.1145/2001858.2002144 dblp:conf/gecco/Moraglio11 fatcat:gnuqgi6yqrh43pykngodjt7ali

Learning Probability Distributions over Permutations by Means of Fourier Coefficients [chapter]

Ekhine Irurozki, Borja Calvo, Jose A. Lozano
2011 Lecture Notes in Computer Science  
In this paper, we present a method to learn a probability distribution that approximates the generating distribution of a given sample of permutations.  ...  One of its main advantages is that the Fourier transform compactly summarizes approximations to functions by discarding high order marginals information.  ...  This is based on a generalization of the well-known Fourier transform in the real line for permutations.  ... 
doi:10.1007/978-3-642-21043-3_22 fatcat:wfoovb4euja3taolcckgn5yblq

Using Apache Lucene to Search Vector of Locally Aggregated Descriptors [article]

Giuseppe Amato, Paolo Bolettieri, Fabrizio Falchi, Claudio Gennaro, Lucia Vadicamo
2016 arXiv   pre-print
This technique is based on comparing the permutations of some reference objects in place of the original metric distance.  ...  Surrogate Text Representation (STR) is a profitable solution to efficient similarity search on metric space using conventional text search engines, such as Apache Lucene.  ...  One of the best performing generic methods for similarity searching, is the use of permutation based indexes (Chavez et al., 2008; Amato et al., 2014b) .  ... 
arXiv:1604.05576v1 fatcat:rg6gushwpzdczkoeqjwuoso34q

A review of metrics on permutations for search landscape analysis

Tommaso Schiavinotto, Thomas Stützle
2007 Computers & Operations Research  
In this article, we review algorithms for computing distances on permutations for the most widely applied operators and present simulation results that compare the exact distances to commonly used approximations  ...  For operations on candidate solutions that are represented by permutations, in almost all researches on search landscape analysis surrogate distance measures are applied, although efficient algorithms  ...  The Community is not responsible for any use that might be made of data appearing in this publication.  ... 
doi:10.1016/j.cor.2005.11.022 fatcat:5mstbqqjkfbknbdyco2fdu4hsy

Towards Efficiently Solving Quantum Traveling Salesman Problem [article]

Debabrata Goswami, Harish Karnick, Prateek Jain, Hemanta K. Maji
2004 arXiv   pre-print
Generalizing this strategy for any distribution, we present an oracle based Quantum Algorithm to solve Approximate TSP. We present a realization of the oracle in the quantum counterpart of PP.  ...  Using this representation and assuming a Gaussian distribution on tour-lengths, we give an algorithm to solve Approximate TSP (Euclidean) within BQP resource bounds.  ...  We propose a new encoding scheme for permutations which can be recursively generated.  ... 
arXiv:quant-ph/0411013v1 fatcat:rlyk3xt7urbf5ga4wdkdd5gxpu

LSI: A Learned Secondary Index Structure [article]

Andreas Kipf, Dominik Horn, Pascal Pfeil, Ryan Marcus, Tim Kraska
2022 arXiv   pre-print
LSI works by building a learned index over a permutation vector, which allows binary search to performed on the unsorted base data using random access.  ...  However, most learned index studies have focused on the primary indexing setting, where the base data is sorted.  ...  Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein.  ... 
arXiv:2205.05769v1 fatcat:xgyvuu4akbf7lbflqoqfx4tejy

Hierarchical S(3)-Coding of RGB Histograms [chapter]

Reiner Lenz, Pedro Latorre Carmona
2010 Communications in Computer and Information Science  
In this paper we introduce the representation theory of the symmetric group S (3) as a tool to investigate the structure of the space of RGB-histograms and to construct fast transforms suitable for search  ...  We apply the algorithms to two real-world databases (one from an image provider and one from a image search engine company) containing over one million images.  ...  We see that these numbers are always greater than five, which means that the approximation-based search always found the five most similar images from the full-PCA based retrieval.  ... 
doi:10.1007/978-3-642-11840-1_14 fatcat:5erolsp5brbk5nnx2pqlb4pe3i

A Fourier-theoretic approach for inferring symmetries

Xiaoye Jiang, Jian Sun, Leonidas Guibas
2014 Computational geometry  
Our approach takes as input a geometric similarity matrix between low-order combinations of features of X and then searches within the tree of all feature permutations to detect the sparse subset that  ...  In this paper, we propose a novel Fourier-theoretic approach for estimating the symmetry group G of a geometric object X.  ...  Acknowledgement The authors would like to thank the anonymous reviewers for valuable comments and suggestions.  ... 
doi:10.1016/j.comgeo.2012.10.001 fatcat:bcbymrwsjbc4fo2v2bgdmmgbpa

Geometric Crossovers for Multiway Graph Partitioning

Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byung-Ro Moon
2007 Evolutionary Computation  
By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation.  ...  We design a new geometric crossover for permutations with repetitions that naturally suits partition problems and test it on the graph partitioning problem.  ...  Acknowledgments The authors would like to thank Riccardo Poli for his helpful comments and suggestions that improved the quality of this paper.  ... 
doi:10.1162/evco.2007.15.4.445 pmid:18021015 fatcat:jajddwjp6ndgrp6oqytesviss4

Geometric Generalisation of Surrogate Model-Based Optimisation to Combinatorial and Program Spaces

Yong-Hyuk Kim, Alberto Moraglio, Ahmed Kattan, Yourim Yoon
2014 Mathematical Problems in Engineering  
We test this adaptation process on problems involving binary strings, permutations, and tree-based genetic programs.  ...  This approach allows an SM to be cast in a natural way for the problem at hand, without ad hoc adaptation to a specific representation.  ...  To search the SM, we used a memetic algorithm on permutations with truncation selection, cycle crossover, swap mutation at a mutation rate of 0.01, and local search based on the 2-opt neighborhood.  ... 
doi:10.1155/2014/184540 fatcat:rwoakrxlhrbmjmrtl75amfnw5u

Scalable Pattern Search Analysis [chapter]

Eric Sadit Tellez, Edgar Chavez, Mario Graff
2011 Lecture Notes in Computer Science  
Efficiently searching for patterns in very large collections of objects is a very active area of research.  ...  The search spaces where the analyzed indexes work span from vector spaces, general metric spaces up to general similarity spaces.  ...  Each encoding gives a tradeoff between space, search time and accuracy. To fix ideas, think on a string representation and the amount of space needed for the whole database S.  ... 
doi:10.1007/978-3-642-21587-2_9 fatcat:cf5r5cml75defmf6l3jh5dnzsi

Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem

Günther R. Raidl, Jens Gottlieb
2005 Evolutionary Computation  
All measurements are described in a general way, allowing for an easy adaption to other representations and combinatorial problems.  ...  After comparing the general performance of the EA variants on two benchmark suites, we present a hands-on approach for empirically analyzing important aspects of initialization, mutation, and crossover  ...  Considering for example the permutation representation, the search space S is the set of all permutations of {1, . . . , n}.  ... 
doi:10.1162/106365605774666886 pmid:16297279 fatcat:e6bbkbg47ranzcpfilhu53vo3e
« Previous Showing results 1 — 15 out of 61,570 results