使用Neo4j计算节点中心性——紧密度中心性(Closeness Centrality)、介数中心性(betweenness Centrality),适用于v3.5 以上的Graph Algorithms plugin。

一、计算紧密度中心性

CALL algo.closeness.stream('v','same-sentence',{direction:'out'})

YIELD nodeId, centrality

MATCH (word:v) WHERE id(word) = nodeId

RETURN word.name AS word,centrality

ORDER BY centrality DESC;

参考:https://neo4j.com/docs/graph-algorithms/current/labs-algorithms/closeness-centrality/

 

二、计算介数中心性

CALL algo.betweenness.stream('n','same-sentence',{direction:'out'})

YIELD nodeId, centrality

MATCH (word:n) WHERE id(word) = nodeId

RETURN word.name AS word,centrality

ORDER BY centrality DESC;

参考:https://neo4j.com/docs/graph-algorithms/current/labs-algorithms/betweenness-centrality/

Logo

GitCode 天启AI是一款由 GitCode 团队打造的智能助手,基于先进的LLM(大语言模型)与多智能体 Agent 技术构建,致力于为用户提供高效、智能、多模态的创作与开发支持。它不仅支持自然语言对话,还具备处理文件、生成 PPT、撰写分析报告、开发 Web 应用等多项能力,真正做到“一句话,让 Al帮你完成复杂任务”。

更多推荐