US 8,799,289 B2Granted

System and method for classifying, publishing, searching and locating electronic documents

AssigneeCarmel-Haifa University Economic Corp. Ltd.

InventorsYosef Ben Asher, Shlomo Berkovsky

Life of this patent

Estimating the term…

Loading patent…

Abstract

The present invention provides an electronic documents management system and method for classifying, publishing, searching and locating electronic documents. Electronic documents are classified and published via an ontological description consisting of at least one vector, each vector comprising at least one feature-value pair. Each vector's slot corresponds to a feature and the vector's range of each slot corresponds to the set of all possible values of each feature. In order to classify an electronic document, two hashing functions are applied. A first hashing function maps each feature to a slot number, corresponding to a coordinate in the appropriate vector. A second hashing function maps the value of each pair to a numeric value of a slot, corresponding to the range of each coordinate. The result of the two hashing functions is an ordered vector that can be mapped to a node in hypercube.

Claims22

Dependent claims

A computerized system for classifying, publishing, searching and locating electronic documents, said system comprising:

(i) means for classifying and publishing electronic documents via an ontological description consisting of at least one vector, each vector comprising at least one feature-value pair wherein each slot of said at least one vector corresponds to a feature of said at least one feature-value pair and a range of each of said slots corresponds to a set of all possible values of said feature;
(ii) means for storing each of said electronic documents in an electronic storage comprising:
means for using a first hashing function to map said feature of each feature-value pair to a slot number, corresponding to a coordinate in said at least one vector;
means for using a second hashing function to map said value of each feature-value pair to a numeric value of said slot corresponding to the range of said coordinate;
means for measuring distances in a hypercube between two vectors by using said second hashing function to order the feature of each vector and then using said first hashing function to order the values of each vector and then applying a threshold operation on the vectors to measure their distance;
means for creating a new ordered vector based on the results of said two hashing functions and the calculated distances;
and
means for mapping said new ordered vector to a node in a hypercube based on calculated distances;
(iii) means for storing each of said electronic documents in a hypercube-like graph structure wherein each vertex of said hypercube can be recursively constructed of another hypercube;
(iv) means for specifying search criteria for one or more electronic documents via an ontological description by enumerating at least one feature-value pair;
(i) means for locating said one or more electronic documents according to the specified search criteria;
and
(ii) means users of said system to dynamically add and search new search criteria for electronic documents, said new search criteria comprising new features not previously defined by the system.

10 more elements

A computerized method for classifying, publishing, searching and locating electronic documents, the method comprising the steps of:

(i) classifying and publishing electronic documents via an ontological description consisting of at least one vector, each vector comprising at least one feature-value pair wherein each slot of said vector corresponds to a feature of said at least one feature-value pair and a range of each of said slots corresponds to a set of all possible values of said feature;
(ii) storing each of said electronic documents in an electronic storage using the following steps:
using a first hashing function to map said feature of each at least one feature-value pair to a slot number, corresponding to a coordinate in said at least one vector;
using a second hashing function to map said value of each value-feature pair to a numeric value of said slot corresponding to the range of said coordinate;
measuring distances in a hypercube between two vectors by using said second hashing function to order the features of each vector and then using said first hashing function to order the values of each vector and then applying a threshold operation on the vectors to measure their distance;
creating a new ordered vector based on the results of said two hashing functions and the calculated distances;
mapping said new ordered vector to a node in hypercube based on the calculated distances;
(iii) storing each of said electronic documents in a hypercube-like graph structure wherein each vertex of said hypercube can be recursively constructed of another hypercube;
(iv) specifying search criteria for one or more electronic documents via an ontological description by enumerating at least one feature-value pair;
and
(v) locating said one or more documents according to the specified search criteria.

8 more elements

Dependencies are inferred from the claim text.