Xian Li | AutoKnow: Self-Driving Knowledge Collection For Products
KGC 2021
•
19m
Can one build a knowledge graph (KG) for all products in the world? Knowledge graphs have firmly established themselves as valuable sources of information for search and question answering, and it is natural to wonder if a KG can contain information about products
offered at online retail sites. There have been several successful examples of generic KGs, but organizing information about products poses many additional challenges, including sparsity and noise of structured data for products, complexity of the domain with millions of product types and thousands of attributes, heterogeneity across a large number of categories, as well as large and constantly growing number of products. We present AutoKnow, our automatic (self-driving) system that addresses these challenges. The system includes a suite of novel techniques for taxonomy construction, product property identification, knowledge extraction, anomaly detection, and synonym discovery. AutoKnow is (a) automatic, requiring little human intervention, (b) multi-scalable, scalable
in multiple dimensions (many domains, many products, and many attributes), and (c) integrative, exploiting rich customer behavior logs. AutoKnow has been operational in collecting product knowledge for over 11K product types.
Up Next in KGC 2021
-
Amgad Madkour | Entity Life Cycle In ...
Entity-based results are becoming an integral part of the search experience. Search-centric companies highly rely on knowledge graphs in providing the necessary information for building rich search experiences. An entity can originate from a structured, semi-structured, or unstructured data sourc...
-
Mike Welch | Serving A Web Scale Kno...
The Yahoo Knowledge Graph powers entity data for user experiences across multiple products at Verizon Media, from search to media to ads. Nodes in the knowledge graph correspond to real world entities: people, places, movies, sports teams, and so on. The edges represent semantic relationships bet...
-
Ryan Wisnesky | How To Optimally Merg...
In this talk we describe a new technique for merging knowledge graphs: translating the knowledge graph schemas into categories and the knowledge graph data into functors, then applying the "co-limit/pushout" construction from a branch of mathematics called category theory to merge these categorie...
