33 dépôts
Algorithms for selecting random subsets of records from a collection.
Distinct from Randomized Selection Algorithms: Distinct from Randomized Selection Algorithms: focuses on database-level record sampling rather than general probabilistic selection logic.
Explore 33 awesome GitHub repositories matching software engineering & architecture · Randomized Data Retrieval. Refine with filters or upvote what's useful.
This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to
Provides random collection sampling using swaps and reservoir sampling to select fixed-size subsets.
This project is a feature-rich Go client library designed for interacting with Redis. It serves as a comprehensive interface for managing remote data stores, enabling developers to execute standard database commands, handle complex data structures, and perform asynchronous operations within Go applications. The library distinguishes itself through its support for advanced Redis capabilities, including connection pooling, pipelining, and transactional integrity. It provides specialized primitives for managing distributed clusters, including automated topology updates and request routing to sha
Enables random sampling of stored data for discovery or testing purposes.
StatsD is a metrics aggregator and UDP collection server that collects system counters and timers. It functions as a time-series data forwarder, receiving high-frequency metric updates via a lightweight line protocol and summarizing them before flushing the data to a backend. The project features a pluggable metrics backend framework, allowing aggregated statistics to be routed to various third-party monitoring services or time-series databases such as Graphite. It supports horizontal scaling and high availability through a proxy ring distribution system that forwards incoming packets across
Reduces the volume of timing data by randomly sampling a subset of events to minimize overhead.
Redis is a high-performance in-memory key-value store that functions as a distributed cache, message broker, and NoSQL database. It provides sub-millisecond read and write access to data stored in RAM and can operate as a vector database for indexing high-dimensional embeddings. The system supports a wide range of data storage and synchronization primitives, including the management of strings, hashes, lists, sets, and JSON documents. It enables real-time data operations through atomic transactions, hybrid persistence using snapshots and append-only logs, and high-availability configurations
Selects a random subset of element IDs from a vector set to surface varied samples.
PathPlanning is a library of animated path planning algorithms that includes implementations of A-star, Dijkstra, RRT, and spline-based trajectory generation for both 2D and 3D environments. The project provides a collection of motion planning algorithms that demonstrate how robots can find collision-free paths through continuous spaces, with each algorithm rendered as a step-by-step visual animation to show how the search or tree grows over time. The library covers three main categories of path planning: sampling-based methods like RRT, RRT-star, and BIT-star that grow trees by randomly samp
Generates paths by randomly sampling configuration space with RRT, RRT-star, and BIT-star algorithms.
This project is an educational resource and a collection of instructional materials for performing data manipulation and statistical analysis using Python. It provides a comprehensive set of guides and code examples for using the Pandas, NumPy, and Matplotlib libraries to analyze structured data. The resource includes a dedicated guide for reshaping, cleaning, and aggregating tabular data and time series via Pandas, alongside a reference for high-performance vectorized operations and linear algebra using NumPy. It also features tutorials for creating publication-quality charts, distribution p
Provides methods for randomly reshuffling row order or extracting random subsets of data.
VisiData is a terminal-based interactive data analysis tool and browser designed for exploring, filtering, and sorting large tabular datasets. It functions as a structured data inspector that loads and flattens complex formats like JSON, XML, and PCAP into interactive sheets, as well as a terminal file manager for navigating directories and performing staged filesystem operations. The project distinguishes itself by rendering data visualizations, such as scatter plots and histograms, directly in the terminal using Unicode Braille characters. It provides a Python-based data wrangling environme
Selects a random population sample of a specified number of rows from the dataset.
itsy-bitsy-data-structures is a collection of fundamental computer science data structures implemented in JavaScript. It serves as an educational resource and algorithm study guide, providing simplified code implementations of classic data organization patterns to demonstrate internal logic and usage. The project provides clear and concise JavaScript implementations of stacks, queues, and linked lists. These examples are designed for learning, technical interview preparation, and studying the mechanical behavior of core data structures through code. The implementations utilize various comput
Provides constant-time element retrieval using numeric index mapping within lists.
LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro
Selects a random element from a sequence when the total number of items is not known in advance, using reservoir sampling.
Autoscraper est une bibliothèque de web scraping automatique et un extracteur de données basé sur des modèles qui apprend les règles d'extraction à partir d'échantillons de données. Il identifie et récupère du texte, des URL et des éléments HTML à partir de pages web en analysant des valeurs d'échantillon pour reproduire des modèles de données à travers différentes URL. Le système fonctionne comme un gestionnaire de modèles de web scraping, permettant aux utilisateurs d'enregistrer et de recharger les règles apprises pour maintenir une extraction de données cohérente. Il prend en charge l'exportation et l'importation des règles de scraping vers un système de fichiers local pour éviter de répéter le processus d'entraînement pour le même site web. La bibliothèque couvre l'extraction automatisée de données web et la récolte de contenu web grâce à l'apprentissage de modèles basé sur des échantillons et à la récupération d'éléments positionnels. Elle peut récupérer à la fois des points de données spécifiques et tous les éléments d'une page qui correspondent aux modèles identifiés à partir des données d'échantillon initiales.
Fetches specific data points by matching the exact index and order of elements found in training samples.
imbalanced-learn is a dataset balancing framework and Python machine learning extension designed to resample training data and reduce the impact of class imbalance. It provides a toolkit of algorithms for adjusting class distributions to improve model performance on minority class prediction. As a scikit-learn resampling library, it extends the ecosystem with specialized tools for balancing datasets through over-sampling and under-sampling techniques. This allows for the correction of skewed class proportions to reduce model bias toward the majority class. The library implements the scikit-l
Generates synthetic minority samples by interpolating between existing data points to expand the minority class boundary.
This is an interactive Python tutorial delivered as a collection of Jupyter notebooks. It is designed as a structured learning path for beginners, teaching fundamental language concepts through a sequence of lessons that combine explanatory text with runnable code cells and embedded practice exercises. Each notebook is a self-contained unit that introduces a topic, demonstrates it with a minimal code example, and then asks the learner to write code themselves, receiving immediate feedback from the browser-based execution environment. The curriculum is built on a progressive concept-stacking mo
Teaches retrieving elements by zero-based position as a fundamental list operation.
collect.js is a dependency-free JavaScript library that provides a fluent, chainable interface for manipulating arrays and objects. It mirrors the Laravel Collection API, offering a consistent set of methods for data transformation across JavaScript and Laravel backend environments. The library stores collection data as plain arrays internally and supports fluent method chaining, where each method returns a new collection instance. The library distinguishes itself by closely replicating the Laravel Collection API in JavaScript, mapping each PHP method to an equivalent JavaScript implementatio
Provides methods to pick random items from a collection or shuffle the entire order.
Chance is a JavaScript library for generating random data, designed to produce realistic test data for automated tests and prototypes. It uses a Mersenne Twister pseudo-random number generator that accepts an optional seed value, enabling reproducible sequences of random values across multiple runs. The library provides a wide range of generators for common data types, including random integers, floats, booleans, characters, strings, and dates, all with configurable ranges and character pools. It can generate realistic geographic data like addresses, as well as financial data such as credit c
Ships a method to pick random items or subsets from arrays for sampling workflows.
Swift Algorithms is a library of sequence and collection algorithms for Swift, providing operations for splitting, cycling, combining, and sampling collections with lazy evaluation. It extends Swift's standard library with algorithms that work across all types conforming to Sequence and Collection protocols, enabling efficient data processing without intermediate storage. The library specializes in combinatorial enumeration, generating all possible permutations, combinations, and product sequences from collections for testing and exploration. It also includes utilities for splitting collectio
Selects random subsets of unique elements from collections without replacement for sampling.
Carp is a statically typed Lisp compiler that compiles Lisp-like syntax directly to C source code, enabling seamless integration with existing C libraries and low-level system programming. It manages memory deterministically at compile time using ownership tracking and linear types, eliminating garbage collection pauses and runtime overhead while ensuring type safety through an inferred static type system. The language distinguishes itself through compile-time macro expansion and metaprogramming capabilities, allowing code generation and transformation before final binary output. It enforces
Retrieves the element at a specified numeric index from a list.
Orange3 is a visual data mining platform that provides an interactive canvas for building data analysis workflows without writing code. At its core, it offers a widget-based visual programming environment where users connect configurable components to perform data preprocessing, machine learning model training, statistical evaluation, and interactive visualization. The platform is built on NumPy-backed data tables with domain descriptors that define variable names, types, and roles, and includes a lazy SQL query proxy for working with database tables without loading all data into memory. The
Provides a widget to filter rows or draw random subsets from a dataset for focused analysis.
Vega-Lite is a high-level declarative language for specifying interactive, multi-view visualizations. It compiles a concise JSON specification into a full Vega visualization, automatically inferring scales, axes, and legends from encoding declarations. The grammar-of-graphics encoding maps data fields to visual channels such as position, color, size, and shape, while a multi-view composition grammar enables layered, faceted, concatenated, and repeated layouts. Reactive parameter binding links named parameters to input widgets, selections, and expressions for dynamic updates. The project suppo
Vega-Lite reduces dataset size by selecting a random subset of rows using reservoir sampling for a representative subset.
Danfo.js est une bibliothèque d'analyse et de prétraitement de données pour JavaScript qui fournit des structures de données étiquetées haute performance. Elle implémente des dataframes et des séries pour permettre une analyse de données complexe, le calcul statistique et la manipulation de données tabulaires structurées. Le projet sert de bibliothèque de prétraitement pour le machine learning, offrant des utilitaires pour l'encodage d'étiquettes catégorielles, l'encodage one-hot, ainsi que la mise à l'échelle et la standardisation des caractéristiques numériques. Elle facilite spécifiquement la conversion de structures de données étiquetées en tenseurs pour l'entraînement et l'évaluation de modèles. La bibliothèque couvre un large ensemble de capacités incluant les statistiques descriptives, les opérations relationnelles comme la fusion et la jointure, et le traitement de séries temporelles. Elle inclut des outils pour le nettoyage, le filtrage et le regroupement de données, ainsi qu'une interface de visualisation pour générer des graphiques interactifs directement à partir des dataframes. Le système prend en charge l'importation et l'exportation de données via les formats CSV, JSON et Excel.
Extracts random subsets of items from a dataset for statistical sampling or testing.
Pokemon-Terminal est un rotateur de fond d'écran en ligne de commande et un gestionnaire de thèmes d'arrière-plan de terminal. Il fonctionne comme un orchestrateur d'images basé sur le shell qui modifie les paramètres système et les fichiers de configuration pour rendre des graphiques personnalisés à travers divers émulateurs de terminal et systèmes d'exploitation. L'utilitaire permet la sélection et l'affichage automatisés d'images en tant qu'arrière-plans de terminal ou fonds d'écran système. Il propose une rotation dynamique des thèmes et la possibilité de parcourir des bibliothèques d'images en utilisant la randomisation et des filtres régionaux. Le système couvre la gestion de l'esthétique CLI via une base de données d'assets interrogeable, permettant aux utilisateurs de localiser des entrées spécifiques, d'ajouter des arrière-plans personnalisés et de mettre à jour les fonds d'écran du bureau. Il fournit un stylage de terminal multiplateforme pour assurer une application cohérente des thèmes à travers différents environnements.
Rotate through a series of images using a slideshow function with randomization or regional filters.