Mail Archive Search: <+subject:/^(?:^\s*(re|sv|fwd|fw)[\[\]\d]*[:>-]+\s*)*\[S\]\s+Bump\s+Hunting\s*$/>

Results:

References: [ +subject:/^(?:^\s*(re|sv|fwd|fw)[\[\]\d]*[:>-]+\s*)*\[S\]\s+Bump\s+Hunting\s*$/: 7 ]

Total 7 documents matching your query.

1. [S] Bump Hunting (score: 1): Author: Wolfgang Rolke <w_rolke@rumac.upr.clu.edu>; Date: Mon, 26 Apr 1999 14:14:02 -0400; I am currently working in the area of bump hunting with data sets from a high energy physics experiment. I have already played around with some of the standard methods in this area such as Silverman'; /archives/html/s-news/1999-04/msg00234.html (7,923 bytes)
2. [S] Bump Hunting (score: 1): Author: FRBSF Postmaster <FRBSF.Postmaster@sf.frb.org>; Date: Mon, 26 Apr 1999 18:55:46 -0700; owner-s-news@wubios.wustl.edu on 04/26/99 11:14:02 AM To: s-news <s-news@wubios.wustl.edu> cc: Subject: [S] Bump Hunting I am currently working in the area of bump hunting with data sets from a high; /archives/html/s-news/1999-04/msg00238.html (11,080 bytes)
3. [S] bump hunting (score: 1): Author: Wolfgang Rolke <w_rolke@rumac.upr.clu.edu>; Date: Wed, 10 Feb 1999 10:54:11 -0700; I am looking for some info/software for bump hunting. Specifically I am working with some data from High Energy Physics that has some suspicious bumps that may or may not correspond to a particle de; /archives/html/s-news/1999-02/msg00047.html (8,385 bytes)
4. Re: [S] bump hunting (score: 1): Author: jones@reed.edu (Albyn Jones); Date: Wed, 10 Feb 1999 10:19:52 -0800 (PST); one natural alternative is to fit a mixture distribution. as I understand the problem you have several peaks in a histogram, and want to fit something other than a single parametric distribution. if; /archives/html/s-news/1999-02/msg00050.html (9,279 bytes)
5. Re: [S] bump hunting (score: 1): Author: Brett Presnell <presnell@stat.ufl.edu>; Date: Wed, 10 Feb 1999 13:24:26 -0500 (EST); Two nonparametric approaches are Silverman's bandwidth test and the excess mass test. Silverman's test uses as a test statistic the minimum bandwidth for which a kernel density estimate (with normal; /archives/html/s-news/1999-02/msg00051.html (10,801 bytes)
6. RE: [S] bump hunting (score: 1): Author: "Gunter, Bert" <bert_gunter@merck.com>; Date: Wed, 10 Feb 1999 13:47:56 -0500; ... And to add some fuzzy information -- I.J. Good published a paper I believe in JASA (but possibly Statistical Science) about 10-15 years ago I think entitled exactly "Bump Hunting" which, of cours; /archives/html/s-news/1999-02/msg00053.html (7,953 bytes)
7. RE: [S] bump hunting (score: 1): Author: "Harezlak, Jarek" <jharezla@iupui.edu>; Date: Thu, 11 Feb 1999 13:04:33 -0500; If it would be of interest to you, I wrote a thesis on bump hunting in regression recently. The copy of it is on the web: http://hajek.stat.ubc.ca/~nancy/pubs.html In brief, my method works in the r; /archives/html/s-news/1999-02/msg00060.html (11,240 bytes)

Current List: 1 - 7
Page: [1]