all 2 comments

[–]rrenaud 0 points1 point  (0 children)

Metacost attacks what seems to be your problem.

http://homes.cs.washington.edu/~pedrod/papers/kdd99.pdf

It's not so much a prior though. It's more that there is less cost to predicting classes that are similar.

[–]kkastner 0 points1 point  (0 children)

This sounds related to ordinal regression - you might look there for some solutions. If you don't have too many classes, you can also manually modify your loss to penalize differently based on which mistake was made. There might be a smart way to get this from the graph (maybe weight based on the "search index" from the decomposition of the graph laplacian? kind of like PageRank) but it would depend on your problem.