Welcome to This Week in Neo4j, your weekly fix for news from the world of graph databases!
This week, we bid farewell to Py2Neo, visualise DateTime Data, explore a new Algorithm for Data Clusters and have an overview of Neo4j and Graph Databases.
Remember our GenAI Stack together with Docker, LangChain and Ollama? The announcement video from DockerCon is now available to watch. In our GraphAcademy, we also have two courses on Neo4j & LLMs available: Fundamentals and How to build a Neo4j-backed Chatbot.I hope you enjoy this issue,
COMING UP NEXT WEEK!
- NODES 2023: Watch Recordings
- Conferences: Meet us at AWS re:invent in Las Vegas, USA on November 27 & FIMA in London, UK on November 28
- Connections: Generative AI and Knowledge Graphs – Unveiling the Future of Knowledge Retrieval for EMEA/AMER on December 13 & APAC on December 14
- All Neo4j Events: Webinar, Live demos, and More
- GraphSummit Series: Get Connected With Graphs
FEATURED NODES SPEAKER: Chris Zirkel
Chris Zirkel is Co-Founder of Flyweight.io, a young software startup dedicated to developing a new graph-powered Data Collaboration Platform to change how companies work with their data.
Connect with him on LinkedIn.
In his session at NODES “Streamline Your Development With GitHub Actions: Build, Test, and Deploy Custom Code” Chris shows you how to create a GitHub Actions workflow that runs on every commit and pushes to your GitHub repository, enabling you to automate the build, testing, and deployment of your latest changes
TIME SERIES DATA: Astronomical insights with Neo4j and KronoGraphCorey Lanum provides a hands-on approach to working with DateTime data with Neo4j. To demonstrate, he uses the astronaut database from Supercluster. It lists every human who has ever been to space, starting with Yuri Gagarin in 1961 and ending with the astronauts in space right now.
DATA CLUSTERS: Clustering Graph Data With K-MedoidsNathan Smith explains how to work with the K-medoids algorithm to discover data clusters. It assigns nodes to a cluster based on the shortest path to a medoid. The algorithm optimises the selection of medoids to create the shortest total distance from nodes in the graph to their nearest medoid.
TWEET OF THE WEEK: 5.15 Technologies
Discover the power of #Neo4j #graphs in #JupyterNotebooks! Explore intricate connections, uncover hidden patterns, and gain new insights, letting your #data tell its story visually. #DataVisualization #GraphData #GraphQL #ML #NLP #Python https://t.co/L0Ucftqnaf pic.twitter.com/ohuZVXOWIA— 5.15 Technologies (@515Technologies) November 9, 2023
Don’t forget to share it if you like it!