Abstract
A method for streamlining state partitioning procedures with two and three outcomes is considered. A terminology and methods of the questionnaire theory were used, and the sequence of partitioning procedures itself was defined as a heterogeneous questionnaire with questions having two or three answers. This class of questionnaires is special and is defined by the authors as a class of binary-ternary questionnaires. This is the simplest class of heterogeneous questionnaires. An increase in number of answers to a question in practice can give an advantage in parameters of the questionnaires, including in the indicator of its effectiveness – the average implementation cost. It is noted that the use of binary-ternary questionnaires in practice can reduce the average time for identifying events on a questionnaire, which is extremely important in those applications of questionnaires in which there is a time limit for identifying events, for example, in critical application systems. A method for optimizing binary-ternary questionnaires is presented, based on the search for the most preferred questions for each subset of identifiable events. The choice of preferred questions is based on establishing a comparison relationship between them. The article describes all possible types of comparison relations between two questions with two answers, two questions with three answers, and also between a question with two answers and a question with three answers. An example of obtaining a mathematical expression for a function that characterizes the preference of questions over each other, as well as a generalized formula for choosing the most preferred question for any heterogeneous questionnaires is given. An algorithm has been formed for the method of ordering questions, which allows one to construct a binary-ternary questionnaire with the lowest implementation cost in polynomial time. An example of a binary-ternary questionnaire optimization by the presented method is given.
Highlights
В настоящее время указанная задача во многих отраслях решается на основе экспертного анализа обслуживающим персоналом, который порой затрачивает значительное время на решение задачи идентификации тех или иных диагностических событий [6]
Efanov D.V., Khoroshev V.V., Osadchy G.V., Belyi A.A. Optimization of Conditional Diagnostics Algorithms for Railway Electric Switch Mechanism Using the Theory of Questionnaires with Failure Statistics // Proceedings of 16th IEEE East-West Design & Test Symposium (EWDTS2018)
Summary
Адаптируем метод построения вопросника на основе выбора на каждом этапе разбиения наиболее предпочтительного вопроса, ранее применяемый только при оптимизации вопросников с вопросами, которые имеют по два ответа, к оптимизации неоднородных вопросников с двумя и тремя ответами. В BTQ встречаются только вопросы с двумя и тремя ответами, которые разбивают исходное множество идентифицируемых событий на два и три подмножества ответов, такие что: S S 01 S 11 S 02 S 12 S 22 .
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
