没有合适的资源?快使用搜索试试~ 我知道了~
首页书:Comprehensive-Guide-to-Graph-Algorithms-in-Neo4j-ebook-EN-US.pdf
资源详情
资源评论
资源推荐
The #1 Platform for Connected Data
neo4j.com
White Paper
A Comprehensive Guide to
Graph Algorithms in Neo4j
Mark Needham & Amy E. Hodler
neo4j.com1
Ebook
The #1 Platform for Connected Data
A Comprehensive Guide
to Graph Algorithms
in Neo4j
Mark Needham, Developer Relations Engineer at Neo4j
Amy E. Hodler, Analytics & AI Program Manager at Neo4j
Preface
Connectivity is the single most pervasive characteristic of today’s networks and systems.
From protein interactions to social networks, from communication systems to power grids,
and from retail experiences to supply chains – networks with even a modest degree of
complexity are not random, which means connections are not evenly distributed nor static.
This is why simple statistical analysis alone fails to suciently describe – let alone predict
– behaviors within connected systems. Consequently, most big data analytics today do
not adequately model the connectedness of real-world systems and have fallen short in
extracting value from huge volumes of interrelated data.
As the world becomes increasingly interconnected and systems increasingly complex,
it’s imperative that we use technologies built to leverage relationships and their dynamic
characteristics. Not surprisingly, interest in graph analytics has exploded because it was
explicitly developed to gain insights from connected data. Graph analytics reveal the
workings of intricate systems and networks at massive scales – not only for large labs but
for any organization. Graph algorithms are processes used to run calculations based on
mathematics specically created for connected information.
We are passionate about the utility and importance of graph analytics as well as the joy of
uncovering the inner workings of complex scenarios. Until recently, adopting graph analytics
required signicant expertise and determination, since tools and integrations were dicult
and few knew how to apply graph algorithms to their quandaries. It is our goal to help change
this. We wrote this ebook to help organizations better leverage graph analytics so they make
new discoveries and develop intelligent solutions faster.
While there are other graph algorithm libraries and solutions, we’ve chosen to focus on
the graph algorithms in the Neo4j platform. However, you'll nd this guide helpful for
understanding more general graph concepts regardless of what graph technology you use.
TABLE OF CONTENTS
Part I: Connected Data and
Graph Analysis 3
Making Sense of
Connected Data 4
The Rise of Graph Analytics 8
Neo4j Graph Analytics 14
Part II: Graph Algorithms
in Neo4j 17
Graph Algorithm Concepts 18
The Neo4j Graph
Algorithms Library 20
Pathnding and
Graph Search Algorithms 24
Centrality Algorithms 34
Community Detection
Algorithms 52
Graph Algorithms
in Practice 71
Conclusion 79
Appendix A:
Performance Testing 80
Appendix B: Installing the
Neo4j Graph Algorithms
Library 81
neo4j.com2 neo4j.com2
A Comprehensive Guide to Graph Algorithms in Neo4j
How to Use This Ebook
This ebook is written in two parts. For product managers and solution owners, Part I provides
an overview of graph algorithms and their uses. In these chapters, the background of
graph analytics is used to illustrate basic concepts and their relevance to the modern data
landscape.
Part II, the bulk of this ebook, is written as a practical guide to getting started with graph
algorithms for engineers and data scientists who have some Neo4j experience. It serves
as a detailed reference for using graph algorithms. At the beginning of each category of
algorithms, there is a reference table to help you quickly jump to the relevant algorithm.
For each algorithm, you’ll nd:
• An explanation of what the algorithm does
• Use cases for the algorithm and references to read more about them
• Walkthroughs with example code providing concrete ways to use the algorithm
In the reference section, you’ll nd notes, tips and code.
"Graph analysis is
possibly the single
most eective
competitive
dierentiator for
organizations
pursuing data-driven
operations and
decisions.”
– Gartner Research
Note: Details about the workings of the algorithm that you may want to know about.
!
Tip: Details you should be aware of with regard to the algorithm, such as the types of
graphs it works best with or values that are not permitted.
Code examples, node names and relationships are shown in a code font,
Courier New.
If you have any questions or need any help with any of the material in this ebook, send us an
email at devrel@neo4j.com.
Acknowledgments
We’ve thoroughly enjoyed putting together the material for this ebook and would like to
thank all those who assisted. We’d especially like to thank Michael Hunger for his guidance
and Tomaz Bratanic for his keen research. Finally, we greatly appreciate Yelp for permitting
us to use its rich dataset for powerful examples and Tomer Elmalem for brainstorming with
us on ideas.
neo4j.com3
A Comprehensive Guide to Graph Algorithms in Neo4j
Part I:
Connected Data and Graph Analysis
neo4j.com4 neo4j.com4
A Comprehensive Guide to Graph Algorithms in Neo4j
Chapter 1
Making Sense of Connected Data
Connected Data Today
There are four to ve “Vs” often used to help dene big data (volume, velocity, variety, veracity
and sometimes value) and yet there’s almost always one powerful “V” missing: valence. In
chemistry, valence is the combining power of an element; in psychology, it is the intrinsic
attractiveness of an object; and in linguistics, it’s the number of elements a word combines.
Although valence has a specic meaning in certain disciplines, in almost all cases there is an
element of connection and behavior within a larger system. In the context of big data, valence
is the tendency of individual data to connect as well as the overall connectedness of datasets.
Some researchers measure the valence of a data collection as the ratio of connections to the
total number of possible connections. The more connections within your dataset, the higher
its valence.
Your data wants to connect, to form new data aggregations and subsets, and then connect
to more data and so forth. Moreover, data doesn't arbitrarily connect for its own sake; there's
signicance behind every connection it makes. In turn, this means that the meaning behind
every connection is decipherable after the fact. Although this may sound like something
that’s mainly applicable in a biological context, most complex systems exhibit this tendency.
In fact, we can see this in our daily lives with a simple example of highly targeted purchase
recommendations based on the connections between our browsing history, shopping habits,
demographics, and even current location. Big data has valence – and it’s strong.
Scientists have observed the growth of networks and the relationships within them for some
time. Yet there is still much to understand and active work underway to further quantify and
uncover the dynamics behind this growth. What we do know is that valence increases over
time but not uniformly. Scientists have described preferential attachment (for example, the
rich get richer) as leading to power-law distributions and scale-free networks with hub and
spoke structures.
Preferential attachment means that the more connected
a node is, the more likely it is to receive new links.
Source: Wikipedia
The Latin root of
valence is the same
as value, valere, which
means to be strong,
powerful, inuential or
healthy.
剩余85页未读,继续阅读
机器人饲养员
- 粉丝: 1
- 资源: 10
上传资源 快速赚钱
- 我的内容管理 收起
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
会员权益专享
最新资源
- c++校园超市商品信息管理系统课程设计说明书(含源代码) (2).pdf
- 建筑供配电系统相关课件.pptx
- 企业管理规章制度及管理模式.doc
- vb打开摄像头.doc
- 云计算-可信计算中认证协议改进方案.pdf
- [详细完整版]单片机编程4.ppt
- c语言常用算法.pdf
- c++经典程序代码大全.pdf
- 单片机数字时钟资料.doc
- 11项目管理前沿1.0.pptx
- 基于ssm的“魅力”繁峙宣传网站的设计与实现论文.doc
- 智慧交通综合解决方案.pptx
- 建筑防潮设计-PowerPointPresentati.pptx
- SPC统计过程控制程序.pptx
- SPC统计方法基础知识.pptx
- MW全能培训汽轮机调节保安系统PPT教学课件.pptx
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功
评论0