GrabJunpeng NiuProblem & solution
Crowdsourced taxonomy verification: A feedback-driven framework for refining knowledge graph relationships via online search interactions
Summary
Dynamic catalogs in food delivery and e-commerce make knowledge-graph (KG) maintenance difficult: LLM- or scraper-generated relationships can be semantically wrong, manual review does not scale, and bad edges can degrade query expansion, CTR, and trust. The proposed feedback-driven verification engine treats unverified edges as hypotheses and uses the search interface as a validation environment. It separates verified and candidate edges, injects a limited number of candidates into lower-risk interface positions through an exploration-versus-exploitation policy, and records context-anchored user interactions with weighted positive and negative signals. An offline engine aggregates exposure and engagement into a confidence ratio, promoting candidates above a verification threshold and pruning those below a failure threshold. The framework is presented as a continuous human-in-the-loop method for validating parent-child and sibling relationships at scale; planned extensions add confidence tiers and defenses against spam, bots, and Sybil attacks.
Context
Dynamic food-delivery and e-commerce catalogs change rapidly, while LLM- and content-extraction-generated knowledge-graph relationships can reflect text co-occurrence rather than semantic reality. Manual verification is described as too slow and expensive for millions of changing entities, and inaccurate edges can propagate into irrelevant search results, reduced CTR, and lower user trust.
Approach / What changed
The framework classifies graph edges as verified or candidate, injects a limited set of candidate relationships into lower-risk search-interface positions, and measures context-specific user interactions. A verification engine aggregates weighted signals using exposure and positive interactions, then promotes candidates above a verification threshold or prunes those below a pruning threshold.
Takeaways
Candidate edges remain hypotheses until live search interactions provide evidence; they are kept separate from verified graph structure and excluded from the main search algorithm until validated.
The behavior tracker anchors each signal to the user’s search term, so an interaction with a candidate relationship is interpreted in its query context rather than as an unqualified vote.
The proposed next stage uses progressive trust states requiring both support mass and corroboration, with automatic demotion when metrics fall below a tier floor; abuse controls exclude flagged traffic and cap cohort contributions.
Source and freshness
- Source
- engineering.grab.com
- Published
- Added to Yomu
- Last updated
Summaries are generated from the original by a language model. Check the original before relying on it.
Keep reading
Related reading
The Good Stuff
Paid picks we use ourselves. Links carry a referral code — a subscription through one earns us a commission at no extra cost to you.
The best engineering reads, once a week
One useful email. Unsubscribe anytime.