Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Large, Sparse Optimal Matching With Refined Covariate Balance in an Observational Study of the Health Outcomes Produced by New Surgeons
by
Kelz, Rachel R.
, Rosenbaum, Paul R.
, Silber, Jeffrey H.
, Pimentel, Samuel D.
in
Algorithms
/ Applications and Case Studies
/ Clinical outcomes
/ Covariance
/ Fine balance
/ Health
/ Health status
/ Hospitals
/ Matching
/ Network management systems
/ Network optimization
/ Networks
/ Observational studies
/ Optimal matching
/ Optimization
/ Patients
/ Physicians
/ Sparse networks
/ Statistics
/ Surgeons
/ surgery
2015
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Large, Sparse Optimal Matching With Refined Covariate Balance in an Observational Study of the Health Outcomes Produced by New Surgeons
by
Kelz, Rachel R.
, Rosenbaum, Paul R.
, Silber, Jeffrey H.
, Pimentel, Samuel D.
in
Algorithms
/ Applications and Case Studies
/ Clinical outcomes
/ Covariance
/ Fine balance
/ Health
/ Health status
/ Hospitals
/ Matching
/ Network management systems
/ Network optimization
/ Networks
/ Observational studies
/ Optimal matching
/ Optimization
/ Patients
/ Physicians
/ Sparse networks
/ Statistics
/ Surgeons
/ surgery
2015
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Large, Sparse Optimal Matching With Refined Covariate Balance in an Observational Study of the Health Outcomes Produced by New Surgeons
by
Kelz, Rachel R.
, Rosenbaum, Paul R.
, Silber, Jeffrey H.
, Pimentel, Samuel D.
in
Algorithms
/ Applications and Case Studies
/ Clinical outcomes
/ Covariance
/ Fine balance
/ Health
/ Health status
/ Hospitals
/ Matching
/ Network management systems
/ Network optimization
/ Networks
/ Observational studies
/ Optimal matching
/ Optimization
/ Patients
/ Physicians
/ Sparse networks
/ Statistics
/ Surgeons
/ surgery
2015
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Large, Sparse Optimal Matching With Refined Covariate Balance in an Observational Study of the Health Outcomes Produced by New Surgeons
Journal Article
Large, Sparse Optimal Matching With Refined Covariate Balance in an Observational Study of the Health Outcomes Produced by New Surgeons
2015
Request Book From Autostore
and Choose the Collection Method
Overview
Every newly trained surgeon performs her first unsupervised operation. How do the health outcomes of her patients compare with the patients of experienced surgeons? Using data from 498 hospitals, we compare 1252 pairs comprised of a new surgeon and an experienced surgeon working at the same hospital. We introduce a new form of matching that matches patients of each new surgeon to patients of an otherwise similar experienced surgeon at the same hospital, perfectly balancing 176 surgical procedures and closely balancing a total of 2.9 million categories of patients; additionally, the individual patient pairs are as close as possible. A new goal for matching is introduced, called \"refined covariate balance,\" in which a sequence of nested, ever more refined, nominal covariates is balanced as closely as possible, emphasizing the first or coarsest covariate in that sequence. A new algorithm for matching is proposed and the main new results prove that the algorithm finds the closest match in terms of the total within-pair covariate distances among all matches that achieve refined covariate balance. Unlike previous approaches to forcing balance on covariates, the new algorithm creates multiple paths to a match in a network, where paths that introduce imbalances are penalized and hence avoided to the extent possible. The algorithm exploits a sparse network to quickly optimize a match that is about two orders of magnitude larger than is typical in statistical matching problems, thereby permitting much more extensive use of fine and near-fine balance constraints. The match was constructed in a few minutes using a network optimization algorithm implemented in R. An R package called rcbalance implementing the method is available from CRAN.
MBRLCatalogueRelatedBooks
Related Items
Related Items
This website uses cookies to ensure you get the best experience on our website.