Extracting backbones from weighted complex networks with incomplete information (Q304977)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Extracting backbones from weighted complex networks with incomplete information |
scientific article; zbMATH DE number 6619900
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extracting backbones from weighted complex networks with incomplete information |
scientific article; zbMATH DE number 6619900 |
Statements
Extracting backbones from weighted complex networks with incomplete information (English)
0 references
26 August 2016
0 references
Summary: The backbone is the natural abstraction of a complex network, which can help people understand a networked system in a more simplified form. Traditional backbone extraction methods tend to include many outliers into the backbone. What is more, they often suffer from the computational inefficiency -- the exhaustive search of all nodes or edges is often prohibitively expensive. In this paper, we propose a backbone extraction heuristic with incomplete information (BEHwII) to find the backbone in a complex weighted network. First, a strict filtering rule is carefully designed to determine edges to be preserved or discarded. Second, we present a local search model to examine part of edges in an iterative way, which only relies on the local/incomplete knowledge rather than the global view of the network. Experimental results on four real-life networks demonstrate the advantage of BEHwII over the classic disparity filter method by either effectiveness or efficiency validity.
0 references