Method and system for threading documents
AssigneeInternational Business Machines Corporation
InventorsNaohiko Uramoto, Koichi Takeda
Life of this patent
Estimating the term…
Abstract
In order to efficiently thread n chronologically ordered documents, a similarity among the n documents is calculated and the similarity is employed to create a similarity matrix using time constraints, and is converted into an adjacency matrix for identifying a relationship among the n documents. By applying this threading method that employs the time constraints, a large quantity of article data can be efficiently threaded in the O(n) order. Users can easily access a large quantity of data and can understand the contents.
Claims13
A method for threading n chronologically ordered documents, said method comprising the steps of:
- (1) calculating a similarity only between pairs of said n documents which satisfy a time constraint, said time constraint being that the documents of a pair are chronologically separated from each other by no more than a predetermined extent;
- (2) creating a similarity matrix from said calculated similarities;
- and
- (3) converting said similarity matrix into an adjacency matrix for identifying a relationship existing among said n documents,
- whereby a set V of said n chronologically ordered documents is represented as
- V={d1, d2, . . . , dn},
- a set A consisting of pairs of said n documents being represented as
- A={(di, dj)|diεV, djεV, i<j}, and
- said time constraint being represented as
- ∀(di, dj)εA, j−(k+1)<i<j,
- where k is a constant.
A system for threading n chronologically ordered documents, said system comprising:
- (1) means for calculating a similarity only between pairs of said n documents which satisfy a time constraint, said time constraint being that the documents of a pair are chronologically separated from each other by no more than a predetermined extent;
- (2) means for creating a similarity matrix from said calculated similarities;
- and
- (3) means for converting said similarity matrix into an adjacency matrix for identifying a relationship existing among said n documents,
- wherein a set V of said n chronologically ordered documents is represented as
- V={d1, d2, . . . , dn},
- a set A consisting of pairs of said n documents being represented as
- A={(di, dj)|diεV, djεV, i<j}, and
- said time constraint being represented as
- ∀(di, dj)εA, j−(k+1)<i<j,
- where k is a constant.
A system for threading n chronologically ordered documents and for displaying said threaded n documents, said system comprising:
- (1) means for calculating a similarity only between pairs of said n documents which satisfy a time constraint, said time constraint being that the documents of a pair are chronologically separated from each other by no more than a redetermined extent;
- (2) means for creating a similarity matrix from said calculated similarities;
- (3) means for converting said similarity matrix into an adjacency matrix for identifying a relationship existing among said n documents;
- and
- (4) means for displaying said relationship as one or more threads, one part or all of said documents represented by said threads being related based on said adjacency matrix,
- wherein a set V of said n chronologically ordered documents is represented as
- V={d1, d2, . . . , dn},
- a set A consisting of pairs of said n documents being represented as
- A={(di, dj)|diεV, djεV, i<j}, and
- said time constraint being represented as
- ∀(di, dj)εA, j−(k+1)<i<j,
- where k is a constant.
A memory medium including a program for threading n chronologically ordered documents, said program comprising:
- (1) a function for calculating a similarity only between pairs of said n documents which satisfy a time constraint, said time constraint being that the documents of a pair are chronologically separated from each other by no more than a predetermined extent;
- (2) a function for creating a similarity matrix from said calculated similarities;
- and
- (3) a function for converting said similarity matrix into an adjacency matrix for identifying a relationship existing among said n documents,
- wherein a set V of said n chronologically ordered documents is represented as
- V={d1, d2, . . . , dn}
- a set A consisting of pairs of said n documents being represented as
- A={(di, dj)|diεV, djεV, i<j}, and
- said time constraint being represented as
- ∀(di, dj)εA, j−(k+1)<i<j,
- where k is a constant.
A memory medium including a program for threading n chronologically ordered documents and for displaying said threaded documents, said program comprising:
- (1) a function for calculating a similarity only between pairs of said n documents which satisfy a time constraint, said time constraint being that the documents of a pair are chronologically separated from each other by no more than a predetermined extent;
- (2) a function for creating a similarity matrix from said calculated similarities;
- (3) a function for converting said similarity matrix into an adjacency matrix for identifying a relationship existing among said n documents;
- and
- (4) a function for displaying said relationship as one or more threads, one part or all of said documents represented by said threads being related based on said adjacency matrix,
- wherein a set V of said n chronologically ordered documents is represented as
- V={d1, d2, . . . , dn},
- a set A consisting of pairs of said n documents being represented as
- A={(di, dj)|diεV, djεV, i<j}, and
- said time constraint being represented as
- ∀(di, dj)εA, j−(k+1)<i<j,
- where k is a constant.
Dependencies are inferred from the claim text.