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 computing device; a computer program comprising program modules executable by the computing device, wherein the computing device is directed by the program modules of the computer program to, receive a ranked list of social connections between a social graph owner and additional entities obtained from the general Web pages, wherein the ranked list was obtained by using both a measured distance in characters between the name of the social graph owner and the name of a given entity in the content of each one of the general Web pages and a context measure of a-relationship based on a relationship keyword discovered between the name of the social graph owner and the name of the given entity in the content; on a display 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 to isolate clusters that have no connection to each other.
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 computing device; a computer program comprising program modules executable by the computing device, wherein the computing device is directed by the program modules of the computer program to, receive a ranked list of social connections between a social graph owner and additional entities obtained from the general Web pages, wherein the ranked list was obtained by using both a measured distance in characters between the name of the social graph owner and the name of a given entity in the content of each one of the general Web pages and a context measure of a-relationship based on a relationship keyword discovered between the name of the social graph owner and the name of the given entity in the content; on a display 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 to isolate clusters that have no connection to each other. 17. The computer-implemented process of claim 12 wherein the ranked list is ranked by relationship weight between two names defined by a distance measure of a relationship and a context measure of a relationship.