<p>本次主要学习图数据库中常用到的一些算法,以及如何在<code>Neo4j</code>中调用,所以这一篇偏实战,每个算法的原理就简单的提一下。</p>

1. 图数据库中常用的算法

  • PathFinding & Search

    一般用来发现Nodes之间的最短路径,常用算法有如下几种

    Google Search Results

    • Dijkstra - 边不能为负值
    • Folyd - 边可以为负值,有向图、无向图
    • Bellman-Ford
    • SPFA
  • Centrality

    一般用来计算这个图中节点的中心性,用来发现比较重要的那些Nodes。这些中心性可以有很多种,比如

    • Degree Centrality - 度中心性
    • Weighted Degree Centrality - 加权度中心性
    • Betweenness Centrality - 介数中心性
    • Closeness Centrality - 紧度中心性
  • Community Detection

    基于社区发现算法和图分析Neo4j解读《权力的游戏》

    用于发现这个图中局部联系比较紧密的Nodes,类似我们学过的聚类算法。

    • Strongly Connected Components
    • Weakly Connected Components (Union Find)
    • Label Propagation
    • Lovain Modularity
    • Triangle Count and Average Clustering Coefficient

2. 路径搜索算法

  • Shortest Path

    1
    2
    3
    4
    5
    6
    7
    MATCH (start:Loc{name:"A"}), (end:Loc{name:"F"})
    CALL algo.shortestPath.stream(start, end, "cost")
    YIELD nodeId, cost

    MATCH (other:Loc)
    WHERE id(other) = nodeId
    RETURN other.name AS name, cost

  • Single Source Shortest Path

    1
    2
    3
    4
    5
    6
    MATCH (n:Loc {name:"A"})
    CALL algo.shortestPath.deltaStepping.stream(n, "cost", 3.0
    YIELD nodeId, distance

    MATCH (destination) WHERE id(destination) = nodeId
    RETURN destination.name AS destination, distance
  • All Pairs Shortest Path

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    CALL algo.allShortestPaths.stream("cost",{nodeQuery:"Loc",defaultValue:1.0})
    YIELD sourceNodeId, targetNodeId, distance
    WITH sourceNodeId, targetNodeId, distance
    WHERE algo.isFinite(distance) = true

    MATCH (source:Loc) WHERE id(source) = sourceNodeId
    MATCH (target:Loc) WHERE id(target) = targetNodeId
    WITH source, target, distance WHERE source <> target
    RETURN source.name AS source, target.name AS target, distance
    ORDER BY distance DESC
    LIMIT 10
  • Minimum Weight Spanning Tree

    1
    2
    3
    4
    5
    MATCH (n:Place {id:"D"})
    CALL algo.spanningTree.minimum("Place", "LINK", "cost", id(n),
    {write:true, writeProperty:"MINST"})
    YIELD loadMillis, computeMillis, writeMillis, effectiveNodeCount
    RETURN loadMillis, computeMillis, writeMillis, effectiveNodeCount;
  • CASE

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    MERGE (a:Loc {name:"A"})
    MERGE (b:Loc {name:"B"})
    MERGE (c:Loc {name:"C"})
    MERGE (d:Loc {name:"D"})
    MERGE (e:Loc {name:"E"})
    MERGE (f:Loc {name:"F"})
    MERGE (a)-[:ROAD {cost:50}]->(b)
    MERGE (a)-[:ROAD {cost:50}]->(c)
    MERGE (a)-[:ROAD {cost:100}]->(d)
    MERGE (b)-[:ROAD {cost:40}]->(d)
    MERGE (c)-[:ROAD {cost:40}]->(d)
    MERGE (c)-[:ROAD {cost:80}]->(e)
    MERGE (d)-[:ROAD {cost:30}]->(e)
    MERGE (d)-[:ROAD {cost:80}]->(f)
    MERGE (e)-[:ROAD {cost:40}]->(f);

3. 中心性算法

  • PageRank

    1
    2
    3
    4
    5
    6
    CALL algo.pageRank.stream("Page", "LINKS",
    {iterations:20})
    YIELD nodeId, score
    MATCH (node) WHERE id(node) = nodeId
    RETURN node.name AS page,score
    ORDER BY score DESC

  • Degree Centrality

  • Betweenness Centrality

    1
    2
    3
    4
    5
    CALL algo.betweenness.stream("User", "MANAGES", {direction:"out"})
    YIELD nodeId, centrality
    MATCH (user:User) WHERE id(user) = nodeId
    RETURN user.id AS user,centrality
    ORDER BY centrality DESC;
  • Closeness Centrality

    1
    2
    3
    4
    5
    6
    CALL algo.closeness.stream("Node", "LINK")
    YIELD nodeId, centrality
    MATCH (n:Node) WHERE id(n) = nodeId
    RETURN n.id AS node, centrality
    ORDER BY centrality DESC
    LIMIT 20;
  • CASE

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    MERGE (home:Page {name:"Home"})
    MERGE (about:Page {name:"About"})
    MERGE (product:Page {name:"Product"})
    MERGE (links:Page {name:"Links"})
    MERGE (a:Page {name:"Site A"})
    MERGE (b:Page {name:"Site B"})
    MERGE (c:Page {name:"Site C"})
    MERGE (d:Page {name:"Site D"})
    MERGE (home)-[:LINKS]->(about)
    MERGE (about)-[:LINKS]->(home)
    MERGE (product)-[:LINKS]->(home)
    MERGE (home)-[:LINKS]->(product)
    MERGE (links)-[:LINKS]->(home)
    MERGE (home)-[:LINKS]->(links)
    MERGE (links)-[:LINKS]->(a)
    MERGE (a)-[:LINKS]->(home)
    MERGE (links)-[:LINKS]->(b)
    MERGE (b)-[:LINKS]->(home)
    MERGE (links)-[:LINKS]->(c)
    MERGE (c)-[:LINKS]->(home)
    MERGE (links)-[:LINKS]->(d)
    MERGE (d)-[:LINKS]->(home)

4. 社区发现算法

  • Strongly Connected Components

    1
    2
    3
    4
    CALL algo.scc.stream("User","FOLLOWS")
    YIELD nodeId, partition
    MATCH (u:User) WHERE id(u) = nodeId
    RETURN u.id AS name, partition
  • Weakly Connected Components (Union Find)

    1
    2
    3
    4
    CALL algo.unionFind.stream("User", "FRIEND", {})
    YIELD nodeId,setId
    MATCH (u:User) WHERE id(u) = nodeId
    RETURN u.id AS user, setId
  • Label Propagation

    1
    2
    CALL algo.labelPropagation.stream("User", "FOLLOWS",
    {direction: "OUTGOING", iterations: 10})
  • Lovain Modularity

    1
    2
    3
    4
    5
    CALL algo.louvain.stream("User", "FRIEND", {})
    YIELD nodeId, community
    MATCH (user:User) WHERE id(user) = nodeId
    RETURN user.id AS user, community
    ORDER BY community;
  • Triangle Count and Average Clustering Coefficient

    1
    2
    3
    4
    5
    6
    CALL algo.triangle.stream("Person","KNOWS")
    YIELD nodeA,nodeB,nodeC
    MATCH (a:Person) WHERE id(a) = nodeA
    MATCH (b:Person) WHERE id(b) = nodeB
    MATCH (c:Person) WHERE id(c) = nodeC
    RETURN a.id AS nodeA, b.id AS nodeB, c.id AS node

5. References

  • Neo4j in deep
  • 官方文档:Comprehensive-Guide-to-Graph-Algorithms-in-Neo4j-ebook
  原文地址:https://chenson.cc/2018/08/18/%E5%9B%BE%E6%95%B0%E6%8D%AE%E5%BA%93-Neo4j-%E5%B8%B8%E7%94%A8%E7%AE%97%E6%B3%95/
</div>

图数据库-Neo4j-常用算法的更多相关文章

  1. 图数据库neo4j添加算法包

    1. 从https://github.com/neo4j-contrib/neo4j-graph-algorithms/releases下载相应版本jar包,放到 C:\Users\Administr ...

  2. Hello World 之Spring Boot 调用图数据库Neo4j

    明日歌 [清]钱鹤滩 明日复明日,明日何其多! 我生待明日,万事成蹉跎 1. 图数据库Neo4j之爱的初体验 ----与君初相识,犹似故人归 在如今大数据(big data)横行的时代,传统的关系型数 ...

  3. 图数据库Neo4j简介

    图数据库Neo4j简介 转自: 图形数据库Neo4J简介 - loveis715 - 博客园https://www.cnblogs.com/loveis715/p/5277051.html 最近我在用 ...

  4. 主流图数据库Neo4J、ArangoDB、OrientDB综合对比:架构分析

    主流图数据库Neo4J.ArangoDB.OrientDB综合对比:架构分析 YOTOY 关注 0.4 2017.06.15 15:11* 字数 3733 阅读 16430评论 2喜欢 18 1: 本 ...

  5. 图数据库Neo4j

    官网下载:https://neo4j.com/download/ 图数据库Neo4j入门:https://blog.csdn.net/gobitan/article/details/68929118 ...

  6. 开源软件:NoSql数据库 - 图数据库 Neo4j

    转载自原文地址:http://www.cnblogs.com/loveis715/p/5277051.html 最近我在用图形数据库来完成对一个初创项目的支持.在使用过程中觉得这种图形数据库实际上挺有 ...

  7. (三)图数据库neo4j的安装配置

    (一)neo4j安装 neo4j有社区版本和企业版,社区版本是免费的,企业版本是收费的.在linux上安装如下步骤: 1.将下载的neo4j-enterprise-3.4.0-unix.tar.gz包 ...

  8. 知识图谱之图数据库Neo4j

    知识图谱中的知识是通过RDF结构来进行表示的,其基本单元是事实.每个事实是一个三元组(S, P, O),在实际系统中,按照存储方式的不同,知识图谱的存储可以分为基于表结构的存储和基于图结构的存储. 基 ...

  9. 图数据库neo4j和关系数据库的区别

    相信您和我一样,在使用关系型数据库时常常会遇到一系列非常复杂的设计问题.例如一部电影中的各个演员常常有主角配角之分,还要有导演,特效等人员的参与.通常情况下这些人员常常都被抽象为Person类型,对应 ...

随机推荐

  1. 冲刺阶段——Day5

    [今日进展] 完成注册功能代码 import java.awt.*; import java.awt.event.ActionEvent; import java.awt.event.ActionLi ...

  2. Java 线程概述

    1 进程与线程基本概念 1.1 进程:执行中的程序 每个进程都有独立的代码和数据空间(进程上下文),进程空间切换会有较大的开销,一个进程包含1-n个线程.进程是资源分配的最小单位. 1.2 线程:进程 ...

  3. Infralution.Localization.Wpf

    WPF Localization Using RESX Files Once you have downloaded the source code and built it, add a refer ...

  4. Flutter移动电商实战 --(24)Provide状态管理基础

    Flutter | 状态管理特别篇 —— Provide:https://juejin.im/post/5c6d4b52f265da2dc675b407?tdsourcetag=s_pcqq_aiom ...

  5. LeetCode —— 单词接龙(Python)

    使用字典,降低查找的复杂度.使用list会超时. class Solution: def nextWordsList(self, word, wordDict): res_list = [] for ...

  6. PHP学习之工厂方法模式

    <?php //工厂方法模式 interface Doing { function eat(); function sleep(); } class Cat implements Doing { ...

  7. mac下iterm配色、半透明与样式设置

    mac下iterm配色.半透明与样式设置 * {display: table-row!important} .MJXp-surd {vertical-align: top} .MJXp-surd &g ...

  8. Docker 版本的更新和安装

    涉及到网址:1.https://docs.docker.com/engine/installation/linux/docker-ce/ubuntu/#prerequisites (官网)       ...

  9. springboot之路径拦截器

    方式一:不推荐,在代码中添加路径 1.写一个拦截器,继承HandlerInterceptor类 import org.springframework.stereotype.Component; imp ...

  10. 阶段5 3.微服务项目【学成在线】_day04 页面静态化_07-freemarker基础-if指令

    <td <#if stu.name=="小明">style="background-color:cornflowerblue"</#if ...