AUTOMATED SOCIAL NETWORKING GRAPH MINING AND VISUALIZATION
First Claim
1. A computer-implemented process for identifying social connections among entities, comprising:
- using a computing device for;
receiving a set of Web pages that identify social connections between entities;
parsing the content of each of the Web pages into information blocks;
identifying names of the entities in the information blocks;
ranking the social connections among the entities'"'"' names in the information blocks considering position and surrounding text of the names in the information blocks; and
integrating the ranked social connections from all the information blocks to determine strengths of the connections between the entities associated with the entities'"'"' names.
2 Assignments
0 Petitions
Accused Products
Abstract
The automated social networking graph mining and visualization technique described herein mines social connections and allows creation of a social networking graph from general (not necessarily social-application specific) Web pages. The technique uses the distances between a person'"'"'s/entity'"'"'s name and related people'"'"'s/entities names on one or more Web pages to determine connections between people/entities and the strengths of the connections. In one embodiment, the technique lays out these connections, and then clusters them, in a 2-D layout of a social networking graph that represents the Web connection strengths among the related people'"'"'s or entities'"'"' names, by using a force-directed model.
179 Citations
20 Claims
-
1. A computer-implemented process for identifying social connections among entities, comprising:
using a computing device for; receiving a set of Web pages that identify social connections between entities; parsing the content of each of the Web pages into information blocks; identifying names of the entities in the information blocks; ranking the social connections among the entities'"'"' names in the information blocks considering position and surrounding text of the names in the information blocks; and integrating the ranked social connections from all the information blocks to determine strengths of the connections between the entities associated with the entities'"'"' names. - View Dependent Claims (2, 3, 4)
-
5. A computer-implemented process for graphing social connections among entities'"'"' names extracted from general Web pages by creating a 2-D graph with a set of vertices representing names, and a set of edges representing social connections, comprising:
using a computing device to perform; inputting a ranked list of social connections between a social graph owner and additional entities; placing the social graph owner in the center of the 2D graph as a center vertex; for each of the additional entities, placing a vertex representing a name of an entity in the ranked list in a difference orbit around the center vertex where the shorter the orbit'"'"'s radius is, the stronger a social connection between the vertex in the orbit and the center vertex is; clustering the vertices into different clusters according to connectivity between the vertices; placing the vertices in the same cluster closer to each other than to vertices in other clusters; placing clusters of vertices so that clusters of vertices do not overlap each other; and using a force-directed model to improve the uniformity of the 2D layout. - View Dependent Claims (6, 7, 8, 9, 10, 11)
-
12. A system for displaying the social connections among entities'"'"' names extracted from general web pages in the form of creating a 2-D graph with a set of vertices representing names, and a set of edges representing social connections, comprising:
-
a general purpose computing device; a computer program comprising program modules executable by the general purpose computing device, wherein the computing device is directed by the program modules of the computer program to, input a ranked list of social connections between a social graph owner and additional entities; place the social graph owner in the center of the 2D graph as a center vertex; for each entity in the ranked list, place a vertex representing a name of an entity in the ranked list in a difference orbit around the center vertex where the shorter the orbit'"'"'s radius is, the stronger the social connection between the vertex in the orbit and the center vertex is; cluster the vertices into different clusters according to the connectivity between the vertices; use a force-directed model to optimize the uniformity of the 2D layout, wherein the force-directed model comprises; a repulsive force between each two vertices; an attractive force among the edges; a repulsive force between adjacent orbits; and an unpenetratable boundary boundary to isolate clusters that have no connection to each other. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20)
-
Specification