Applying Knowledge Graphs to Scene Understanding in Meituan's Hotel and Travel Search

This presentation details how Meituan leverages knowledge‑graph technology to model hotel and travel business characteristics, perform scene cognition, build a multi‑layer knowledge graph, and design a five‑stage search architecture that combines precise and generic queries with AI‑driven ranking and explainable recommendation techniques.

DataFunTalk
DataFunTalk
DataFunTalk
Applying Knowledge Graphs to Scene Understanding in Meituan's Hotel and Travel Search

The talk introduces the unique characteristics of Meituan's hotel and travel (酒旅) business, emphasizing the larger travel radius compared with local services and illustrating user scenarios such as skiing, beach trips, hotel searches by landmark or brand, and scenic‑spot queries.

It defines "scene cognition" as interpreting user search behavior as explicit expressions of demand scenarios, mapping these scenarios to tags, and retrieving matching merchants.

The knowledge‑graph construction covers four layers: category taxonomy, atomic concepts extracted from reviews and merchant data, demand concepts formed by semantic combination of atomic concepts, and POI layer linking merchants to these concepts. Extraction pipelines combine semi‑supervised pattern learning, NER, and BERT‑CRF models, while classification uses multi‑label approaches and multi‑task training.

Meituan's proprietary MT‑BERT model, enriched with massive user‑generated content, improves both extraction and classification performance.

A five‑layer service‑search architecture (L0–L4) is described: L0 builds knowledge indexes; L1 parses queries into structured intents; L2 applies deep‑learning ranking; L3 adjusts strategies per business scenario; L4 provides explainable tags and recommendation reasons.

Two main search intents are covered: precise merchant search (single‑point and multi‑point) and generic scene search (landmark+X, local+X, nationwide+X). Technical solutions include context‑aware entity linking, vector similarity via skip‑gram and GCN on heterogeneous graphs, and multi‑step query processing for generic scenes.

Recommendation explanations are generated either by extraction (using BERT‑MRC and pointer‑generator networks) or by generation (transformer‑based sentence compression and KG‑driven synthesis), followed by quality assessment and online traffic distribution.

Original Source

Signed-in readers can open the original source through BestHub's protected redirect.

Sign in to view source
Republication Notice

This article has been distilled and summarized from source material, then republished for learning and reference. If you believe it infringes your rights, please contactadmin@besthub.devand we will review it promptly.

AIKnowledge GraphSearchMeituanscene understanding
DataFunTalk
Written by

DataFunTalk

Dedicated to sharing and discussing big data and AI technology applications, aiming to empower a million data scientists. Regularly hosts live tech talks and curates articles on big data, recommendation/search algorithms, advertising algorithms, NLP, intelligent risk control, autonomous driving, and machine learning/deep learning.

0 followers
Reader feedback

How this landed with the community

Sign in to like

Rate this article

Was this worth your time?

Sign in to rate
Discussion

0 Comments

Thoughtful readers leave field notes, pushback, and hard-won operational detail here.