Nearest Neighbor Search
Mostrando 1-8 de 8 artigos, teses e dissertações.
-
1. Combinations of distance measures and clustering algorithms in pepper germplasm characterization
RESUMO Com o aumento da perda da variabilidade genética e a procura por genótipos mais adaptados e produtivos, a caracterização e a avaliação dos genótipos conservados em um banco de germoplasma são de elevada importância. Essas podem ser obtidas de várias formas, gerando dados quantitativos e qualitativos. A análise conjunta dessas variáveis pod
Hortic. Bras.. Publicado em: 18/07/2019
-
2. Optimizing similarity queries in metric spaces meeting user\ s expectation / Otimização de operações de busca por similaridade em espaços métricos
The complexity of data stored in large databases has increased at very fast paces. Hence, operations more elaborated than traditional queries are essential in order to extract all required information from the database. Therefore, the interest of the database community in similarity search has increased significantly. Two of the well-known types of similarit
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 22/10/2012
-
3. Soluções aproximadas para algoritmos escaláveis de mineração de dados em domínios de dados complexos usando GPGPU / On approximate solutions to scalable data mining algorithms for complex data problems using GPGPU
The increasing availability of data in diverse domains has created a necessity to develop techniques and methods to discover knowledge from huge volumes of complex data, motivating many research works in databases, data mining and information retrieval communities. Recent studies have suggested that searching in complex data is an interesting research field
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 22/09/2011
-
4. Seleção de características por meio de algoritmos genéticos para aprimoramento de rankings e de modelos de classificação / Feature selection by genetic algorithms to improve ranking and classification models
Content-based image retrieval (CBIR) and classification systems rely on feature vectors extracted from images considering specific visual criteria. It is common that the size of a feature vector is of the order of hundreds of elements. When the size (dimensionality) of the feature vector is increased, a higher degree of redundancy and irrelevancy can be obse
Publicado em: 2011
-
5. Reducing the semantic gap content-based image retrieval with similarity queries / Adequando consultas por similaridade para reduzir a descontinuidade semântica na recuperação de imagens por conteúdo
The increasing number of images captured in digital media fostered the developmet of new methods for the recovery of these images. Dissimilarity is a criteria that can be used for image retrieval, where the results are images that are similar to a given reference. The queries are based on feature vectors automatically extracted from the images and on distanc
Publicado em: 2009
-
6. Efficient algorithms to execute complex similarity queries in RDBMS
Search operations in large sets of complex objects usually rely on similarity-based criteria, due to the lack of other general properties that could be used to compare the objects, such as the total order relationship, or even the equality relationship between pairs of objects, commonly used with data in numeric or short texts domains. Therefore, similarity
Journal of the Brazilian Computer Society. Publicado em: 2004-04
-
7. An overabundance of long oligopurine tracts occurs in the genome of simple and complex eukaryotes.
A search of sequence information in the GenBank files shows that tracts of 15-30 contiguous purines are greatly overrepresented in all eukaryotic species examined, ranging from yeast to human. Such an overabundance does not occur in prokaryotic sequences. The large increase in the number of oligopurine tracts cannot be explained as a simple consequence of ba
-
8. Kinetic modeling of exciton migration in photosynthetic systems. 3. Application of genetic algorithms to simulations of excitation dynamics in three-dimensional photosystem I core antenna/reaction center complexes.
A procedure is described to generate and optimize the lattice models for spectrally inhomogeneous photosynthetic antenna/reaction center (RC) particles. It is based on the genetic algorithm search for the pigment spectral type distributions on the lattice by making use of steady-state and time-resolved spectroscopic input data. Upon a proper fitness definiti