Trust and Safety at Indeed: Detecting and Preventing Fraud in Real-time

At Indeed, we help people get jobs.

The Trust & Safety team at Indeed contributes to our mission by developing, enforcing, and advocating for quality, creates policies to govern content, and evaluates many different fraud vectors including job postings, messaging, data export, and more. This ensures the safety of jobseekers and that all employers are able to have a robust pool of qualified applicants to meet their hiring needs.  

Our data streams flow between several employer and jobseeker teams. With the use of Confluent we leverage this data to create a safe and trusted marketplace. However fraudsters are constantly finding new ways to exploit our platform so our job is never done. Trust and safety teams must move fast while delivering scalable and reliable solutions.  

This presentation will go into the details of how we built and grew a robust platform with Confluent:

- What it means to scale knowledge and skills of teams across for Trust and Safety  - We will present the tools and Reactor-based streaming abstraction to enable teams for quickly building robust event-driven microservices  - Addressing short and long term value - for both technical and business with reliable insights  - Identifying feature gaps and driving their prioritization

Your presenters:

Ryan Merriman is a Principal engineer in Trust and Safety at Indeed with over 12 years of experience working with distributed systems. From when Hadoop was just HDFS and MapReduce, Ryan has gained expertise in many open source projects including Kafka. He was previously an Apache committer on an open-source SIEM (Security Information and Event Management) named Metron.

Gayathri Veale   With over 20 years of experience working with various databases and datastores, I will co-present with Ryan on lessons we learned building the Trust and safety platform in an accelerated pace:

If you are a data driven engineering organization with solid leadership, join Ryan and me for this talk and let’s have a discussion.