All Projects → iai-group → DynamicEntitySummarization-DynES

iai-group / DynamicEntitySummarization-DynES

Licence: other
Dynamic Entity Summarization (DynES)

Projects that are alternatives of or similar to DynamicEntitySummarization-DynES

Nlp Papers
Papers and Book to look at when starting NLP 📚
Stars: ✭ 111 (+428.57%)
Mutual labels:  paper, summarization
paper
ReScript bindings for react-native-paper
Stars: ✭ 14 (-33.33%)
Mutual labels:  paper
Machine-Learning-Notes
Lecture Notes of Andrew Ng's Machine Learning Course
Stars: ✭ 60 (+185.71%)
Mutual labels:  summarization
Awesome-Human-Activity-Recognition
An up-to-date & curated list of Awesome IMU-based Human Activity Recognition(Ubiquitous Computing) papers, methods & resources. Please note that most of the collections of researches are mainly based on IMU data.
Stars: ✭ 72 (+242.86%)
Mutual labels:  paper
Glowkit
A fork of the Paper (Bukkit) API for use in Glowstone
Stars: ✭ 17 (-19.05%)
Mutual labels:  paper
ode-lstms
Code repository of the paper Learning Long-Term Dependencies in Irregularly-Sampled Time Series
Stars: ✭ 72 (+242.86%)
Mutual labels:  paper
3DObjectTracking
Official Code: A Sparse Gaussian Approach to Region-Based 6DoF Object Tracking
Stars: ✭ 375 (+1685.71%)
Mutual labels:  paper
jpeg-defense
SHIELD: Fast, Practical Defense and Vaccination for Deep Learning using JPEG Compression
Stars: ✭ 82 (+290.48%)
Mutual labels:  paper
AdvPC
AdvPC: Transferable Adversarial Perturbations on 3D Point Clouds (ECCV 2020)
Stars: ✭ 35 (+66.67%)
Mutual labels:  paper
DeepChannel
The pytorch implementation of paper "DeepChannel: Salience Estimation by Contrastive Learning for Extractive Document Summarization"
Stars: ✭ 24 (+14.29%)
Mutual labels:  summarization
triumph-gui
Simple lib to create inventory GUIs for Bukkit platforms.
Stars: ✭ 196 (+833.33%)
Mutual labels:  paper
PQ-NET
code for our CVPR 2020 paper "PQ-NET: A Generative Part Seq2Seq Network for 3D Shapes"
Stars: ✭ 99 (+371.43%)
Mutual labels:  paper
Parceler
简单的Bundle数据注入框架
Stars: ✭ 107 (+409.52%)
Mutual labels:  entity
DecisionTrees
Seminar work "Decision Trees - An Introduction" with presentation, seminar paper, and Python implementation
Stars: ✭ 111 (+428.57%)
Mutual labels:  paper
TitleStylist
Source code for our "TitleStylist" paper at ACL 2020
Stars: ✭ 72 (+242.86%)
Mutual labels:  summarization
AIPaperCompleteDownload
Complete download for papers in various top conferences
Stars: ✭ 64 (+204.76%)
Mutual labels:  paper
DTE
Generate C# class from database table
Stars: ✭ 26 (+23.81%)
Mutual labels:  entity
deep-atrous-guided-filter
Deep Atrous Guided Filter for Image Restoration in Under Display Cameras (UDC Challenge, ECCV 2020).
Stars: ✭ 32 (+52.38%)
Mutual labels:  paper
teanaps
자연어 처리와 텍스트 분석을 위한 오픈소스 파이썬 라이브러리 입니다.
Stars: ✭ 91 (+333.33%)
Mutual labels:  summarization
SciDownl
An unofficial api for downloading papers from SciHub via DOI, PMID
Stars: ✭ 103 (+390.48%)
Mutual labels:  paper

Dynamic Entity Summarization (DynES)

This repository provides resources developed within the following paper:

F. Hasibi, K. Balog, and S.E. Bratsberg. Dynamic Factual Summaries for Entity Cards, In proceedings of 40th ACM SIGIR conference on Research and Development in Information Retrieval (SIGIR ’17), pages 773--782, 2017. DOI:10.1145/3077136.3080810

You can get the authors' version of the atricle and the presentation from the these links: [paper, presentation]

Abstract

Entity cards are being used frequently in modern web search engines to offer a concise overview of an entity directly on the results page. These cards are composed of various elements, one of them being the entity summary: a selection of facts describing the entity from an underlying knowledge base. These summaries, while presenting a synopsis of the entity, can also directly address users’ information needs. In this paper, we make the first effort towards generating and evaluating such factual summaries. We introduce and address the novel problem of dynamic entity summarization for entity cards, and break it down to two specific subtasks: fact ranking and summary generation. We perform an extensive evaluation of our method using crowdsourcing. Our results show the effectiveness of our fact ranking approach and validate that users prefer dynamic summaries over static ones.

Repository files

The repository is structured as follows:

  • data/: Queries, qrels files, and fact ranking collection
  • runs/: Run files reported in the paper (Tables 2 and 3)
  • cs-layouts/: Layouts of the crowdsourcing experiments

Data

The the fact ranking collection and its corresponding qrels files are available under data directory. This directory is organized as follows:

  • queries.txt: 100 query-entity pairs selected from the DBpedia-Entity collection. The procedure of selecting these pairs is described in the paper.
  • fact_ranking_coll.tsv: The fact ranking collection, consisting of queries, entities, entity facts (subjects and objects), and their labels with respect to importance, relevance, and utility.
  • qrels_*.txt: TREC style qrels files for fact ranking. The first three columns of each file represent: query, entity, and fact ID for the corresponding query-entity pair according to fact_ranking_coll.tsv. The files suffixed with uri_only contain only facts with URI objects (used for the results reported in Table 2 of the paper).

Crowdsourcing layouts

We performed four different types of crowdsourcing experiments in our paper; we share their layouts under the cs-layouts/ directory:

  • fact_ranking-importance.png: Used for building the fact ranking collection. Workers were presented with a single fact for an entity, and were asked to rate the importance of the fact w.r.t. the entity.
  • fact_ranking-relevance.png: Similar to the previous experiment, but workers were also provided with a query and asked to assess the relevance of the entity fact w.r.t. the query.
  • user_preference-fact_ranking.png: An user preference study for evaluating the generated summaries. Workers were presented with two summaries and were asked to select the preferred summary, or the tie option. In this experiment, we applied the same summary generation algorithm, but used different methods for ranking facts.
  • user_preference-summary_generation.png: Similar to the previous experiment, but different summary generation algorithms were compared, all of which used the same fact ranking method.

Citation

If you use the resources presented in this repository, please cite:

@inproceedings{Hasibi:2017:DFS,
 author =    {Hasibi, Faegheh and Balog, Krisztian and Bratsberg, Svein Erik},
 title =     {Dynamic Factual Summaries for Entity Cards},
 booktitle = {Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval},
 series =    {SIGIR '17},
 year =      {2017},
 pages =     {773--782},
 doi =       {10.1145/3077136.3080810},
 publisher = {ACM}
}

Contact

Should you have any questions, please contact Faegheh Hasibi at [email protected].

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].