Apparatus and method for effective graph clustering of probabilistic graphs
US9367937B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 1, 2013 |
| Grant date | Jun 14, 2016 |
| Priority date | — |
| Expiry date | Jun 10, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T11/206
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A clustering apparatus of probabilistic graphs, includes a center selection unit configured to select one or more centers among the probabilistic graphs. The clustering apparatus further includes a center determination unit configured to calculate a minimum bound and a maximum bound of a distance with respect to each of the centers, for each of the probabilistic graphs, and determine a center, among the centers, to which the probabilistic graphs are to be allocated based on the minimum and maximum bounds. The clustering apparatus further includes a clustering unit configured to allocate the probabilistic graphs to the center to generate one or more clusters.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.