Name
Abstract | ||
|---|---|---|
Most distance metric learning (DML) approaches focus on learning a Mahalanobis metric for measuring distances between examples. However, for particular feature representations, e.g., histogram features like BOW and SPM, Mahalanobis metric could not model the correlations between these features well. In this work, we define a nonMahalanobis distance for histogram features, via Expected Hitting Time (EHT) of Markov Chain, which implicitly considers the high-order feature relationships between different histogram features. The EHT based distance is parameterized by transition probabilities of Markov Chain, we consequently propose a novel type of distance learning approach (LED, Learning Expected hitting time Distance) to learn appropriate transition probabilities for EHT based distance. We validate the effectiveness of LED on a series of realworld datasets. Moreover, experiments show that the learned transition probabilities are with good comprehensibility. |
Year | Venue | Field |
|---|---|---|
2016 | THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE | Histogram,Parameterized complexity,Pattern recognition,Computer science,Markov chain,Metric (mathematics),Distance education,Mahalanobis distance,Artificial intelligence,Hitting time,Machine learning |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
18 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chuan Zhan | 1 | 42 | 3.63 |
| Peng Hu | 2 | 38 | 12.24 |
| Zui Chu | 3 | 0 | 0.34 |
| Zhi-Hua Zhou | 4 | 13480 | 569.92 |