Algorithms for clustering data
Algorithms for clustering data
A retrieval technique for similar shapes
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
On sequential shape descriptions
Pattern Recognition
Searching for geometric molecular shape complementarity using bidimensional surface profiles
Journal of Molecular Graphics
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
S3: similarity search in CAD database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
OPTICS: ordering points to identify the clustering structure
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Efficient geometry-based similarity search of 3D spatial databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Feature-Based Retrieval of Similar Shapes
Proceedings of the Ninth International Conference on Data Engineering
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
3D Similarity Search by Shape Approximation
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
3D Shape Histograms for Similarity Search and Classification in Spatial Databases
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Using extended feature objects for partial similarity retrieval
The VLDB Journal — The International Journal on Very Large Data Bases
Effective Similarity Search on Voxelized CAD Objects
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Efficient 3D object retrieval using depth images
Proceedings of the 6th ACM SIGMM international workshop on Multimedia information retrieval
Density-based clustering of uncertain data
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Feature-based similarity search in 3D object databases
ACM Computing Surveys (CSUR)
Multi-step density-based clustering
Knowledge and Information Systems
Time-focused clustering of trajectories of moving objects
Journal of Intelligent Information Systems
Fast similarity join for multi-dimensional data
Information Systems
A survey of content based 3D shape retrieval methods
Multimedia Tools and Applications
A Filter-Refinement Scheme for 3D Model Retrieval Based on Sorted Extended Gaussian Image Histogram
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
Using the self organizing map for clustering of text documents
Expert Systems with Applications: An International Journal
Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Visually driven analysis of movement data by progressive clustering
Information Visualization
Three-dimensional shape searching: state-of-the-art review and future trends
Computer-Aided Design
Ellipsoidal harmonics for 3-D shape description and retrieval
IEEE Transactions on Multimedia
Boosting spatial pruning: on optimal pruning of MBRs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Subspace methods for retrieval of general 3D models
Computer Vision and Image Understanding
A 3D shape retrieval framework for 3D smart cities
Frontiers of Computer Science in China
Collaborative intelligent CAD framework incorporating design history tracking algorithm
Computer-Aided Design
Probabilistic similarity join on uncertain data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Parallel density-based clustering of complex objects
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Similarity search with implicit object features
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Approximated clustering of distributed high-dimensional data
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Comparison of entity with fuzzy data types in fuzzy object-oriented databases
Integrated Computer-Aided Engineering
| Hi-index | 0.00 |
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especially for CAD applications, suitable similarity models can help to reduce the cost of developing and producing new parts by maximizing the reuse of existing parts. Most of the existing similarity models are based on feature vectors. In this paper, we shortly review three models which pursue this paradigm. Based on the most promising of these three models, we explain how sets of feature vectors can be used for more effective and still efficient similarity search. We first introduce an intuitive distance measure on sets of feature vectors together with an algorithm for its efficient computation. Furthermore, we present a method for accelerating the processing of similarity queries on vector set data. The experimental evaluation is based on two real world test data sets and points out that our new similarity approach yields more meaningful results in comparatively short time.