An algorithmic method for detecting bunching in the value distribution of related variables

In this paper we present a proposed algorithm based on the bunching technique, which can be used sustainably in unobserved distributions. Automating bunching estimation is yet to receive substantial attention from the research community and our method will be one of the firsts attempts in the subjec...

Full description

Saved in:
Bibliographic Details
Published in2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM) pp. 1 - 5
Main Authors Katsaros, Ioannis, Karamanis, Kostas, Kolias, Georgios
Format Conference Proceeding
LanguageEnglish
Published IEEE 24.09.2021
Subjects
Computer languages
Computer networks
Design automation
Estimation
Europe
Open source software
Social networking (online)
Online AccessGet full text
DOI10.1109/SEEDA-CECNSM53056.2021.9566254

Cover

More Information
Summary:In this paper we present a proposed algorithm based on the bunching technique, which can be used sustainably in unobserved distributions. Automating bunching estimation is yet to receive substantial attention from the research community and our method will be one of the firsts attempts in the subject. The purpose of the algorithm is to be flexible, low-maintenance and generalized, when it comes to results; it is structured in several steps, each dependent on the previous. The algorithm concludes with the calculation of the bunching mass, if found, and based on the data distribution around that point, will calculate a significance measure. The algorithm is part of an end-product; an open-source programming language package (R/Python), to be used by the community.
DOI:10.1109/SEEDA-CECNSM53056.2021.9566254