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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bartley Richardson

dblp:142/9469 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 77% Cloud and datacenter computing · 23%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › hardware acceleration
GPU-accelerated machine learning
0.412020
Accelerating and Expanding End-to-End Data Science Workflows with DL/ML Interoperability Using RAPIDS · KDD 2020

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

feature engineering · 0.9GPU acceleration · 0.9ETL acceleration · 0.9
YearPublicationVenuePosition
2020 Accelerating and Expanding End-to-End Data Science Workflows with DL/ML Interoperability Using RAPIDS
abstract
The lines between data science (DS), machine learning (ML), deep learning (DL), and data mining continue to be blurred and removed. This is great as it ushers in vast amounts of capabilities, but it brings increased complexity and a vast number of tools/techniques. It's not uncommon for DL engineers to use one set of tools for data extraction/cleaning and then pivot to another library for training their models. After training and inference, it's common to then move data yet again by another set of tools for post-processing. The RAPIDS suite of open source libraries not only provides a method to execute and accelerate these tasks using GPUs with familiar APIs, but it also provides interoperability with the broader open source community and DL tools while removing unnecessary serializations that slow down workflows. GPUs provide massive parallelization that DL has leveraged for some time, and RAPIDS provides the missing pieces that extend this computing power to more traditional yet important DS and ML tasks (e.g., ETL, modeling). Complete pipelines can be built that encompass everything, including ETL, feature engineering, ML/DL modeling, inference, and visualization, all while removing typical serialization costs and affording seamless interoperability between libraries. All experiments using RAPIDS can effortlessly be scheduled, logged and reviewed using existing public cloud options. Join our engineers and data scientists as they walk through a collection of DS and ML/DL engineering problems that show how RAPIDS running on Azure ML can be used for end-to-end, entirely GPU pipelines. This tutorial includes specifics on how to use RAPIDS for feature engineering, interoperability with common ML/DL packages, and creating GPU native visualizations using cuxfilter. The use cases presented here give attendees a hands-on approach to using RAPIDS components as part of a larger workflow, seamlessly integrating with other libraries (e.g., TensorFlow) and visualization packages.
Bartley Richardson, Bradley Rees, Tom Drabas, Even Oldridge, David A. Bader, Rachel Allen
KDD1
2019 Streamlined and Accelerated Cyber Analyst Workflows with CLX and RAPIDS
abstract
Cybersecurity poses considerable challenges for Security Operations and IT departments at enterprises across the world. The volume of data is enormous, datasets are often heterogeneous, and rapid responses to anomalous behavior are required. As a result, data science is becoming more important to cybersecurity teams. However, integrating data science tooling with existing security information and event management (SIEM) systems is difficult both at a basic functional level and at the scale demanded by increasing volumes of cyber data. In this paper, we present CLX (Cyber Log Accelerators), a solution built on RAPIDS, the suite of open source libraries for GPU- accelerated data science. CLX provides Input/Output modules to simplify loading SIEM data into analytics workflows and IP address preprocessing functions that are on average 295x faster than their CPU equivalents. We also demonstrate that RAPIDS PageRank and Louvain are on average 2190x and 1240x faster than cost-similar CPU equivalents on data from NVIDIA's internal log processing systems. Using these accelerated tools allows cyber analysts to investigate and respond to potential threats in near real-time.
Nicholas Becker, Ayush Dattagupta, Eli Fajardo, Prem Gali, Bianca Rhodes, Bartley Richardson, Bhargav Suryadevara
IEEE BigData6
2005 Approximate Metrics for Autonomous Semantic Web Ontology Merging
abstract
The semantic Web is the next step in the Internet's evolution. The existing Web contains a considerable amount of data; most is weakly structured. Broadly accessing the data is difficult. Previously unseen data cannot be easily autonomously understood with out a consistent semantic framework. Viewing and organizing data using shared ontologies is essential for both sharing data and for Web site interoperability. Full autonomous or semi-autonomous discovery and development of ontologies is the only feasible way to transition the existing Web to the semantic Web. One strategy is to merge existing, vetted ontologies. The pre-merger ontologies would likely be similar in some respects and different in others. When comparing ontologies, a necessarily imprecise, approximate similarity metric will be necessary. Possibly, soft computing will provide useful tools
Bartley Richardson, Lawrence J. Mazlack
FUZZ-IEEE1