JSM 2004 - Toronto

Abstract #300838

This is the preliminary program for the 2004 Joint Statistical Meetings in Toronto, Canada. Currently included in this program is the "technical" program, schedule of invited, topic contributed, regular contributed and poster sessions; Continuing Education courses (August 7-10, 2004); and Committee and Business Meetings. This on-line program will be updated frequently to reflect the most current revisions.

To View the Program:
You may choose to view all activities of the program or just parts of it at any one time. All activities are arranged by date and time.

The views expressed here are those of the individual authors
and not necessarily those of the ASA or its board, officers, or staff.


Back to main JSM 2004 Program page



Activity Number: 436
Type: Contributed
Date/Time: Thursday, August 12, 2004 : 10:30 AM to 12:20 PM
Sponsor: Section on Bayesian Statistical Science
Abstract - #300838
Title: Bayesian Monotone Smoothing
Author(s): Farideh H. Dehkordi-Vakil*+
Companies: Western Illinois University
Address: Stipes Hall 431M, Macomb, IL, 61455,
Keywords: monotone smoothing ; Bayesian ; regression ; WinBugs
Abstract:

The data from many disciplines call for regression on smooth monotone functions. As is well known, the classical pool-adjacent-violators technique of monotonizing does not yield a curve that is necessary smooth, and the classical spline-fitting produces a smooth function, but it is not guaranteed to be monotone. This situation has much improved, during the recent years, thanks to the contributions of such authors as J.O. Ramsay and Xuming He and Peide Shi. The methods these authors use is based on sophisticated optimization techniques and requires codes that are specifically designed for the purpose of this problem. We present a Bayesian approach to this problem, which offers distinct advantage over the optimization methods on at least two grounds. Bayesian framework offers the possibility of a direct estimation of the regression function through sampling methods without the use of optimal criterion. This, in turn, makes our method computationally simpler, for it allows us to use the widely available software, WinBugs, developed for the implementation of Markov chain Monte Carlo method. No special code is needed.


  • The address information is for the authors that have a + after their name.
  • Authors who are presenting talks have a * after their name.

Back to the full JSM 2004 program

JSM 2004 For information, contact jsm@amstat.org or phone (888) 231-3473. If you have questions about the Continuing Education program, please contact the Education Department.
Revised March 2004