Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/3143
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAugustyns, Ilse-
dc.contributor.authorWand, MP-
dc.date.accessioned2007-11-26T15:57:03Z-
dc.date.available2007-11-26T15:57:03Z-
dc.date.issued1998-
dc.identifier.citationCOMPUTATIONAL STATISTICS, 13(4). p. 447-461-
dc.identifier.issn0943-4062-
dc.identifier.urihttp://hdl.handle.net/1942/3143-
dc.description.abstractWe develop a rule for choosing bandwidths for local polynomial smoothing of ordered multinomial data. Our method is a variant of the double smoothing idea and is particularly geared towards good performance near the boundaries of the data, through the use of exact risk expressions.-
dc.language.isoen-
dc.publisherPHYSICA VERLAG GMBH-
dc.subject.othercategorical data; contingency table; double smoothing; Kernel estimator; sparse multinomial data-
dc.titleBandwidth selection for local polynomial smoothing of multinomial data-
dc.typeJournal Contribution-
dc.identifier.epage461-
dc.identifier.issue4-
dc.identifier.spage447-
dc.identifier.volume13-
local.format.pages15-
dc.description.notesLimburgs Univ Ctr, Dept Stat, B-3590 Diepenbeek, Belgium. Univ New S Wales, Australian Grad Sch Management, Sydney, NSW 2052, Australia.Augustyns, I, Limburgs Univ Ctr, Dept Stat, Univ Campus, B-3590 Diepenbeek, Belgium.-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcatA1-
local.classdsPublValOverrule/internal_author_not_expected-
dc.identifier.isi000077902300002-
item.contributorAugustyns, Ilse-
item.contributorWand, MP-
item.fulltextNo Fulltext-
item.validationecoom 2000-
item.fullcitationAugustyns, Ilse & Wand, MP (1998) Bandwidth selection for local polynomial smoothing of multinomial data. In: COMPUTATIONAL STATISTICS, 13(4). p. 447-461.-
item.accessRightsClosed Access-
crisitem.journal.issn0943-4062-
crisitem.journal.eissn1613-9658-
Appears in Collections:Research publications
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.