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

Michael Farag

dblp:135/4996 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2025
0000-0002-6474-1911ORCID · reported

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

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
Data integration and cleaning · 50% Data mining · 50%

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

TopicWeightPapersLastEvidence papers
Data mining › text mining › information extraction
attribute extraction
0.912025
Cross-Domain Web Information Extraction at Pinterest · KDD (2) 2025
Data integration and cleaning › data extraction
web data extraction
0.912025
Cross-Domain Web Information Extraction at Pinterest · KDD (2) 2025

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

large language model · 0.9XGBoost · 0.9
YearPublicationVenuePosition
2025 Cross-Domain Web Information Extraction at Pinterest
abstract
The internet offers a massive repository of unstructured information, but it's a significant challenge to convert this into a structured format. At Pinterest, the ability to accurately extract structured product data from e-commerce websites is essential to enhance user experiences and improve content distribution. In this paper, we present Pinterest's system for attribute extraction, which achieves remarkable accuracy and scalability at a manageable cost. Our approach leverages a novel webpage representation that combines structural, visual, and text modalities into a compact form, optimizing it for small model learning. This representation captures each visible HTML node with its text, style and layout information. We show how this allows simple models such as eXtreme Gradient Boosting (XGBoost) to extract attributes more accurately than much more complex Large Language Models (LLMs) such as Generative Pre-trained Transformer (GPT). Our results demonstrate a system that is highly scalable, processing over 1,000 URLs per second, while being 1000 times more cost-effective than the cheapest GPT alternatives.
Michael Farag, Patrick Halina, Andrey Zaytsev, Alekhya Munagala, Imtihan Ahmed
KDD (2)1
2015 Matching alignment
abstract
The ergodic interference alignment scheme allows each user in a K-user interference channel to attain half its interference-free rate at any signal-to-noise ratio (SNR). However, this comes at the cost of extraordinarily long delays, since each channel matrix must be paired with a complementary matrix that can cancel out its off-diagonal terms. In this paper, we investigate the opposite approach. Rather than waiting for perfect matches, we simply try to pair together the available channel matrices to attain the highest possible sum rate. We show that this problem is closely connected to the problem of maximum weight matching, which allows us to efficiently evaluate the numerical performance of our scheme.
Michael Farag, Bobak Nazer
ISIT1
2013 The symmetric ergodic capacity of phase-fading interference channels to within a constant gap: 3 users in the strong and very strong regimes
abstract
Consider a three-user time-varying Gaussian interference channel under uniform phase fading. Prior work on ergodic interference alignment has shown that each user can simultaneously achieve half its interference-free rate. In this paper, we combine ideas from ergodic alignment and compute-and-forward to characterize the symmetric ergodic capacity of this channel in the strong and very strong regimes to within a constant gap.
Michael Farag, Bobak Nazer
ISIT1