Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sze-Kui Ng

dblp:06/4624 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Information theory · 56% Mathematical optimization · 44%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › statistical inference › detection and estimation
estimation and filtering
0.011987
Optimal functional expansion for estimation from counting observations · IEEE Trans. Inf. Theory 1987
Mathematical optimization › statistical estimation › point estimation
nonlinear estimation
0.011987
Optimal functional expansion for estimation from counting observations · IEEE Trans. Inf. Theory 1987
Information theory › estimation theory › optimality criteria
minimum variance estimation
0.011987
Optimal functional expansion for estimation from counting observations · IEEE Trans. Inf. Theory 1987

Methods — techniques the papers use, named apart from their topics

wiener-hopf equation · 0.0iterated integral series · 0.0fourier-charlier series · 0.0
YearPublicationVenuePosition
1987 Optimal functional expansion for estimation from counting observations
abstract
A systematic method to develop approximate nonlinear estimators is presented, in the form of a functional series, for the signal that modulates the rate of a counting process. The estimators are optimal for the given structure and approach the minimum variance (MV) estimator when the approximation order increases. Two kinds of functional series, the iterated integral (II) series and the Fourier-Charlier (FC) series, are used. Product-to-sum formulas for the II and FC functionals are derived. By using the formulas, the MV estimate is projected onto the Hilbert subspaces of the II and the FC series driven by the counting observations with the given index set. The projection results in a Wiener-Hopf type equation for the II kernels and a system of linear algebraic equations for the FC coefficients. The FC series estimator consists of finitely many single Wiener integrals of the counting observations and a nonlinear postprocessor. The nonlinear postprocessor, however, is not memoryless.
James Ting-Ho Lo, Sze-Kui Ng
IEEE Trans. Inf. Theory2