68 search results - page 3 / 14 » On the Use of Metrics for Multi-Dimensional Descriptors Clus... |
KDD
2007
ACM
14 years 8 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
SISAP
2010
IEEE
13 years 6 months ago
2010
IEEE
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
Personal ontology construction is the task of sorting through relevant materials, identifying the main topics and concepts, and organizing them to suit personal needs. Automatic c...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...