Method and system of classifying, ranking and relating information based on weights of network links
First Claim
Patent Images
1. A computer-implemented method, comprising:
- identifying a first data set and a second data set,establishing a plurality of relationships, each of the plurality of relationships linking an element of the first data set to an element of the second data set,identifying a set of categories for categorizing elements of the first and second data sets,initializing a plurality of first ranking vector, each of the first ranking vectors corresponding to an element of the first data set, each component of the each first ranking vector a representing a degree to which the element is related to one of the categories,initializing a plurality of second ranking vector, each of the second ranking vectors corresponding to an element of the second data set, each component of the each second ranking vector u representing a degree to which the element is related to one of the categories,assigning a link weight to each of the plurality of relationships of interconnected elements of the first and second data sets, said link weight being modifiable by interaction between the elements linked by the each relationship,computing a similarity quotient for the each relationship of the plurality of relationships from a formula;
1 Assignment
0 Petitions
Accused Products
Abstract
What is disclosed is an automatic method of classification, qualification and relation of information that is based on a network built starting from the semantic, numeric, conceptual, etc. relationships between elements of different sets that are structurally alike. Through the topological properties of the network, we generate a vector of relations for each element that allows us to analyze the similarity among them, improve and facilitate the clustering processes, carry out personalized dynamic ranking, analyze conduct patterns as well as maintain the auto evolving dynamic of the network through the interaction and feedback of its elements, among other characteristics.
-
Citations
15 Claims
-
1. A computer-implemented method, comprising:
-
identifying a first data set and a second data set, establishing a plurality of relationships, each of the plurality of relationships linking an element of the first data set to an element of the second data set, identifying a set of categories for categorizing elements of the first and second data sets, initializing a plurality of first ranking vector, each of the first ranking vectors corresponding to an element of the first data set, each component of the each first ranking vector a representing a degree to which the element is related to one of the categories, initializing a plurality of second ranking vector, each of the second ranking vectors corresponding to an element of the second data set, each component of the each second ranking vector u representing a degree to which the element is related to one of the categories, assigning a link weight to each of the plurality of relationships of interconnected elements of the first and second data sets, said link weight being modifiable by interaction between the elements linked by the each relationship, computing a similarity quotient for the each relationship of the plurality of relationships from a formula; - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer-implemented method, comprising:
-
identifying a first data set and a second data set, establishing a plurality of relationships, each of the plurality of relationships linking an element of the first data set to an element of the second data set, identifying a set of categories for categorizing elements of the first and second data sets, initializing a plurality of first ranking vectors A, each of the first ranking vectors corresponding to an element of the first data set, each component of the each first ranking vector representing a degree to which the element is related to one of the categories, initializing a plurality of second ranking vectors U, each of the second ranking vectors corresponding to an element of the second data set, each component of the each second ranking vector representing a degree to which the element is related to one of the categories, assigning a link weight to each of the plurality of relationships of interconnected elements of the first and second data sets, said link weight being modifiable by interaction between the elements linked by the each relationship, wherein the ranking vectors are ranking vectors a and u, and each component aj of the at least one ranking vector a is incremented in an interaction by an amount proportional to a difference between components aj and uj of the ranking vectors a and u, the amount being computed from κ
*(uj−
aj), κ
being an interaction coefficient;computing a similarity quotient for the each relationship of the plurality of relationships, the similarity quotient being a measure of similarity between the elements linked by the each relationship and determined from the ranking vectors a and u, and classifying the plurality of relationships based on values of the similarity quotients. - View Dependent Claims (10, 11, 12, 13, 14, 15)
-
Specification