Methods and apparatus for distributed community finding
US8301617B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 2, 2011 |
| Grant date | Oct 30, 2012 |
| Priority date | — |
| Expiry date | May 2, 2031 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/959
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
Abstract
Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.