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

Dale Markowitz

dblp:245/5960 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Information retrieval · 44% Knowledge graphs · 44% Indexing and storage engines · 13%

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

TopicWeightPapersLastEvidence papers
Information retrieval
ranking
0.412019
Contextual Fact Ranking and Its Applications in Table Synthesis and Compression · KDD 2019
Indexing and storage engines › data compression
table compression
0.112019
Contextual Fact Ranking and Its Applications in Table Synthesis and Compression · KDD 2019

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

pointwise ranking · 0.4pairwise ranking · 0.4hypernym database · 0.4deep learning · 0.4
YearPublicationVenuePosition
2019 Contextual Fact Ranking and Its Applications in Table Synthesis and Compression
abstract
Modern search engines increasingly incorporate tabular content, which consists of a set of entities each augmented with a small set of facts. The facts can be obtained from multiple sources: an entity's knowledge base entry, the infobox on its Wikipedia page, or its row within a WebTable. Crucially, the informativeness of a fact depends not only on the entity but also the specific context(e.g., the query).To the best of our knowledge, this paper is the first to study the problem of contextual fact ranking: given some entities and a context (i.e., succinct natural language description), identify the most informative facts for the entities collectively within the context.We propose to contextually rank the facts by exploiting deep learning techniques. In particular, we develop pointwise and pair-wise ranking models, using textual and statistical information for the given entities and context derived from their sources. We enhance the models by incorporating entity type information from an IsA (hypernym) database. We demonstrate that our approaches achieve better performance than state-of-the-art baselines in terms of MAP, NDCG, and recall. We further conduct user studies for two specific applications of contextual fact ranking-table synthesis and table compression-and show that our models can identify more informative facts than the baselines.
Silu Huang, Flip Korn, Xuezhi Wang 0002, You Wu 0001, Dale Markowitz, Cong Yu 0001
KDD6