Sciweavers

242 search results - page 9 / 49
» Fast Indexes and Algorithms for Set Similarity Selection Que...
Sort
View
DAGSTUHL
2006
13 years 9 months ago
Efficient multi-step query processing for EMD-based similarity
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
Ira Assent, Thomas Seidl
VLDB
1998
ACM
120views Database» more  VLDB 1998»
14 years 19 days ago
Algorithms for Querying by Spatial Structure
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
Dimitris Papadias, Nikos Mamoulis, Vasilis Delis
ICPR
2004
IEEE
14 years 9 months ago
Feature Selection and Gene Clustering from Gene Expression Data
In this article we describe an algorithm for feature selection and gene clustering from high dimensional gene expression data. The method is based on measuring similarity between ...
D. Dutta Majumder, Pabitra Mitra
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 9 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
CIKM
2009
Springer
14 years 3 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles