Parallel computatonal framework and application server for determining path connectivity
US10348586B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Nov 20, 2018 |
| Grant date | Jul 9, 2019 |
| Priority date | — |
| Expiry date | Nov 20, 2038 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L67/535
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Systems and methods for social graph data analytics to determine the connectivity between nodes within a community are provided. A user may assign user connectivity values to other members of the community, or connectivity values may be automatically harvested or assigned from third parties or based on the frequency of interactions between members of the community. Connectivity values may represent such factors as alignment, reputation, status, and/or influence within a social graph of a network community, or the degree of trust. The paths connecting a first node to a second node may be retrieved, and social graph data analytics may be performed on the retrieved paths. For example, a network connectivity value may be determined from all or a subset of all of the retrieved paths. Network connectivity values and/or other social graph data may be outputted to third-party processes, services, and ratings agencies for use in initiating automatic transactions, making automated network-based or real-world decisions, determining or verifying the identity of a node within the community, scoring or ranking nodes, or making credit-granting decisions.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.