Timeline for Mahalanobis distance for vector-classification
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 23, 2012 at 14:42 | vote | accept | Bliss | ||
| Feb 5, 2012 at 20:34 | answer | added | jbowman | timeline score: 1 | |
| Feb 5, 2012 at 18:03 | comment | added | Bliss | Gladly, only I don't know how to apply to solution you've suggested. Could you please explain? (Detailed math would be much appreciated) | |
| Feb 5, 2012 at 16:40 | comment | added | jbowman | Why not just calculate the Mahalanobis distance from $X_{test}$ to each $X_i$, using the sample mean and covariance matrix for the appropriate subset (+1, -1) of the $X_i$? | |
| Feb 5, 2012 at 16:15 | history | edited | user88 | CC BY-SA 3.0 |
deleted 6 characters in body; edited title
|
| Feb 5, 2012 at 14:46 | comment | added | Bliss | If needed: I can easily split the history-set into 2 sub-sets, each containing all equally-labeled vectors (i.e. one sub-set contains all "+1" labeled vectors, and the other - all "-1" labeled vectors). Features (Fi) covariance matrix can also be easily calculated for each of these vector-subsets. | |
| Feb 5, 2012 at 14:38 | history | asked | Bliss | CC BY-SA 3.0 |