Re: [R] How to use density function to find h_{k}

From: Roger Koenker <roger_at_ysidro.econ.uiuc.edu>
Date: Sun, 03 Jun 2007 12:31:59 -0500 (CDT)

You might try: http://www.stanford.edu/~kasparr/software/silverman.r

But take a look at the referenced paper by Silverman first. You could also try the CRAN package ftnonpar by Kovac and Davies.

url:	www.econ.uiuc.edu/~roger/my.html	Roger Koenker
email	rkoenker_at_uiuc.edu			Department of Economics
vox: 	217-333-4558				University of Illinois
fax:   	217-244-6678				Champaign, IL 61820

On Sun, 3 Jun 2007, Patrick Wang wrote:

> Hi, All:
>
> How can I use the density function to find the minimum of the bandwidth
> make the density function one mode, 2 mode, 3 mode etc. usually the
> larger the bandwidth, the fewer mode of the density. less bumpy.
>
> It will be impossible to try all possible bandwidths to then plot the pdf
> to see how many modes it has. Is there an automatic way to do this Like
> for loop 1000, try bandwidth from (0, 1). is there a function to get
> how many modes from the density function? the Mode function in R doesnot
> seem to serve this purpose.
>
>
> Thanks
> pat
>
> ______________________________________________
> R-help_at_stat.math.ethz.ch mailing list
> https://stat.ethz.ch/mailman/listinfo/r-help
> PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
> and provide commented, minimal, self-contained, reproducible code.
>



R-help_at_stat.math.ethz.ch mailing list
https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code. Received on Sun 03 Jun 2007 - 17:46:51 GMT

Archive maintained by Robert King, hosted by the discipline of statistics at the University of Newcastle, Australia.
Archive generated by hypermail 2.2.0, at Sun 03 Jun 2007 - 18:31:42 GMT.

Mailing list information is available at https://stat.ethz.ch/mailman/listinfo/r-help. Please read the posting guide before posting to the list.