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

David Bayani

dblp:223/3231 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0001-5811-6792ORCID · corroborated

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

Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Databases, 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
Information retrieval · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › interactive information retrieval › adaptive retrieval
active search
0.312018
Active Search of Connections for Case Building and Combating Human Trafficking · KDD 2018
Computational social science and digital humanities › social network analysis
criminal network analysis
0.112018
Active Search of Connections for Case Building and Combating Human Trafficking · KDD 2018

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

local algorithm · 0.7active learning · 0.7
YearPublicationVenuePosition
2022 Fanoos: Multi-resolution, Multi-strength, Interactive Explanations for Learned Systems
David Bayani, Stefan Mitsch
VMCAI1
2018 Active Search of Connections for Case Building and Combating Human Trafficking
abstract
How can we help an investigator to efficiently connect the dots and uncover the network of individuals involved in a criminal activity based on the evidence of their connections, such as visiting the same address, or transacting with the same bank account? We formulate this problem as Active Search of Connections, which finds target entities that share evidence of different types with a given lead, where their relevance to the case is queried interactively from the investigator. We present RedThread, an efficient solution for inferring related and relevant nodes while incorporating the user's feedback to guide the inference. Our experiments focus on case building for combating human trafficking, where the investigator follows leads to expose organized activities, i.e. different escort advertisements that are connected and possibly orchestrated. RedThread is a local algorithm and enables online case building when mining millions of ads posted in one of the largest classified advertising websites. The results of RedThread are interpretable, as they explain how the results are connected to the initial lead. We experimentally show that RedThread learns the importance of the different types and different pieces of evidence, while the former could be transferred between cases.
Reihaneh Rabbany, David Bayani, Artur Dubrawski
KDD2