mlsanityData to 7 Oct 2026

Affinity-Based Hierarchical Learning of Dependent Concepts for Human Activity Recognition

arXiv 2104.04889 ↗First posted 11 Apr 2021cs.LG eess.SPcited by 0

Not on the map. Why?

Abstract (arXiv)

In multi-class classification tasks, like human activity recognition, it is often assumed that classes are separable. In real applications, this assumption becomes strong and generates inconsistencies. Besides, the most commonly used approach is to learn classes one-by-one against the others. This computational simplification principle introduces strong inductive biases on the learned theories. In fact, the natural connections among some classes, and not others, deserve to be taken into account. In this paper, we show that the organization of overlapping classes (multiple inheritances) into hierarchies considerably improves classification performances. This is particularly true in the case of activity recognition tasks featured in the SHL dataset. After theoretically showing the exponential complexity of possible class hierarchies, we propose an approach based on transfer affinity among the classes to determine an optimal hierarchy for the learning process. Extensive experiments show improved performances and a reduction in the number of examples needed to learn.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 27 references that are in the map. First posted on arXiv 11 Apr 2021.

Builds on

5 of 27 references.

References · 5

  1. 2019To Tune or Not to Tune? Adapting Pretrained Representations to Diverse Taskscited by 167
  2. 2019Hierarchically Structured Meta-learningcited by 67
  3. 2013Evaluation Measures for Hierarchical Classification: a unified view and novel approachescited by 46
  4. 2018Custom Dual Transportation Mode Detection by Smartphone Devices Exploiting Sensor Diversitycited by 5
  5. 2018Impact of Ground Truth Annotation Quality on Performance of Semantic Image Segmentation of Traffic Conditionscited by 4

Built on by

Not cited yet.