Systems and methods for finding star structures as communities in networks

1. A method comprising:

accessing network data stored in a storage device;

extracting information corresponding to nodes and edges within the network data;

selecting one or more candidate group of nodes;

calculating a star measure for the one or more candidate group of nodes;

determining if the star measure for the one or more candidate group of nodes does not exceed a predetermined threshold;

defining one or more star structures in response to the star measure for the one or more candidate group of nodes not exceeding the predetermined threshold;

wherein the one or more star structures comprise one or more of a local star structure and a global star structure.

2. The method according to claim 1 , wherein calculating a star measure for the one or more candidate group of nodes further comprises:

identifying a hub node;

identifying one or more neighbor nodes;

determining an average number of edges for the one or more neighbor nodes;

determining an average number of edges for the hub node; and

computing the star measure as the average number of edges for the one or more neighbor nodes divided by the number of edges for the hub node.

3. The method according to claim 1 , wherein the one or more star structures comprise a global star structure.

4. The method according to claim 3 , wherein, responsive to one or more global star structures being defined, one or more local star structures is identified.

5. The method according to claim 1 , further comprising:

responsive to determining that the star measure for the one or more candidate group of nodes exceeds the predetermined threshold, pruning the one or more candidate group of nodes and re-determining if a star measure for one or more modified candidate group of nodes does not exceed the predetermined threshold.

6. The method according to claim 5 , wherein pruning the one or more candidate group of nodes comprises removing a neighbor of a hub node having a highest degree of connectivity to other nodes from the candidate star structure.

7. The method according to claim 6 , wherein, responsive to determining a star measure for one or more modified candidate group of nodes does not exceed the predetermined threshold, defining a star structure.

8. The method according to claim 1 , wherein the network data comprises one or more of call network data, pharmaceutical network data, and social Internet web site network data.

9. The method according to claim 1 , further comprising outputting the one or more star structures to one or more display devices.

10. An apparatus comprising:

one or more processors; and

a computer readable storage medium having a program of instructions embodied therewith and executable by the one or more processors, the program of instructions comprising:

computer readable program code configured to access network data stored in a storage device;

computer readable program code configured to extract information corresponding to nodes and edges within the network data;

computer readable program code configured to select one or more candidate group of nodes;

computer readable program code configured to calculate a star measure for the one or more candidate group of nodes;

computer readable program code configured to determine if the star measure for the one or more candidate group of nodes does not exceed a predetermined threshold;

computer readable program code configured to define one or more star structures in response to the star measure for the one or more candidate group of nodes not exceeding the predetermined threshold;

wherein the one or more star structures comprise one or more of a local star structure and a global star structure.

11. The apparatus according to claim 10 , wherein the computer readable program code configured to calculate a star measure for the one or more candidate group of nodes is further configured to:

identify a hub node;

identify one or more neighbor nodes;

determine an average number of edges for the one or more neighbor nodes;

determine a number of edges for the hub node; and

compute the star measure as the average number of edges for the one or more neighbor nodes divided by the number of edges for the hub node.

12. The apparatus according to claim 10 , wherein the one or more star structures comprise a global star structure.

13. The apparatus according to claim 12 , wherein, responsive to one or more global star structures being defined, one or more local star structures is identified.

14. The apparatus according to claim 10 , wherein the computer readable program code further comprises:

computer readable program code configured to, responsive to determining that the star measure for the one or more candidate group of nodes does not exceed the predetermined threshold, prune the one or more candidate group of nodes and re-determining if a star measure for one or more modified candidate group of nodes does not exceed the predetermined threshold.

15. The apparatus according to claim 14 , wherein to prune the one or more candidate group of nodes comprises removing a neighbor of a hub node having a highest degree of connectivity to other nodes from the candidate star structure.

16. The apparatus according to claim 15 , wherein, responsive to determining a star measure for one or more modified candidate group of nodes does not exceed the predetermined threshold, defining a star structure.

17. The apparatus according to claim 10 , wherein the network data comprises one or more of call network data, pharmaceutical network data, and social Internet web site network data.

18. The apparatus according to claim 10 , further comprising:

one or more display devices;

wherein the computer readable program code further comprises computer readable program code configured to output the one or more star structures to one or more display devices.

19. A computer program product comprising:

a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising:

computer readable program code configured to access network data stored in a storage device;

computer readable program code configured to extract information corresponding to nodes and edges within the network data;

computer readable program code configured to select one or more candidate group of nodes;

computer readable program code configured to calculate a star measure for the one or more candidate group of nodes;

computer readable program code configured to determine if the star measure for the one or more candidate group of nodes does not exceed a predetermined threshold;

computer readable program code configured to define one or more star structures in response to the star measure for the one or more candidate group of nodes not exceeding the predetermined threshold;

wherein the one or more star structures comprise one or more of a local star structure and a global star structure.

20. The computer program product according to claim 19 , wherein the computer readable program code configured to calculate a star measure for the one or more candidate group of nodes is further configured to:

identify a hub node;

identify one or more neighbor nodes;

determine an average number of edges for the one or more neighbor nodes;

determine a number of edges for the hub node; and

compute the star measure as the average number of edges for the one or more neighbor nodes divided by the number of edges for the hub node.

21. A method comprising:

accessing network data stored in a storage device;

extracting information corresponding to nodes and edges within the network data;

selecting one or more candidate group of nodes;

calculating a star measure for the one or more candidate group of nodes;

determining if the star measure for the one or more candidate group of nodes does not exceed a predetermined threshold;

defining one or more star structures in response to the star measure for the one or more candidate group of nodes not exceeding the predetermined threshold;

wherein calculating a star measure for the one or more candidate group of nodes further comprises:

identifying a hub node;

identifying one or more neighbor nodes;

determining an average number of edges for the one or more neighbor nodes;

determining an average number of edges for the hub node; and

computing the star measure as the average number of edges for the one or more neighbor nodes divided by the number of edges for the hub node.

22. A computer program product comprising:

a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising:

computer readable program code configured to access network data stored in a storage device;

computer readable program code configured to extract information corresponding to nodes and edges within the network data;

computer readable program code configured to select one or more candidate group of nodes;

computer readable program code configured to calculate a star measure for the one or more candidate group of nodes;

computer readable program code configured to determine if the star measure for the one or more candidate group of nodes does not exceed a predetermined threshold;

computer readable program code configured to define one or more star structures in response to the star measure for the one or more candidate group of nodes not exceeding the predetermined threshold; and

wherein the computer readable program code configured to calculate a star measure for the one or more candidate group of nodes is further configured to:

identify a hub node;

identify one or more neighbor nodes;

determine an average number of edges for the one or more neighbor nodes;

determine a number of edges for the hub node; and

compute the star measure as the average number of edges for the one or more neighbor nodes divided by the number of edges for the hub node.