До відкриття латентного бінарного фактора в статистичних даних категорного типу
For a discrete model with tree-like structure, we demonstrate that if a separating variable (a root vertex) is binary, then constraints (like “tetrad difference”) hold. Specifically, when there are four or three manifest variables in a model, the “ditetrad-constraint” or “triad-constraint”, respect...
Saved in:
| Date: | 2008 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
Видавничий дім "Академперіодика" НАН України
2008
|
| Subjects: | |
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/5822 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | До відкриття латентного бінарного фактора в статистичних даних категорного типу / П. I. Андон, О.С. Балабанов // Доп. НАН України. — 2008. — № 9. — С. 37-43. — Бібліогр.: 13 назв. — укр. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Summary: | For a discrete model with tree-like structure, we demonstrate that if a separating variable (a root vertex) is binary, then constraints (like “tetrad difference”) hold. Specifically, when there are four or three manifest variables in a model, the “ditetrad-constraint” or “triad-constraint”, respectively, applies. So, these constraints facilitate the discovery of a hidden binary variable (latent class) which is responsible for associations among discrete manifest variables.
|
|---|---|
| ISSN: | 1025-6415 |