Optimizing binary questionnaires
A solution to the problem of constructing optimal questionnaires is examined. The principles of choosing a root question are presented. Questionnaires are broken down into transitive and intransitive on the basis of a binary relationship presented in the set of questions. Theorems are formulated which allow the choice of a root question to be restricted for both classes. Relationships are obtained for a unique choice of root question from which an algorithm for constructing an optimal questionnaire when auxiliary conditions are satisfied is proposed and an algorithm for constructing a quasioptimal questionnaire when these conditions are not satisfied is presented.
- Quantization of questionnaires
- On a method of ranking questions in expert systems
- The nontransitivity problem for three continuous random variables
- Skip sequencing: A decision problem in questionnaire design
- scientific article; zbMATH DE number 3910292 (Why is no real title available?)
- Modifying the tolerant substitution method in almost uniform compact surveys
- scientific article; zbMATH DE number 2013370 (Why is no real title available?)
- Testing the logical structure of questionnaires
- scientific article; zbMATH DE number 3326136 (Why is no real title available?)
- scientific article; zbMATH DE number 3378825 (Why is no real title available?)
- Piecewise linear barycentric coding of a questionnaire
- Survey questionnaires and graphs
- Optimization of binary questionnaires containing variable-price questions
This page was built for publication: Optimizing binary questionnaires
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084372)
