Privacy-Preserving Multi-Document Summarization

August 06, 2015 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors LuΓ­s Marujo, JosΓ© PortΓͺlo, Wang Ling, David Martins de Matos, JoΓ£o P. Neto, Anatole Gershman, Jaime Carbonell, Isabel Trancoso, Bhiksha Raj arXiv ID 1508.01420 Category cs.IR: Information Retrieval Cross-listed cs.CL, cs.CR Citations 8 Venue arXiv.org Last Checked 4 months ago
Abstract
State-of-the-art extractive multi-document summarization systems are usually designed without any concern about privacy issues, meaning that all documents are open to third parties. In this paper we propose a privacy-preserving approach to multi-document summarization. Our approach enables other parties to obtain summaries without learning anything else about the original documents' content. We use a hashing scheme known as Secure Binary Embeddings to convert documents representation containing key phrases and bag-of-words into bit strings, allowing the computation of approximate distances, instead of exact ones. Our experiments indicate that our system yields similar results to its non-private counterpart on standard multi-document evaluation datasets.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted