Search Results for author: Jiangning Chen

Found 8 papers, 0 papers with code

Personalized Entity Resolution with Dynamic Heterogeneous KnowledgeGraph Representations

no code implementations ACL (ECNLP) 2021 Ying Lin, Han Wang, Jiangning Chen, Tong Wang, Yue Liu, Heng Ji, Yang Liu, Premkumar Natarajan

We first build a cross-source heterogeneous knowledge graph from customer purchase history and product knowledge graph to jointly learn customer and product embeddings.

Entity Resolution

Optimizing NLU Reranking Using Entity Resolution Signals in Multi-domain Dialog Systems

no code implementations NAACL 2021 Tong Wang, Jiangning Chen, Mohsen Malmir, Shuyan Dong, Xin He, Han Wang, Chengwei Su, Yue Liu, Yang Liu

In dialog systems, the Natural Language Understanding (NLU) component typically makes the interpretation decision (including domain, intent and slots) for an utterance before the mentioned entities are resolved.

Entity Resolution intent-classification +2

Personalized Entity Resolution with Dynamic Heterogeneous Knowledge Graph Representations

no code implementations6 Apr 2021 Ying Lin, Han Wang, Jiangning Chen, Tong Wang, Yue Liu, Heng Ji, Yang Liu, Premkumar Natarajan

For example, with "add milk to my cart", a customer may refer to a certain organic product, while some customers may want to re-order products they regularly purchase.

Entity Resolution

Centroid estimation based on symmetric KL divergence for Multinomial text classification problem

no code implementations29 Aug 2018 Jiangning Chen, Heinrich Matzinger, Haoyan Zhai, Mi Zhou

We define a new method to estimate centroid for text classification based on the symmetric KL-divergence between the distribution of words in training documents and their class centroids.

General Classification text-classification +1

Convergence Rate of Krasulina Estimator

no code implementations28 Aug 2018 Jiangning Chen

This paper consider the problem of finding the least eigenvalue and eigenvector of matrix $\Sigma$.

Cannot find the paper you are looking for? You can Submit a new open access paper.