Sciweavers

259 search results - page 42 / 52
» Clustering for Approximate Similarity Search in High-Dimensi...
Sort
View
JUCS
2002
131views more  JUCS 2002»
15 years 1 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
BMVC
2010
14 years 11 months ago
Manifold Learning for Multi-Modal Image Registration
The standard approach to multi-modal registration is to apply sophisticated similarity metrics such as mutual information. The disadvantage of these measures, in contrast to simpl...
Christian Wachinger, Nassir Navab
RECOMB
2004
Springer
16 years 1 months ago
The Statistical Significance of Max-Gap Clusters
Identifying gene clusters, genomic regions that share local similarities in gene organization, is a prerequisite for many different types of genomic analyses, including operon pred...
Rose Hoberman, David Sankoff, Dannie Durand
KAIS
2000
87views more  KAIS 2000»
15 years 1 months ago
An Index Structure for Data Mining and Clustering
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
Xiong Wang, Jason Tsong-Li Wang, King-Ip Lin, Denn...
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 1 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...