awesome-repositories.com
Blog
awesome-repositories.com

Découvrez les meilleurs dépôts open-source grâce à notre recherche par IA.

ExplorerRecherches sélectionnéesAlternatives open sourceLogiciels auto-hébergésBlogPlan du site
ProjetÀ proposNotre méthodologiePresseServeur MCP
Mentions légalesConfidentialitéConditions d'utilisation
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

8 dépôts

Awesome GitHub RepositoriesCategorical Data Optimization

Memory-efficient representations for categorical data in tabular formats.

Distinguishing note: Focuses on dynamic inference of categories for performance.

Explore 8 awesome GitHub repositories matching data & databases · Categorical Data Optimization. Refine with filters or upvote what's useful.

Awesome Categorical Data Optimization GitHub Repositories

Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
  • pola-rs/polarsAvatar de pola-rs

    pola-rs/polars

    38,855Voir sur GitHub↗

    Polars is a high-performance columnar data processing library designed for efficient analytical workflows. It functions as a structured data library that organizes information into typed columns, utilizing the Apache Arrow memory format to enable zero-copy data sharing and cache-friendly, vectorized operations. The engine is built to handle large-scale tabular datasets, providing both local and distributed analytical runtimes that scale from single-machine environments to multi-node clusters. The project distinguishes itself through a sophisticated lazy query engine that constructs abstract e

    Creates categorical columns that infer categories from data to reduce memory usage and increase speed.

    Rustarrowdataframedataframe-library
    Voir sur GitHub↗38,855
  • dmlc/xgboostAvatar de dmlc

    dmlc/xgboost

    28,471Voir sur GitHub↗

    XGBoost is a distributed machine learning library for implementing scalable gradient boosting decision trees used for regression, classification, and ranking. It functions as a predictive model framework and a cross-language toolkit, providing a core implementation with native bindings for Python, R, Java, Scala, and C++. The system is designed as a GPU-accelerated library that utilizes CUDA and NCCL to speed up the training of decision tree ensembles. It operates as a distributed framework capable of scaling training and prediction across multi-node clusters and GPU environments to process m

    Processes categorical features natively via partition-based splitting to improve efficiency and accuracy.

    C++distributed-systemsgbdtgbm
    Voir sur GitHub↗28,471
  • lightgbm-org/lightgbmAvatar de lightgbm-org

    lightgbm-org/LightGBM

    18,460Voir sur GitHub↗

    LightGBM is a gradient boosting framework used to train decision tree ensembles for classification, regression, and ranking tasks. It functions as a distributed machine learning library and a decision tree ensemble implementation that utilizes leaf-wise growth and histogram-based feature binning. The framework is distinguished by its ability to offload heavy computations to CUDA or OpenCL devices for GPU acceleration and its capacity to parallelize training across multiple nodes using sockets, MPI, or Dask. It includes a specialized categorical feature processor that optimizes partitions for

    Optimizes partitions for categorical variables using native splitting instead of one-hot encoding.

    C++
    Voir sur GitHub↗18,460
  • nlp-love/ml-nlpAvatar de NLP-LOVE

    NLP-LOVE/ML-NLP

    17,725Voir sur GitHub↗

    This project is a machine learning algorithm reference and implementation guide that provides theoretical foundations and code for supervised learning, deep learning, and natural language processing. It serves as a comprehensive toolkit for implementing predictive models and a technical reference for algorithm engineering. The project focuses on ensemble learning frameworks, including the construction of decision trees, random forests, and gradient boosting models. It also functions as a probabilistic graphical model library and an NLP algorithm reference, with specific implementations for se

    Implements native categorical splitting in decision trees to avoid one-hot encoding.

    Jupyter Notebookdeep-learningmachine-learningnlp
    Voir sur GitHub↗17,725
  • dask/daskAvatar de dask

    dask/dask

    13,746Voir sur GitHub↗

    Dask est un framework de calcul parallèle et un planificateur de tâches distribué conçu pour mettre à l'échelle les flux de travail de science des données Python, des machines uniques aux grands clusters. Il fonctionne comme un gestionnaire de ressources de cluster qui orchestre la logique computationnelle en représentant les tâches et leurs dépendances sous forme de graphes acycliques dirigés. Cette architecture permet au système d'automatiser la distribution des charges de travail sur le matériel disponible tout en gérant des exigences d'exécution complexes. Le projet se distingue par un moteur d'évaluation paresseuse qui diffère les opérations sur les données jusqu'à ce qu'elles soient explicitement demandées, permettant une optimisation globale du graphe et une allocation efficace des ressources. Il intègre le déversement de données conscient de la mémoire pour éviter les plantages du système lors du traitement de jeux de données dépassant la mémoire disponible, et il utilise la fusion de graphes de tâches pour combiner des séquences d'opérations en étapes d'exécution uniques, minimisant la surcharge de planification et la communication entre nœuds. La plateforme fournit une surface de capacités complète pour l'analyse de données à grande échelle, incluant le support pour l'apprentissage automatique distribué, l'intégration du calcul haute performance et le traitement de données parallèle. Elle offre des outils étendus pour la gestion du cycle de vie des clusters, le profilage des performances et la surveillance en temps réel de l'exécution des tâches. Les utilisateurs peuvent déployer ces environnements sur diverses infrastructures, incluant le matériel local, les fournisseurs cloud, les systèmes conteneurisés et les clusters de calcul haute performance.

    Converts columns to categorical types and tracks category sets to optimize performance across distributed partitions.

    Pythondasknumpypandas
    Voir sur GitHub↗13,746
  • iamseancheney/python_for_data_analysis_2nd_chinese_versionAvatar de iamseancheney

    iamseancheney/python_for_data_analysis_2nd_chinese_version

    8,937Voir sur GitHub↗

    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

    Implements memory-efficient representations for categorical data to optimize performance during grouping operations.

    matplotlibnumpypandas
    Voir sur GitHub↗8,937
  • apache/pinotAvatar de apache

    apache/pinot

    6,098Voir sur GitHub↗

    Pinot is a distributed, columnar analytical database designed for high-concurrency, low-latency query processing. It functions as a real-time OLAP datastore, enabling interactive, user-facing analytics by ingesting and querying massive datasets from both streaming and batch sources. The system architecture relies on a centralized controller for cluster coordination and a distributed segment-based storage model to ensure horizontal scalability. The platform distinguishes itself through a hybrid ingestion pipeline that unifies real-time event streams and historical batch data into a single quer

    Classifies columns as dimensions, metrics, or time fields to enable internal optimizations like automated rollups.

    Java
    Voir sur GitHub↗6,098
  • jdorn/sql-formatterAvatar de jdorn

    jdorn/sql-formatter

    3,857Voir sur GitHub↗

    This project is a PHP library designed for parsing, beautifying, and syntax-highlighting SQL queries. It provides a set of utilities to improve the readability of database code, facilitate debugging, and assist in the maintenance of complex query structures. The library distinguishes itself by offering both aesthetic and functional processing capabilities. It can transform raw SQL strings into structured, indented formats for human review, or compress them by removing comments and unnecessary whitespace to optimize them for network transmission and logging. Additionally, it includes a syntax

    Splits batches of database commands into individual, executable statements by identifying termination characters.

    HTML
    Voir sur GitHub↗3,857
  1. Home
  2. Data & Databases
  3. Categorical Data Optimization

Explorer les sous-tags

  • Categorical Code ExtractorsUtilities for retrieving integer-based representations of categorical data series. **Distinct from Categorical Data Optimization:** Distinct from Categorical Data Optimization: focuses on the retrieval interface for codes rather than memory-efficient storage.
  • Categorical Completeness VerifiersTools for checking if all unique categories in a series have been identified. **Distinct from Categorical Data Optimization:** Distinct from Categorical Data Optimization: focuses on validation logic rather than memory-efficient representation.
  • Categorical Definition RetrieversFunctions for accessing the set of defined categories within a categorical data series. **Distinct from Categorical Data Optimization:** Distinct from Categorical Data Optimization: focuses on metadata retrieval rather than storage optimization.
  • Categorical Type ManagersUtilities for managing and optimizing categorical data types in distributed partitions. **Distinct from Categorical Data Optimization:** Focuses on static category tracking for performance, distinct from general categorical optimization.
  • Native Categorical Splitting1 sous-tagDirect processing of categorical features through partition-based splits instead of one-hot encoding. **Distinct from Categorical Data Optimization:** Distinct from Categorical Data Optimization: specifically about the split algorithm in trees, not just memory representation.