1995 International Conference on Acoustics, Speech, and Signal Processing
DOI: 10.1109/icassp.1995.479930
|View full text |Cite
|
Sign up to set email alerts
|

Tree structured non-linear signal modeling and prediction

Abstract: Abstract-In this paper, we develop a regression tree approach to identification and prediction of signals that evolve according to an unknown nonlinear state space model. In this approach, a tree is recursively constructed that partitions the p-dimensional state space into a collection of piecewise homogeneous regions utilizing a 2 p -ary splitting rule with an entropy-based node impurity criterion. On this partition, the joint density of the state is approximately piecewise constant, leading to a nonlinear pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0
1

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 52 publications
(65 reference statements)
0
3
0
1
Order By: Relevance
“…The smallest subblock size may be determined by the fundamental inability to estimate entropy/MI from a very small number of voxels. Entropy estimation based on minimal spanning trees shows promise for estimating entropy/MI from sparse histograms (Michel and Hero, 1999). Further efforts are needed to incorporate that estimation method.…”
Section: Discussionmentioning
confidence: 99%
“…The smallest subblock size may be determined by the fundamental inability to estimate entropy/MI from a very small number of voxels. Entropy estimation based on minimal spanning trees shows promise for estimating entropy/MI from sparse histograms (Michel and Hero, 1999). Further efforts are needed to incorporate that estimation method.…”
Section: Discussionmentioning
confidence: 99%
“…Note that if K is large and the regions are dense such that W(q) (and F(q)) can be considered constant in V k , say equal to W(q k ) for some q k in region V k , then if the adaptation method used in each region converges successfully, this yields w k (t) → W(q k ) and f k (t) → F(q k ) as t → ∞. Hence, if these regions are dense and there is enough data to learn the corresponding models in each region, then this piecewise model can approximate any smoothly varying W(q) and F(q) [22].…”
Section: A Piecewise Linear Turbo Equalization With Fixed Partitioningmentioning
confidence: 99%
“…Hence, if these regions are dense and there is enough data to learn the corresponding models in each region, then this piecewise model can approximate any smoothly varying W(q) and F(q) [22].…”
Section: A Piecewise Linear Turbo Equalization With Fixed Partitioningmentioning
confidence: 99%
“…Dogrusal olma y an baglamm problerni, otomatik ogrenme ve sin y al i�leme literatUrUnde en onemli c;:ah�ma alanlanndan birisidir ve sin y al modelleme, finansal market, y onelim analizi, tavsi y e gibi birc;:ok farkh gerc;:ek ha y at u y gulamasmm temelini olu�turur [1], [2]. Fakat geleneksel baglamm teknikleri, bU y Uk veri ic;:eren gerc;:ek ha y at u y gulamalarmda, elde edilen verinin konvansi y onel sin y al i�leme metotlan ile etkili bir �ekilde i�lenememesi, depolama konusundaki sorunlar ve geleneksel metotlann veri istatistigine oldukc;:a bagh olmasl dola y lSl y la, y eterli performansl gosterememektedir [3].…”
Section: Girisunclassified