
TL;DR
This paper introduces a versatile bipartite graph framework for comparing groups of documents, enabling analysis of similarities and differences, demonstrated through NSF funding program analysis.
Contribution
The paper proposes a novel bipartite graph model for comparing document groups, along with algorithms to extract insights, applicable to various domains.
Findings
Effective comparison of document groups using the bipartite graph model
Algorithms reveal similarities and differences among groups
Demonstrated on NSF funding programs for basic research
Abstract
We present a general framework for comparing multiple groups of documents. A bipartite graph model is proposed where document groups are represented as one node set and the comparison criteria are represented as the other node set. Using this model, we present basic algorithms to extract insights into similarities and differences among the document groups. Finally, we demonstrate the versatility of our framework through an analysis of NSF funding programs for basic research.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
