Skip to main content

hypergraph_entity_pagerank

Function hypergraph_entity_pagerank 

Source
pub fn hypergraph_entity_pagerank(
    conn: &Connection,
    damping: f64,
    max_iter: usize,
    tolerance: f64,
) -> Result<HashMap<i64, f64>>
Expand description

Compute entity-level hypergraph PageRank using Zhou formula.

Based on Zhou et al. (2006) - “Learning with Hypergraphs”.

PR(v) = (1-d)/n + d * sum_{e: v in e} [w(e)/delta(e) * sum_{u in e, u!=v} PR(u) * (1/d(u)) * (1/delta(e))]

Simplified: PR(v) = (1-d)/n + d * sum_{e: v in e} [w(e)/delta(e)^2 * sum_{u in e, u!=v} PR(u)/d(u)]

Complexity: O(T * sum_e k_e^2), much faster than naive O(n^2) approaches.