Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yi-Jing Hao

dblp:190/3013 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Artificial intelligence and machine learning · 3Graphics, computer vision, multimedia, augmented reality and games · 1

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.

Theoretical computer science
1 paper
Algorithms and data structures · 77% Information theory · 23%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › similarity search › nearest neighbor search
approximate nearest neighbor search
0.312017
S2JSD-LSH: A Locality-Sensitive Hashing Schema for Probability Distributions · AAAI 2017
Algorithms and data structures › data structure design › search structures › hashing
locality-sensitive hashing
0.312017
S2JSD-LSH: A Locality-Sensitive Hashing Schema for Probability Distributions · AAAI 2017
Information theory › information measures › divergence measures
jensen-shannon divergence
0.112017
S2JSD-LSH: A Locality-Sensitive Hashing Schema for Probability Distributions · AAAI 2017
Information theory › probability theory
probability metrics
0.112017
S2JSD-LSH: A Locality-Sensitive Hashing Schema for Probability Distributions · AAAI 2017

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

locality-sensitive hashing · 0.3hashing function design · 0.3
YearPublicationVenuePosition
2018 Query completion in community-based Question Answering search
Xianling Mao, Yi-Jing Hao, Heyan Huang
Neurocomputing2
2017 S2JSD-LSH: A Locality-Sensitive Hashing Schema for Probability Distributions
abstract
To compare the similarity of probability distributions, the information-theoretically motivated metrics like Kullback-Leibler divergence (KL) and Jensen-Shannon divergence (JSD) are often more reasonable compared with metrics for vectors like Euclidean and angular distance. However, existing locality-sensitive hashing (LSH) algorithms cannot support the information-theoretically motivated metrics for probability distributions. In this paper, we first introduce a new approximation formula for S2JSD-distance, and then propose a novel LSH scheme adapted to S2JSD-distance for approximate nearest neighbors search in high-dimensional probability distributions. We define the specific hashing functions, and prove their local-sensitivity. Furthermore, extensive empirical evaluations well illustrate the effectiveness of the proposed hashing schema on six public image datasets and two text datasets, in terms of mean Average Precision, Precision@N and Precision-Recall curve.
Xianling Mao, Bo-Si Feng, Yi-Jing Hao, Liqiang Nie, Heyan Huang, Guihua Wen
AAAI3
2016 A Novel Fast Framework for Topic Labeling Based on Similarity-preserved Hashing
abstract
Recently, topic modeling has been widely applied in data mining due to its powerful ability. A common, major challenge in applying such topic models to other tasks is to accurately interpret the meaning of each topic. Topic labeling, as a major interpreting method, has attracted significant attention recently. However, most of previous works only focus on the effectiveness of topic labeling, and less attention has been paid to quickly creating good topic descriptors; meanwhile, it’s hard to assign labels for new emerging topics by using most of existing methods. To solve the problems above, in this paper, we propose a novel fast topic labeling framework that casts the labeling problem as a k-nearest neighbor (KNN) search problem in a probability vector set. Our experimental results show that the proposed sequential interleaving method based on locality sensitive hashing (LSH) technology is efficient in boosting the comparison speed among probability distributions, and the proposed framework can generate meaningful labels to interpret topics, including new emerging topics.
Xianling Mao, Yi-Jing Hao, Wenqing Yuan, Liner Yang, Heyan Huang
COLING2