Cargando…
Developing with graph algorithms.
Graphs are powerful data structures that we can use to model real-world relationships of all kinds. Through the paradigm of vertices (or nodes) that represent data, and edges (the connections between vertices), graphs can represent highly complex interconnections in nearly any environment, and you c...
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | |
| Formato: | Electrónico Video |
| Idioma: | Inglés |
| Publicado: |
[Place of publication not identified] :
O'Reilly Media, Inc.,
[2019]
|
| Edición: | [First edition]. |
| Temas: | |
| Acceso en línea: | Texto completo (Requiere registro previo con correo institucional) |
MARC
| LEADER | 00000cgm a22000007i 4500 | ||
|---|---|---|---|
| 001 | OR_on1351436411 | ||
| 003 | OCoLC | ||
| 005 | 20231017213018.0 | ||
| 006 | m o c | ||
| 007 | vz czazuu | ||
| 007 | cr cnannnuuuuu | ||
| 008 | 221121s2019 xx 176 o vleng d | ||
| 040 | |a ORMDA |b eng |e rda |e pn |c ORMDA |d UMI |d OCLCF |d OCLCO | ||
| 019 | |a 1107052585 |a 1362792509 | ||
| 020 | |a 9781492043379 |q (electronic video) | ||
| 020 | |a 1492043370 |q (electronic video) | ||
| 029 | 1 | |a AU@ |b 000072954069 | |
| 035 | |a (OCoLC)1351436411 |z (OCoLC)1107052585 |z (OCoLC)1362792509 | ||
| 037 | |a 9781492043379 |b O'Reilly Media | ||
| 050 | 4 | |a QA166.245 | |
| 082 | 0 | 4 | |a 511/.5 |2 23/eng/20221121 |
| 049 | |a UAMI | ||
| 245 | 0 | 0 | |a Developing with graph algorithms. |
| 250 | |a [First edition]. | ||
| 264 | 1 | |a [Place of publication not identified] : |b O'Reilly Media, Inc., |c [2019] | |
| 300 | |a 1 online resource (1 video file (2 hr., 56 min.)) : |b sound, color. | ||
| 306 | |a 025600 | ||
| 336 | |a two-dimensional moving image |b tdi |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 344 | |a digital |2 rdatr | ||
| 347 | |a video file |2 rdaft | ||
| 380 | |a Instructional films |2 lcgft | ||
| 520 | |a Graphs are powerful data structures that we can use to model real-world relationships of all kinds. Through the paradigm of vertices (or nodes) that represent data, and edges (the connections between vertices), graphs can represent highly complex interconnections in nearly any environment, and you can see them in practical use in everything from social media apps (e.g., Facebook and LinkedIn) to the GPS apps in your phone and car. For each specific use, we can use algorithms that determine and direct how we use a graph, including, for example, algorithms that help networking systems determine the shortest path by which to send packet data to a destination, or those that make suggestions for new friends in your favorite social media app. In this video course, designed for beginner- to intermediate-level developers and data scientists, host Mark Needham introduces graph algorithms and demonstrates how you can incorporate them into your software development and data science workflow. Your exploration begins by learning about three different categories of algorithms, including within them the world-famous PageRank algorithm, and going through some use cases that are particularly well suited for graph algorithms. You'll see how to install Neo4j and the graph algorithms library as well as how you can use graph algorithms with Python in a Jupyter notebook. Later, Mark takes you through worked examples using each of the algorithms on real-world datasets. You'll even get to apply your knowledge of graph algorithms by working through an end-to-end example on a Game of Thrones dataset, also involving graph visualization. What you'll learn--and how you can apply it The fundamentals of graphs and basic terminology Understand what graph algorithms are and learn about the kinds of problems you can solve by using them Three widely used categories of algorithms and many specific algorithms within them: pathfinding and graph search algorithms; centrality algorithms; and community detection algorithms How to execute graph algorithms against a sample dataset using Neo4j, NetworkX, and igraph How graph algorithms can be used with Python in a Jupyter notebook This video course is for you because... You're a software developer or data scientist who needs to make sense of connected data You're tasked with developing an application that coordinates and controls many disparate interconnected data components You want to learn how you can integrate graph algorithms into a Python development environment Prerequisites: You should have a beginner- to intermediate-level knowledge of software development practices You should have a familiarity with Python You should be comfortable using version control/Git Materials or downloads needed in advance: None. | ||
| 588 | |a Online resource; title from title details screen (O'Reilly, viewed November 21, 2022). | ||
| 511 | 0 | |a Presenter, Mark Needham. | |
| 590 | |a O'Reilly |b O'Reilly Online Learning: Academic/Public Library Edition | ||
| 650 | 0 | |a Graph algorithms. | |
| 650 | 0 | |a Software architecture. | |
| 650 | 0 | |a Computer software |x Development. | |
| 650 | 0 | |a Information visualization. | |
| 650 | 0 | |a Python (Computer program language) | |
| 650 | 6 | |a Algorithmes de graphes. | |
| 650 | 6 | |a Visualisation de l'information. | |
| 650 | 6 | |a Python (Langage de programmation) | |
| 650 | 6 | |a Architecture logicielle. | |
| 650 | 7 | |a Graph algorithms |2 fast | |
| 650 | 7 | |a Information visualization |2 fast | |
| 650 | 7 | |a Python (Computer program language) |2 fast | |
| 655 | 7 | |a Instructional films. |2 lcgft | |
| 655 | 7 | |a Nonfiction films. |2 lcgft | |
| 655 | 7 | |a Internet videos. |2 lcgft | |
| 655 | 7 | |a Films de formation. |2 rvmgf | |
| 655 | 7 | |a Films autres que de fiction. |2 rvmgf | |
| 655 | 7 | |a Vidéos sur Internet. |2 rvmgf | |
| 700 | 1 | |a Mark Needham, presenter. | |
| 700 | 1 | |a Needham, Mark |c (Co-author of Graph algorithms), |e presenter. | |
| 710 | 2 | |a O'Reilly (Firm), |e publisher. | |
| 856 | 4 | 0 | |u https://learning.oreilly.com/videos/~/9781492043379/?ar |z Texto completo (Requiere registro previo con correo institucional) |
| 994 | |a 92 |b IZTAP | ||