Language:
English
繁體中文
Help
圖資館首頁
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Universal coding and order identific...
~
Gassiat, elisabeth.
Universal coding and order identification by model selection methods
Record Type:
Electronic resources : Monograph/item
Title/Author:
Universal coding and order identification by model selection methodsby elisabeth Gassiat.
Author:
Gassiat, elisabeth.
Published:
Cham :Springer International Publishing :2018.
Description:
xv, 146 p. :digital ;24 cm.
Contained By:
Springer eBooks
Subject:
Information theoryStatistical methods.
Online resource:
http://dx.doi.org/10.1007/978-3-319-96262-7
ISBN:
9783319962627$q(electronic bk.)
Universal coding and order identification by model selection methods
Gassiat, elisabeth.
Universal coding and order identification by model selection methods
[electronic resource] /by elisabeth Gassiat. - Cham :Springer International Publishing :2018. - xv, 146 p. :digital ;24 cm. - Springer monographs in mathematics,1439-7382. - Springer monographs in mathematics..
1. Lossless Coding -- 2.Universal Coding on Finite Alphabets -- 3.Universal Coding on Infinite Alphabets -- 4.Model Order Estimation -- Notation -- Index.
The purpose of these notes is to highlight the far-reaching connections between Information Theory and Statistics. Universal coding and adaptive compression are indeed closely related to statistical inference concerning processes and using maximum likelihood or Bayesian methods. The book is divided into four chapters, the first of which introduces readers to lossless coding, provides an intrinsic lower bound on the codeword length in terms of Shannon's entropy, and presents some coding methods that can achieve this lower bound, provided the source distribution is known. In turn, Chapter 2 addresses universal coding on finite alphabets, and seeks to find coding procedures that can achieve the optimal compression rate, regardless of the source distribution. It also quantifies the speed of convergence of the compression rate to the source entropy rate. These powerful results do not extend to infinite alphabets. In Chapter 3, it is shown that there are no universal codes over the class of stationary ergodic sources over a countable alphabet. This negative result prompts at least two different approaches: the introduction of smaller sub-classes of sources known as envelope classes, over which adaptive coding may be feasible, and the redefinition of the performance criterion by focusing on compressing the message pattern. Finally, Chapter 4 deals with the question of order identification in statistics. This question belongs to the class of model selection problems and arises in various practical situations in which the goal is to identify an integer characterizing the model: the length of dependency for a Markov chain, number of hidden states for a hidden Markov chain, and number of populations for a population mixture. The coding ideas and techniques developed in previous chapters allow us to obtain new results in this area. This book is accessible to anyone with a graduate level in Mathematics, and will appeal to information theoreticians and mathematical statisticians alike. Except for Chapter 4, all proofs are detailed and all tools needed to understand the text are reviewed.
ISBN: 9783319962627$q(electronic bk.)
Standard No.: 10.1007/978-3-319-96262-7doiSubjects--Topical Terms:
671253
Information theory
--Statistical methods.
LC Class. No.: Q386 / .G377 2018
Dewey Class. No.: 003.54
Universal coding and order identification by model selection methods
LDR
:03407nmm a2200349 a 4500
001
543118
003
DE-He213
005
20190129145228.0
006
m d
007
cr nn 008maaau
008
190411s2018 gw s 0 eng d
020
$a
9783319962627$q(electronic bk.)
020
$a
9783319962610$q(paper)
024
7
$a
10.1007/978-3-319-96262-7
$2
doi
035
$a
978-3-319-96262-7
040
$a
GP
$c
GP
041
1
$a
eng
$h
fre
050
4
$a
Q386
$b
.G377 2018
072
7
$a
GPJ
$2
bicssc
072
7
$a
GPF
$2
bicssc
072
7
$a
COM031000
$2
bisacsh
082
0 4
$a
003.54
$2
23
090
$a
Q386
$b
.G253 2018
100
1
$a
Gassiat, elisabeth.
$3
821248
240
1 0
$a
Codage universel et identification d'ordre par sélection de modeles.
$l
English.
245
1 0
$a
Universal coding and order identification by model selection methods
$h
[electronic resource] /
$c
by elisabeth Gassiat.
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2018.
300
$a
xv, 146 p. :
$b
digital ;
$c
24 cm.
490
1
$a
Springer monographs in mathematics,
$x
1439-7382
505
0
$a
1. Lossless Coding -- 2.Universal Coding on Finite Alphabets -- 3.Universal Coding on Infinite Alphabets -- 4.Model Order Estimation -- Notation -- Index.
520
$a
The purpose of these notes is to highlight the far-reaching connections between Information Theory and Statistics. Universal coding and adaptive compression are indeed closely related to statistical inference concerning processes and using maximum likelihood or Bayesian methods. The book is divided into four chapters, the first of which introduces readers to lossless coding, provides an intrinsic lower bound on the codeword length in terms of Shannon's entropy, and presents some coding methods that can achieve this lower bound, provided the source distribution is known. In turn, Chapter 2 addresses universal coding on finite alphabets, and seeks to find coding procedures that can achieve the optimal compression rate, regardless of the source distribution. It also quantifies the speed of convergence of the compression rate to the source entropy rate. These powerful results do not extend to infinite alphabets. In Chapter 3, it is shown that there are no universal codes over the class of stationary ergodic sources over a countable alphabet. This negative result prompts at least two different approaches: the introduction of smaller sub-classes of sources known as envelope classes, over which adaptive coding may be feasible, and the redefinition of the performance criterion by focusing on compressing the message pattern. Finally, Chapter 4 deals with the question of order identification in statistics. This question belongs to the class of model selection problems and arises in various practical situations in which the goal is to identify an integer characterizing the model: the length of dependency for a Markov chain, number of hidden states for a hidden Markov chain, and number of populations for a population mixture. The coding ideas and techniques developed in previous chapters allow us to obtain new results in this area. This book is accessible to anyone with a graduate level in Mathematics, and will appeal to information theoreticians and mathematical statisticians alike. Except for Chapter 4, all proofs are detailed and all tools needed to understand the text are reviewed.
650
0
$a
Information theory
$x
Statistical methods.
$3
671253
650
1 4
$a
Computer Science.
$3
212513
650
2 4
$a
Coding and Information Theory.
$3
273763
650
2 4
$a
Statistical Theory and Methods.
$3
274054
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
830
0
$a
Springer monographs in mathematics.
$3
557774
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-96262-7
950
$a
Mathematics and Statistics (Springer-11649)
based on 0 review(s)
ALL
電子館藏
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
000000159868
電子館藏
1圖書
電子書
EB Q386 G253 2018 2018
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Multimedia file
http://dx.doi.org/10.1007/978-3-319-96262-7
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login