Classification with Ordinal Circular Data

Shriya Gehlot () and Arnab Kumar Laha ()
Additional contact information
Shriya Gehlot: Indian Institute of Management Ahmedabad
Arnab Kumar Laha: Indian Institute of Management Ahmedabad

A chapter in Directional and Multivariate Statistics, 2025, pp 87-102 from Springer

Abstract: Abstract In the context of ordinal circular data, the categories are arranged in a cyclical manner, denoted as $$C_1 \prec C_2 \prec \cdots \prec C_k \prec C_1$$ C 1 ≺ C 2 ≺ ⋯ ≺ C k ≺ C 1 , where categories $$C_1$$ C 1 and $$C_k$$ C k are adjacent to each other. Consequently, conventional multilabel classification techniques are ineffective in this scenario. This paper addresses this challenge by constructing a loss function tailored for circular data, enabling the calculation of fitted and predictive probability distributions of observations belonging to different categories. Furthermore, we propose a new approach called Circular Ordistic Barycenter Method (COBM) to analyze ordinal circular data, leveraging the concept of barycenter of probability distributions. This method is found to be effective in classifying circular ordinal data. The algorithm’s efficacy is assessed through simulations and applications to real-life datasets, like Brain-Computer Interference (BCI) data and wind direction data.

Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-981-96-2004-3_5

Ordering information: This item can be ordered from
http://www.springer.com/9789819620043

DOI: 10.1007/978-981-96-2004-3_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().