312 search results - page 45 / 63 » On distance and similarity in fold space |
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
SEMWEB
2007
Springer
15 years 3 months ago
2007
Springer
OntoDNA is an automated ontology mapping and merging system that utilizes unsupervised data mining methods, comprising of Formal Concept analysis (FCA), Self-Organizing map (SOM) a...
ESWA
2002
14 years 9 months ago
2002
Image mining presents special characteristics due to the richness of the data that an image can show. Effective evaluation of the results of image mining by content requires that ...
103
click to vote
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....