Graphs are everywhere, and a firm understanding of graph-based analytical techniques can be extremely powerful when applied to modern practical problems. Modern frameworks and analytical techniques are making graph analysis methods viable for increasingly large workloads and complex tasks. As components of a machine learning toolkit, graph analytics have a number of advantages, not least of which are their interpretability, robustness to imbalanced data, and modeling flexibility.
Zachary Hanif examines three prominent graph analytic methods, including graph convolutional networks, and applies them to concrete use cases. Zachary details where these methods fit into existing machine learning pipelines as well as areas where graph analysis provides compelling alternatives to less interpretable models. Along the way, he discusses traversal, vertex-based, and deep learning methods for exploring graph networks and demonstrates ideal problem statements for each method. Zachary pays particular attention to graph convolutional networks, a cutting-edge deep learning methodology for analyzing graph data. He concludes by examining applications of these techniques for multiple modern workloads and contexts.
Zachary Hanif is a director in Capital One’s Center for Machine Learning, where he leads teams focused on applying machine learning to cybersecurity and financial crime. His research interests include applications of machine learning and graph mining within the realm of massive security data and the automation of model validation and governance. Zachary graduated from the Georgia Institute of Technology.
For exhibition and sponsorship opportunities, email strataconf@oreilly.com
For information on trade opportunities with O'Reilly conferences, email partners@oreilly.com
View a complete list of Strata Data Conference contacts
©2018, O'Reilly Media, Inc. • (800) 889-8969 or (707) 827-7019 • Monday-Friday 7:30am-5pm PT • All trademarks and registered trademarks appearing on oreilly.com are the property of their respective owners. • confreg@oreilly.com