Markov State Space Aggregation via the Information Bottleneck Method

التفاصيل البيبلوغرافية
العنوان: Markov State Space Aggregation via the Information Bottleneck Method
المؤلفون: Geiger, B. C.
المصدر: Schedae Informaticae.
مصطلحات موضوعية: Markov chains, state space aggregation, coarse-graining, information bottleneck, relative entropy, lumpability
الوصف: Consider the problem of approximating a Markov chain by another Markov chain with a smaller state space that is obtained by partitioning the original state space. An information-theoretic cost function is proposed that is based on the relative entropy rate between the original Markov chain and a Markov chain defined by the partition. The state space aggregation problem can be sub-optimally solved by using the information bottleneck method.
نوع الوثيقة: Article
اللغة: English
الوصول الحر: http://yadda.icm.edu.pl/baztech/element/bwmeta1.element.baztech-f7ff8260-9deb-4ecf-92cc-3415cd5b8a5cTest
رقم الانضمام: edsbzt.bwmeta1.element.baztech.f7ff8260.9deb.4ecf.92cc.3415cd5b8a5c
قاعدة البيانات: BazTech