Qiyue Yao

dblp:345/6296 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0002-9180-1203ORCID · reported

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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.

Artificial intelligence
2 papers
Representation and self-supervised learning · 65% Knowledge representation and reasoning · 35%
Databases, data mining, and information retrieval
2 papers
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge graphs
taxonomy expansion
1.422024
A Single Vector Is Not Enough: Taxonomy Expansion via Box Embeddings (Extended Abstract) · IJCAI 2024
A Single Vector Is Not Enough: Taxonomy Expansion via Box Embeddings · WWW 2023
Machine learning › Representation and self-supervised learning › representation learning › embedding learning › geometric embedding
box embedding
0.812024
A Single Vector Is Not Enough: Taxonomy Expansion via Box Embeddings (Extended Abstract) · IJCAI 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph
knowledge graph embedding
0.812024
A Single Vector Is Not Enough: Taxonomy Expansion via Box Embeddings (Extended Abstract) · IJCAI 2024
Knowledge graphs › knowledge graph embedding
box embedding
0.812024
A Single Vector Is Not Enough: Taxonomy Expansion via Box Embeddings (Extended Abstract) · IJCAI 2024
Machine learning › Representation and self-supervised learning › representation learning › embedding learning
hierarchical embedding
0.712023
A Single Vector Is Not Enough: Taxonomy Expansion via Box Embeddings · WWW 2023

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

box embedding · 2.8hyperrectangle embedding · 1.3
YearPublicationVenuePosition
2024 A Single Vector Is Not Enough: Taxonomy Expansion via Box Embeddings (Extended Abstract)
Song Jiang 0002, Qiyue Yao, Qifan Wang 0001, Yizhou Sun
IJCAI2
2023 A Single Vector Is Not Enough: Taxonomy Expansion via Box Embeddings
abstract
Taxonomies, which organize knowledge hierarchically, support various practical web applications such as product navigation in online shopping and user profile tagging on social platforms. Given the continued and rapid emergence of new entities, maintaining a comprehensive taxonomy in a timely manner through human annotation is prohibitively expensive. Therefore, expanding a taxonomy automatically with new entities is essential. Most existing methods for expanding taxonomies encode entities into vector embeddings (i.e., single points). However, we argue that vectors are insufficient to model the “is-a” hierarchy in taxonomy (asymmetrical relation), because two points can only represent pairwise similarity (symmetrical relation). To this end, we propose to project taxonomy entities into boxes (i.e., hyperrectangles). Two boxes can be "contained", "disjoint" and "intersecting", thus naturally representing an asymmetrical taxonomic hierarchy. Upon box embeddings, we propose a novel model BoxTaxo for taxonomy expansion. The core of BoxTaxo is to learn boxes for entities to capture their child-parent hierarchies. To achieve this, BoxTaxo optimizes the box embeddings from a joint view of geometry and probability. BoxTaxo also offers an easy and natural way for inference: examine whether the box of a given new entity is fully enclosed inside the box of a candidate parent from the existing taxonomy. Extensive experiments on two benchmarks demonstrate the effectiveness of BoxTaxo compared to vector based models.
Song Jiang 0002, Qiyue Yao, Qifan Wang 0001, Yizhou Sun
WWW2