Sciweavers

689 search results - page 17 / 138
» Metrics for more than two points at once
Sort
View
CVPR
2009
IEEE
16 years 4 months ago
Learning a Distance Metric from Multi-instance Multi-label Data
Multi-instance multi-label learning (MIML) refers to the learning problems where each example is represented by a bag/collection of instances and is labeled by multiple labels. ...
Rong Jin (Michigan State University), Shijun Wang...
ICCV
2009
IEEE
16 years 2 months ago
Is that you? Metric Learning Approaches for Face Identification
Face identification is the problem of determining whether two face images depict the same person or not. This is difficult due to variations in scale, pose, lighting, background...
Matthieu Guillaumin, Jakob Verbeek, Cordelia Schmi...
IPL
2002
125views more  IPL 2002»
14 years 9 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
15 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
SSDBM
2008
IEEE
150views Database» more  SSDBM 2008»
15 years 4 months ago
Summarizing Two-Dimensional Data with Skyline-Based Statistical Descriptors
Much real data consists of more than one dimension, such as financial transactions (eg, price × volume) and IP network flows (eg, duration × numBytes), and capture relationship...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...