Sciweavers

911 search results - page 93 / 183
» On the Distance of Databases
Sort
View
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
14 years 20 days ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
VLDB
1997
ACM
170views Database» more  VLDB 1997»
13 years 11 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
COMPGEOM
2008
ACM
13 years 9 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
ER
2008
Springer
134views Database» more  ER 2008»
13 years 9 months ago
On Measuring Process Model Similarity Based on High-Level Change Operations
For various applications there is the need to compare the similarity between two process models. For example, given the as-is and to-be models of a particular business process, we ...
Chen Li, Manfred Reichert, Andreas Wombacher
CAD
2007
Springer
13 years 7 months ago
A spectral approach to shape-based retrieval of articulated 3D models
We present an approach for robust shape retrieval from databases containing articulated 3D models. Each shape is represented by the eigenvectors of an appropriately defined affin...
Varun Jain, Hao Zhang 0002