Explainable label distribution learning by exploiting neighborhood
摘要
Label Distribution Learning (LDL) is a novel learning paradigm that addresses label ambiguity and has found extensive applications. While many LDL algorithms have been proposed, a common assumption is that label distributions can be represented by the maximum entropy model, which may fail to general forms of label distributions. This paper proposes a novel LDL method by Exploiting NeighborhooD, called LDL-END, which adapts the k-nearest-neighbors (kNN) algorithm to deal with label distribution, without making any assumptions on the specific forms of label distributions. LDL-END introduces a new weight learning scheme that minimizes reconstruction error in both feature and label spaces, allowing the learned weights to depend on both. Additionally, it incorporates neighborhood label correlation to enhance performance. Theoretical analysis guarantees that the prediction of LDL-END approaches the ground-truth label distributions. Experimental results demonstrate the superior performance of LDL-END compared to state-of-the-art LDL methods.