Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.08522 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913688346165248 |
|---|---|
| author | Chen, Jiaye Kadri, Suzan Šajna, Mateja Şchiopu-Kratina, Ioana |
| author_facet | Chen, Jiaye Kadri, Suzan Šajna, Mateja Şchiopu-Kratina, Ioana |
| contents | A questionnaire is a sequence of multiple choice questions aiming to collect data on a population. We define an abstract questionnaire as an ordered pair $(N,{\cal M})$, where $N$ is a positive integer and ${\cal M}=(m_0,m_1,\ldots,m_{N-1})$ is an $N$-tuple of positive integers, with $m_i$, for $i \in \{0, 1, \ldots, N-1 \}$, as the number of possible answers to question $i$. An abstract questionnaire may be endowed with a skip-list (which tells us which questions to skip based on the sequence of answers to the earlier questions) and a flag-set (which tells us which sequences of answers are of special interest). An FS-decision tree is a decision tree of an abstract questionnaire that also incorporates the information contained in the skip-list and flag-set. The main objective of this paper is to represent the abstract questionnaire using a directed graph, which we call an FS-decision digraph, that contains the full information of an FS-decision tree, but is in general much more concise. We present an algorithm for constructing a fully reduced FS-decision digraph, and develop the theory that supports it. In addition, we show how to generate all possible orderings of the questions in an abstract questionnaire that respect a given precedence relation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_08522 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Abstract questionnaires and FS-decision digraphs Chen, Jiaye Kadri, Suzan Šajna, Mateja Şchiopu-Kratina, Ioana Combinatorics Information Theory Statistics Theory 05C05, 05C20, 05C90, 62D05, 94C15 A questionnaire is a sequence of multiple choice questions aiming to collect data on a population. We define an abstract questionnaire as an ordered pair $(N,{\cal M})$, where $N$ is a positive integer and ${\cal M}=(m_0,m_1,\ldots,m_{N-1})$ is an $N$-tuple of positive integers, with $m_i$, for $i \in \{0, 1, \ldots, N-1 \}$, as the number of possible answers to question $i$. An abstract questionnaire may be endowed with a skip-list (which tells us which questions to skip based on the sequence of answers to the earlier questions) and a flag-set (which tells us which sequences of answers are of special interest). An FS-decision tree is a decision tree of an abstract questionnaire that also incorporates the information contained in the skip-list and flag-set. The main objective of this paper is to represent the abstract questionnaire using a directed graph, which we call an FS-decision digraph, that contains the full information of an FS-decision tree, but is in general much more concise. We present an algorithm for constructing a fully reduced FS-decision digraph, and develop the theory that supports it. In addition, we show how to generate all possible orderings of the questions in an abstract questionnaire that respect a given precedence relation. |
| title | Abstract questionnaires and FS-decision digraphs |
| topic | Combinatorics Information Theory Statistics Theory 05C05, 05C20, 05C90, 62D05, 94C15 |
| url | https://arxiv.org/abs/2502.08522 |