|
|
|
|
| LEADER |
03838nmm a2200493 u 4500 |
| 001 |
EB002200371 |
| 003 |
EBX01000000000000001337574 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
240402 ||| eng |
| 020 |
|
|
|a 9781638350545
|
| 020 |
|
|
|a 9781617299469
|
| 020 |
|
|
|a 1617299464
|
| 050 |
|
4 |
|a Q325.5
|
| 100 |
1 |
|
|a Bratanič, Tomaž
|
| 245 |
0 |
0 |
|a Graph Algorithms for Data Science
|b with examples in Neo4j
|c Tomaž Bratanič ; foreword by Michael Hunger
|
| 260 |
|
|
|a Shelter Island
|b Manning Publication Co.
|c 2024
|
| 300 |
|
|
|a xx, 330 pages
|b illustrations
|
| 653 |
|
|
|a Data mining / fast
|
| 653 |
|
|
|a Machine learning / http://id.loc.gov/authorities/subjects/sh85079324
|
| 653 |
|
|
|a Langages de script (Informatique)
|
| 653 |
|
|
|a SQL (Langage de programmation)
|
| 653 |
|
|
|a Machine learning / fast
|
| 653 |
|
|
|a Apprentissage automatique
|
| 653 |
|
|
|a Scripting languages (Computer science) / fast
|
| 653 |
|
|
|a Data mining / http://id.loc.gov/authorities/subjects/sh97002073
|
| 653 |
|
|
|a Scripting languages (Computer science) / http://id.loc.gov/authorities/subjects/sh2006007256
|
| 653 |
|
|
|a Exploration de données (Informatique)
|
| 653 |
|
|
|a SQL (Computer program language) / fast
|
| 653 |
|
|
|a SQL (Computer program language) / http://id.loc.gov/authorities/subjects/sh86006628
|
| 700 |
1 |
|
|a Hunger, Michael
|e writer of foreword
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 500 |
|
|
|a Includes index
|
| 776 |
|
|
|z 9781638350545
|
| 776 |
|
|
|z 9781617299469
|
| 776 |
|
|
|z 163835054X
|
| 776 |
|
|
|z 1617299464
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781617299469/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 500
|
| 082 |
0 |
|
|a 006.3/1
|
| 520 |
|
|
|a Each new algorithm you learn is instantly put into action to complete a hands-on data project, including modeling a social network! Finally, you'll learn how to utilize graphs to upgrade your machine learning, including utilizing node embedding models and graph neural networks."--
|
| 520 |
|
|
|a "Labeled-property graph modeling Constructing a graph from structured data such as CSV or SQL NLP techniques to construct a graph from unstructured data Cypher query language syntax to manipulate data and extract insights Social network analysis algorithms like PageRank and community detection How to translate graph structure to a ML model input with node embedding models Using graph features in node classification and link prediction workflows Graph Algorithms for Data Science is a hands-on guide to working with graph-based data in applications like machine learning, fraud detection, and business data analysis. It's filled with fascinating and fun projects, demonstrating the ins-and-outs of graphs. You'll gain practical skills by analyzing Twitter, building graphs with NLP techniques, and much more. You don't need any graph experience to start benefiting from this insightful guide.
|
| 520 |
|
|
|a These powerful graph algorithms are explained in clear, jargon-free text and illustrations that makes them easy to apply to your own projects. about the technology Graphs reveal the relationships in your data. Tracking these interlinking connections reveals new insights and influences and lets you analyze each data point as part of a larger whole. This interconnected data is perfect for machine learning, as well as analyzing social networks, communities, and even product recommendations. about the book Graph Algorithms for Data Science teaches you how to construct graphs from both structured and unstructured data. You'll learn how the flexible Cypher query language can be used to easily manipulate graph structures, and extract amazing insights. The book explores common and useful graph algorithms like PageRank and community detection/clustering algorithms.
|