Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Curtis B. Storlie

dblp:83/2365 · also Curt Storlie · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
2since 2021 · last 2022
0000-0002-2464-6864ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 2 since 2021Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Optimization for machine learning · 100%
Network and information security
1 paper
Malware analysis · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › convex optimization
semidefinite programming
0.112012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012
Data mining
clustering
0.112012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012
Data mining › clustering
multiple kernel clustering
0.112012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012
Data mining › clustering
spectral clustering
0.112012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012
Malware analysis › malware similarity
malware clustering
0.012012
Multiple Kernel Learning Clustering with an Application to Malware · ICDM 2012

Methods — techniques the papers use, named apart from their topics

semidefinite programming · 0.4multiple kernel learning · 0.4interior-point method · 0.3interior point method · 0.1
YearPublicationVenuePosition
2022 Real-time risk prediction of colorectal surgery-related post-surgical complications using GRU-D model
Xiaoyang Ruan, Sunyang Fu, Curtis B. Storlie, Kellie L. Mathis, David W. Larson
J. Biomed. Informatics3
2021 Improving the delivery of palliative care through predictive modeling and healthcare informatics
abstract
OBJECTIVE: Access to palliative care (PC) is important for many patients with uncontrolled symptom burden from serious or complex illness. However, many patients who could benefit from PC do not receive it early enough or at all. We sought to address this problem by building a predictive model into a comprehensive clinical framework with the aims to (i) identify in-hospital patients likely to benefit from a PC consult, and (ii) intervene on such patients by contacting their care team. MATERIALS AND METHODS: Electronic health record data for 68 349 inpatient encounters in 2017 at a large hospital were used to train a model to predict the need for PC consult. This model was published as a web service, connected to institutional data pipelines, and consumed by a downstream display application monitored by the PC team. For those patients that the PC team deems appropriate, a team member then contacts the patient's corresponding care team. RESULTS: Training performance AUC based on a 20% holdout validation set was 0.90. The most influential variables were previous palliative care, hospital unit, Albumin, Troponin, and metastatic cancer. The model has been successfully integrated into the clinical workflow making real-time predictions on hundreds of patients per day. The model had an "in-production" AUC of 0.91. A clinical trial is currently underway to assess the effect on clinical outcomes. CONCLUSIONS: A machine learning model can effectively predict the need for an inpatient PC consult and has been successfully integrated into practice to refer new patients to PC.
Dennis Murphree, Patrick M. Wilson, Shusaku W. Asai, Daniel J. Quest, Yaxiong Lin, Piyush Mukherjee, Nirmal Chhugani, Jacob J. Strand, Gabriel Demuth, David Mead, Brian Wright, Andrew M. Harrison, Jalal Soleimani, Vitaly Herasevich, Brian W. Pickering, Curtis B. Storlie
J. Am. Medical Informatics Assoc.16
2018 Use of an early warning system with gradual alerting reduces time to therapy in acute inpatient deterioration
Santiago Romero-Brufau, Jordan Kautz, Kim Gaines, Curtis B. Storlie, Matthew G. Johnson, Joel Hickman, Jeanne Huddleston
AMIA4
2017 Identification of Clinically Meaningful Plasma Transfusion Subgroups Using Unsupervised Random Forest Clustering
Che Ngufor, Matthew A. Warner, Dennis Murphree, Rickey E. Carter, Curtis B. Storlie, Daryl J. Kor
AMIA6
2016 Power usage of production supercomputers and production workloads
abstract
Summary Power is becoming an increasingly important concern for large supercomputer centers. However, to date, there have been a dearth of studies of power usage ‘in the wild’—on production supercomputers running production workloads. In this paper, we present the initial results of a project to characterize the power usage of the three Top500 supercomputers at Los Alamos National Laboratory: Cielo, Roadrunner, and Luna (#15, #19, and #47, respectively, on the June 2012 Top500 list). Power measurements taken both at the switchboard level and within the compute racks are presented and discussed. Some noteworthy results of this study are that (1) variability in power consumption differs across architectures, even when running a similar workload and (2) Los Alamos National Laboratory's scientific workload draws, on average, only 70–75% of LINPACK power and only 40–55% of nameplate power, implying that power capping may enable a substantial reduction in power and cooling infrastructure while impacting comparatively few applications. Copyright © 2013 John Wiley & Sons, Ltd.
Scott Pakin, Curtis B. Storlie, Michael Lang 0003, Bob Fields, Eloy E. Romero Jr., Craig Idler, Sarah Ellen Michalak, Hugh Greenberg, Josip Loncaric, Randal Rheinheimer, Gary Grider, Joanne Wendelberger
Concurr. Comput. Pract. Exp.2
2012 Multiple Kernel Learning Clustering with an Application to Malware
abstract
With the increasing prevalence of richer, more complex data sources, learning with multiple views is becoming more widespread. Multiple kernel learning (MKL) has been developed to address this problem, but in general, the solutions provided by traditional MKL are restricted to a classification objective function. In this work, we develop a novel multiple kernel learning algorithm that is based on a spectral clustering objective function which is able to find an optimal kernel weight vector for the clustering problem. We go on to show how this optimization problem can be cast as a semidefinite program and efficiently solved using off-the-shelf interior point methods.
Blake Anderson, Curtis B. Storlie, Terran Lane
ICDM2