Representative Document Selection via Distance-Based Subsetting

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Reviewing large collections of documents is burdensome and time-consuming, as researchers often need to analyze numerous documents to understand the breadth and depth of a subject, but reading every document is inefficient.

Innovation Solution

A method that selects representative documents by determining distances from each document to the nearest representative document, using algorithms like k-means++ probabilistic seed selection and evaluating quality based on minimizing distances, to create a subset that accurately represents the entire collection without requiring review of every document.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If every document in the collection is reviewed, then the analysis accuracy and completeness is improved, but the time consumption and workload increases significantly

Engineering Contradiction:
Improveanalysis accuracyVSAvoidtime consumption
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent extracts a representative subset of documents from the full collection by selecting documents that are farthest from existing representative documents. This extraction process identifies the most informative documents that capture the diversity and breadth of the entire collection, allowing accurate analysis without reviewing every document.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent changes the selection criterion from random or sequential document selection to distance-based selection. By calculating distances between documents and representative documents, the system identifies documents with maximum informational value, transforming the selection parameter from arbitrary to metric-driven.

Inventive Principle:
Principle #35Parameter changes

2Loss of time

If a small subset of documents is selected for review, then the time consumption is reduced, but the ability to represent the full collection depth and breadth deteriorates

Engineering Contradiction:
Improvetime consumptionVSAvoidcollection representation
Core Design Contradiction:
Loss of timeVSLoss of information

Solution Approach 1:

The patent implements an iterative feedback mechanism where representative documents are selected, distances are calculated, and new representative documents are chosen based on maximum distance from existing ones. This feedback loop continues until the desired subset size is reached, ensuring each selected document maximally contributes to representing the full collection.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent performs preliminary distance calculations between all documents and existing representative documents before selecting the next representative document. This preliminary action identifies which documents would provide the most value, ensuring the subset maintains comprehensive representation of the collection's diversity.

Inventive Principle:
Principle #10Preliminary action

3Productivity

If representative documents are selected using simple random sampling, then the selection process is simple and fast, but the accuracy of representing the collection deteriorates

Engineering Contradiction:
Improveselection speedVSAvoidrepresentation accuracy
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The patent replaces the mechanical random sampling system with a computational distance-based selection system. Instead of relying on randomness, the system uses distance metrics to deterministically identify documents that maximize collection representation, substituting computational complexity for statistical probability.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

Data Source

PatentUS8635225B1Representative document selection
Publication Date: 2014.01.21 BRAINSPACE CORP
  • US8635225B1 patent drawing
  • US8635225B1 patent drawing
  • US8635225B1 patent drawing

AI summary

A method includes accessing a set of documents and a set of representative documents, determining distances from each document to a nearest representative document, and selecting a subset of documents using an algorithm for choosing initial seed values and the determined distances to the nearest representative document. The method further includes repeating the following for each particular document of the subset of documents: adding the particular document to the set of representative documents to create a new set of representative documents, removing the particular document of documents from the set of documents to create a new set of documents, and calculating a sum of distances from each document of the new set of documents to a nearest document in the new set of representative documents. The particular document of the subset that resulted in the lowest sum of distances is selected as a new representative document.