ScipySparseAnchorSearcher

class ScipySparseAnchorSearcher(max_iter: int = 5)[source]

Bases: AnchorSearcher

Find closest anchors using scipy.sparse.

Initialize the searcher.

Parameters:

max_iter (int) – the maximum number of hops to consider

Methods Summary

__call__(edge_index, anchors, k[, num_entities])

Find the \(k\) closest anchor nodes for each entity.

bfs(anchors, adjacency, max_iter, k)

Determine the candidate pool using breadth-first search.

create_adjacency(edge_index[, num_entities])

Create a sparse adjacency matrix from a given edge index.

iter_extra_repr()

Iterate over the components of the extra_repr().

select(pool, k)

Select \(k\) anchors from the given pools.

Methods Documentation

__call__(edge_index: ndarray, anchors: ndarray, k: int, num_entities: int | None = None) → ndarray[source]

Find the \(k\) closest anchor nodes for each entity.

Parameters:

  • edge_index (ndarray) – shape: (2, m) the edge index

  • anchors (ndarray) – shape: (a,) the selected anchor entity Ids

  • k (int) – the number of closest anchors to return

  • num_entities (int | None) – the number of entities

Returns:

shape: (n, k), -1 <= res < a the Ids of the closest anchors

Return type:

ndarray

static bfs(anchors: ndarray, adjacency: spmatrix, max_iter: int, k: int) → ndarray[source]

Determine the candidate pool using breadth-first search.

Parameters:

  • anchors (ndarray) – shape: (a,) the anchor node IDs

  • adjacency (spmatrix) – shape: (n, n) the adjacency matrix

  • max_iter (int) – the maximum number of hops to consider

  • k (int) – the minimum number of anchor nodes to reach

Returns:

shape: (n, a) a boolean array indicating whether anchor \(j\) is in the set of \(k\) closest anchors for node \(i\)

Return type:

ndarray

static create_adjacency(edge_index: ndarray, num_entities: int | None = None) → spmatrix[source]

Create a sparse adjacency matrix from a given edge index.

Parameters:

  • edge_index (ndarray) – shape: (2, m) the edge index

  • num_entities (int | None) – the number of entities. Can be inferred from edge_index

Returns:

shape: (n, n) a square sparse adjacency matrix

Return type:

spmatrix

iter_extra_repr() → Iterable[str][source]

Iterate over the components of the extra_repr().

This method is typically overridden. A common pattern would be

def iter_extra_repr(self) -> Iterable[str]:
    yield from super().iter_extra_repr()
    yield "<key1>=<value1>"
    yield "<key2>=<value2>"
Returns:

an iterable over individual components of the extra_repr()

Return type:

Iterable[str]

static select(pool: ndarray, k: int) → ndarray[source]

Select \(k\) anchors from the given pools.

Parameters:

  • pool (ndarray) – shape: (n, a) the anchor candidates for each node (a binary array)

  • k (int) – the number of candidates to select

Returns:

shape: (n, k) the selected anchors. May contain -1 if there is an insufficient number of candidates

Return type:

ndarray