Data Mining and Modeling
The proliferation of machine learning means that learned classifiers lie at the core of many products across Google. However, questions in practice are rarely so clean as to just to use an out-of-the-box algorithm. A big challenge is in developing metrics, designing experimental methodologies, and modeling the space to create parsimonious representations that capture the fundamentals of the problem. These problems cut across Google’s products and services, from designing experiments for testing new auction algorithms to developing automated metrics to measure the quality of a road map.
Data mining lies at the heart of many of these questions, and the research done at Google is at the forefront of the field. Whether it is finding more efficient algorithms for working with massive data sets, developing privacy-preserving methods for classification, or designing new machine learning approaches, our group continues to push the boundary of what is possible.
Recent Publications
Autonomous Causal Inference Using Artificial Intelligence Agents
Teginder Singh
Justin Chen
Kiran Dattani
Sean Hamill
Jake Van Bochove
Technical Disclosure Commons (2025)
Preview abstract
Post-market drug-safety procedures, known as pharmacovigilance, require a team of skilled physicians or epidemiologists to manually investigate each adverse event. This disclosure describes artificial intelligence (AI) agent-based, cloud computing techniques that automate the end-to-end cognitive workflow of investigating potential adverse drug events (ADEs). Moving beyond current techniques, which only perform statistical signal detection, the described techniques enable the determination of biological causality. Upon receiving a statistical signal of an adverse event, plausible biological hypotheses that can explain the signal are autonomously generated. A set of specialized software agents are dispatched to forage for evidence across disparate data sources (real-world evidence platforms, scientific literature, genomic databases, etc.). The results generated by the agents are synthesized into findings that score the likelihood of a causal link. The final output is a detailed, auditable causality dossier that enables human safety experts to make faster, better-informed decisions.
View details
Preview abstract
This paper outlines a grammar of data analysis, as distinct from grammars of data manipulation. The primitives of this grammar are metrics and dimensions. We describe a Python implementation of this grammar called Meterstick, which is agnostic to the underlying data source, which may be a DataFrame or a SQL database.
View details
Preview abstract
Almost no modern software system is written from scratch, and developers are required to effectively learn to use third-party libraries and software services. Thus, many practitioners and researchers have looked for ways to create effective documentation that supports developers’ learning. However, few efforts have focused on how people actually use the documentation. In this paper, we report on an exploratory, multi-phase, mixed methods empirical study of documentation page-view logs from four cloud-based industrial services. By analyzing page-view logs for over 100,000 users, we find diverse patterns of documentation page visits. Moreover, we show statistically that which documentation pages people visit often correlates with user characteristics such as past experience with the specific product, on the one hand, and with future adoption of the API on the other hand. We discuss the implications of these results on documentation design and propose documentation page-view log analysis as a feasible technique for design audits of documentation, from ones written for software developers to ones designed to support end users (e.g., Adobe Photoshop).
View details
Probe-Based Study of Traffic Variability for the Design of Traffic Light Plans
Ori Rottenstreich
Eliav Buchnik
Shai Ferster
Tom Kalvari
Dan Karliner
Omer Litov
Nitzan Tur
Danny Veikherman
Jack Haddad
COMSNETS 2024, https://www.comsnets.org/ (2024)
Preview abstract
Computing efficient traffic signal plans is often based on the amount of traffic in an intersection, its distribution over the various intersection movements and hours as well as on performance metrics such as traffic delay. In their simple and typical form, plans are fixed in the same hour over weekdays. This allows low operation costs without the necessity for traffic detection and monitoring tools. A critical factor in the potential efficiency of such plans is the similarity of traffic patterns over the days along each of the intersection movements. In this paper, we study traffic variability and propose simple metrics to measure it based on traffic volume and traffic delay. We propose an automatic probe data-based method, for city-wide estimation of traffic variability. We discuss how such measures can be used for signal planning such as an indication of which intersections can benefit from dynamic but expensive traffic detection tools or in selecting plan resolution. Likewise, we discuss various methods to mitigate the impact of such variability. We demonstrate the framework based on real traffic statistics to study the traffic variability in the city of Haifa along its 162 intersections.
View details
LinguaMeta: Unified Metadata for Thousands of Languages
Sandy Ritchie
Uche Okonkwo
Emily Drummond
Proceedings of the 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024)
Preview abstract
We introduce LinguaMeta, a unified resource for language metadata for thousands of languages, including language codes, names, number of speakers, writing systems, countries, official status, coordinates, and language varieties. The resources are drawn from various existing repositories and supplemented with our own research. Each data point is tagged for its origin, allowing us to easily trace back to and improve existing resources with more up-to-date and complete metadata. The resource is intended for use by researchers and organizations who aim to extend technology to thousands of languages.
View details
First Passage Percolation with Queried Hints
Kritkorn Karntikoon
Aaron Schild
Yiheng Shen
Ali Sinop
AISTATS (2024)
Preview abstract
Optimization problems are ubiquitous throughout the modern world. In many of these applications, the input is inherently noisy and it is expensive to probe all of the noise in the input before solving the relevant optimization problem. In this work, we study how much of that noise needs to be queried in order to obtain an approximately optimal solution to the relevant problem. We focus on the shortest path problem in graphs, where one may think of the noise as coming from real-time traffic. We consider the following model: start with a weighted base graph $G$ and multiply each edge weight by an independently chosen, uniformly random number in $[1,2]$ to obtain a random graph $G'$. This model is called \emph{first passage percolation}. Mathematicians have studied this model extensively when $G$ is a $d$-dimensional grid graph, but the behavior of shortest paths in this model is still poorly understood in general graphs. We make progress in this direction for a class of graphs that resembles real-world road networks. Specifically, we prove that if the geometric realization of $G$ has constant doubling dimension, then for a given $s-t$ pair, we only need to probe the weights on $((\log n) / \epsilon)^{O(1)}$ edges in $G'$ in order to obtain a $(1 + \epsilon)$-approximation to the $s-t$ distance in $G'$. We also demonstrate experimentally that this result is pessimistic -- one can even obtain a short path in $G'$ with a small number of probes to $G'$.
View details
Some of our teams
×
![]()