A Framework for Comparing Groups of Documents

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 21, 2015
Accession Number
ADA623800

Entities

People

  • Arun S. Maiya

Organizations

  • Institute for Defense Analyses

Tags

Communities of Interest

  • Biomedical

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computational Science
  • Data Mining
  • Department Of Defense
  • Engineering
  • Heuristic Methods
  • Language
  • Linguistics
  • Link Analysis
  • Mathematics
  • Network Science
  • New York
  • Probability
  • Standards
  • Systems Engineering
  • Text Mining

Fields of Study

  • Computer science

Readers

  • Business Analytics
  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.