Micro-review synthesis for multi-entity summarization

DOI10.1007/s10618-017-0491-4zbMath1411.68152OpenAlexW2584908181MaRDI QIDQ1741329

Hady W. Lauw, Thanh-Son Nguyen, Panayiotis Tsaparas

Publication date: 3 May 2019

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://ink.library.smu.edu.sg/sis_research/3467

zbMATH Keywords

maximal quasi-cliquemicro-review synthesismulti-entity summarization

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (2)

Micro-review synthesis for multi-entity summarization ⋮ Dense subgraphs in random graphs

Uses Software

• TextRank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A branch-and-bound approach for maximum quasi-cliques
• An efficient algorithm for solving pseudo clique enumeration problem
• The generalized maximum coverage problem
• Micro-review synthesis for multi-entity summarization
• On the maximum quasi-clique problem
• Centroid-based summarization of multiple documents
• On Bipartite and Multipartite Clique Problems
• Introduction to Information Retrieval
• Heuristics for the fixed cost median problem
• 10.1162/jmlr.2003.3.4-5.993
• Reducibility among Combinatorial Problems
• The Enumeration of Maximal Cliques of Large Graphs

This page was built for publication: Micro-review synthesis for multi-entity summarization