You're reading from Unlocking Data with Generative AI and RAG Enhance generative AI systems by integrating internal data with large language models using RAG

Product type Paperback

Published in Sep 2024

Publisher Packt

ISBN-13 9781835887905

Length 346 pages

Edition 1st Edition

Concepts

GPT/LLMs

Author (1):

Keith Bourne

View More author details

Table of Contents (20) Chapters

Preface

1. Part 1 – Introduction to Retrieval-Augmented Generation (RAG) FREE CHAPTER

2. Chapter 1: What Is Retrieval-Augmented Generation (RAG)

3. Chapter 2: Code Lab – An Entire RAG Pipeline

4. Chapter 3: Practical Applications of RAG

5. Chapter 4: Components of a RAG System

6. Chapter 5: Managing Security in RAG Applications

7. Part 2 – Components of RAG

8. Chapter 6: Interfacing with RAG and Gradio

9. Chapter 7: The Key Role Vectors and Vector Stores Play in RAG

10. Chapter 8: Similarity Searching with Vectors

11. Chapter 9: Evaluating RAG Quantitatively and with Visualizations

12. Chapter 10: Key RAG Components in LangChain

13. Chapter 11: Using LangChain to Get More from RAG

14. Part 3 – Implementing Advanced RAG

15. Chapter 12: Combining RAG with the Power of AI Agents and LangGraph

16. Chapter 13: Using Prompt Engineering to Improve RAG Efforts

17. Chapter 14: Advanced RAG-Related Techniques for Improving Results

18. Index

Why subscribe?

19. Other Books You May Enjoy

Enhancing search with indexing techniques

ANN and k-NN search are fundamental solutions in computer science and machine learning, with applications in various domains such as image retrieval, recommendation systems, and similarity search. While search algorithms play a crucial role in ANN and k-NN, indexing techniques and data structures are equally important for enhancing the efficiency and performance of these algorithms.

These indexing techniques are used to optimize the search process by reducing the number of vectors that need to be compared during the search. They help in quickly identifying a smaller subset of candidate vectors that are likely to be similar to the query vector. The search algorithms (such as k-NN, ANN, or other similarity search algorithms) can then operate on this reduced set of candidate vectors to find the actual nearest neighbors or similar vectors.

All these techniques aim to improve the efficiency and scalability of similarity search by reducing...