positive Semidefinite Metric Learning Using Boosting-like Algorithms: Revision history

View logs for this page

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

curprev 09:4609:46, 30 August 2017‎ Conversion script talk contribs‎ m 9,507 bytes 0‎ Conversion script moved page Positive Semidefinite Metric Learning Using Boosting-like Algorithms to positive Semidefinite Metric Learning Using Boosting-like Algorithms: Converting page titles to lowercase

curprev 23:5623:56, 24 August 2013‎ Z47xu talk contribs‎ 8,400 bytes +20‎ No edit summary

curprev 10:0410:04, 9 July 2013‎ F33li talk contribs‎ 8,380 bytes 0‎ →‎4. Test results
curprev 10:0210:02, 9 July 2013‎ F33li talk contribs‎ 8,380 bytes +261‎ No edit summary

curprev 16:0916:09, 7 July 2013‎ J34liang talk contribs‎ 8,119 bytes +740‎ →‎3. Optimization strategies
curprev 15:4015:40, 7 July 2013‎ J34liang talk contribs‎ 7,379 bytes +68‎ →‎1. Mathematical model of the problem

curprev 12:5112:51, 5 July 2013‎ F33li talk contribs‎ 7,311 bytes +9‎ No edit summary
curprev 12:4812:48, 5 July 2013‎ F33li talk contribs‎ 7,302 bytes −8‎ →‎1. Mathematical model of the problem

curprev 18:1918:19, 3 July 2013‎ F33li talk contribs‎ 2,106 bytes +2,106‎ Created page with "A Mahlanobis distance metric learning method is proposed in the paper. The training samples are made into “triplets” (a<sub>i</sub>, a<sub>j</sub>, a<sub>k</sub>), where a<su..."

Retrieved from "http://wiki.math.uwaterloo.ca/statwiki/index.php?title=positive_Semidefinite_Metric_Learning_Using_Boosting-like_Algorithms"