System and method for discovering groups whose members have a given attribute
a given attribute and group technology, applied in the field of discovering groups, can solve the problems of difficult to discover groups of the graph is not helpful by itself, and the difficulty of finding people in the graph with a common attribute, so as to increase the social dynamics and the minimum of input information
Inactive Publication Date: 2017-11-23
DIEPENBROCK V ANTHONY BERNARD +1
View PDF5 Cites 5 Cited by
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Benefits of technology
[0004]An embodiment solves the problem of finding groups of people in a friend network having a common characteristic. The embodiment performs this task extremely quickly and with a minimum of input information. One benefit of the present invention is that a group of persons for which a common attribute exists is now presentable for a variety of purposes. For example, if a merchant desires to sell goods or services to the group, then the discovery of the group is exceedingly valuable to the merchant. As another example, the discovered group can be used to increase social dynamics in a game or other application.
Problems solved by technology
Thus, the graph is not, by itself, helpful in discovering groups of persons possessing a common attribute.
For example, if one desires to know a group of persons in the graph who are members of an organization, there is no simple way to find this group directly from the graph.
Thus, a problem with the friend graph exists in that it provides connectivity based on only one property, friendship, making it difficult to discover groups of people in the graph with a common attribute.
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View moreImage
Smart Image Click on the blue labels to locate them in the text.
Smart ImageViewing Examples
Examples
Experimental program
Comparison scheme
Effect test
Embodiment Construction
[0015]FIG. 1 depicts a sample friend network. The network is an undirected graph having vertices representing people and edges representing a bidirectional friend relationship. A graph of this type can have many connections among vertices, 201-217, 251-265, multiple groupings 102, 104, 106, 108, 110, 112, and even disconnected groups 106, 108, 110, 112. The popular site, Facebook, provides access, via an API, to a friend or social graph that includes hundreds of millions of people. In one embodiment, the Facebook social graph is accessed to construct an adjacency matrix for a graph on which further processing occurs.
[0016]FIG. 2 depicts input information from which a group or organization may be discovered. In one embodiment, the input information is obtained from a person, hereinafter “the starting person,” who visits a website that is generally related to a group or organization in which the visiting person is a member. To register at the website the person offers his Facebook id ...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More PUM
Login to View More Abstract
A method for discovering a group defined by a common characteristic is disclosed. The method includes building representation of a portion of a social network based on a starting person with the given characteristic, the person also providing the person's gender and school affiliation. The social network representation is then searched to discover clusters therein meeting certain size and connectivity requirements with respect to the network. After the clusters in the network are discovered, clusters having a high degree of similarity are merged together. The resulting clusters, both merged and non-merged, are then scored to determine the cluster that best fits the original group. The winning cluster is then returned to the starting person who confirms the correctness of the cluster. The set of the persons in a confirmed cluster are then displayed to the starting person.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS[0001]This continuation application incorporates by reference in its entirety and claims the benefit of application, U.S. Ser. No. 13 / 624,971, filed on Sep. 24, 2012 and titled “SYSTEM AND METHOD FOR DISCOVERING GROUPS WHOSE MEMBERS HAVE A GIVEN ATTRIBUTE”.FIELD OF THE INVENTION[0002]The present invention relates generally to discovering a group defined by a common attribute in a friend network.DESCRIPTION OF THE RELATED ART[0003]A friend network can be viewed as a graph whose vertices are persons and whose edges indicate a friend relationship, F(v1, v2). This graph can be exceedingly large and highly interconnected. The graph also contains auxiliary information about the friends in the graph, but this information is disjointed and unconnected in the graph. Thus, the graph is not, by itself, helpful in discovering groups of persons possessing a common attribute. For example, if one desires to know a group of persons in the graph who are members...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More Application Information
Patent Timeline
Login to View More Patent Type & AuthorityApplications(United States)
IPC IPC(8): G06F17/30
CPCG06F17/30705G06F17/30713G06F16/35G06F16/358
InventorDIEPENBROCK, V, ANTHONY BERNARDMOYES, III, CHARLES W.
OwnerDIEPENBROCK V ANTHONY BERNARD