Search Results for "ranking"
Sort By:
Showing 20 open source projects for "ranking"
View related business solutions-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
elasticsearch-learning-to-rank
Plugin to integrate Learning to Rank
The Elasticsearch Learning to Rank plugin uses machine learning to improve search relevance ranking. It's powering search at places like Wikimedia Foundation and Snagajob. -
2
Aerosolve
A machine learning package built for humans
Aerosolve is an open-source machine learning library developed by Airbnb, designed for interpretable and human-friendly modeling. Built around sparse, human-intuitive features (like geography, pricing), it supports feature quantization, interaction specification, and rule-based priors—enabling domain experts to contribute directly to model behavior. -
3
CatBoost
High-performance library for gradient boosting on decision trees
CatBoost is a fast, high-performance open source library for gradient boosting on decision trees. It is a machine learning method with plenty of applications, including ranking, classification, regression and other machine learning tasks for Python, R, Java, C++. CatBoost offers superior performance over other GBDT libraries on many datasets, and has several superb features. It has best in class prediction speed, supports both numerical and categorical features, has a fast and scalable GPU version, and readily comes with visualization tools. ... -
4
Smile
Statistical machine intelligence and learning engine
Smile is a fast and comprehensive machine learning engine. With advanced data structures and algorithms, Smile delivers the state-of-art performance. Compared to this third-party benchmark, Smile outperforms R, Python, Spark, H2O, xgboost significantly. Smile is a couple of times faster than the closest competitor. The memory usage is also very efficient. If we can train advanced machine learning models on a PC, why buy a cluster? Write applications quickly in Java, Scala, or any JVM... -
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
5
LightGBM
Gradient boosting framework based on decision tree algorithms
...Parallel experiments have shown that LightGBM can attain linear speed-up through multiple machines for training in specific settings, all while consuming less memory. LightGBM supports parallel and GPU learning, and can handle large-scale data. It’s become widely-used for ranking, classification and many other machine learning tasks. -
6
Kaggle Solutions
Collection of Kaggle Solutions and Ideas
...The repository acts as a knowledge base for competitive machine learning by collecting solution write-ups, discussion threads, code notebooks, and tutorial resources shared by top Kaggle participants. Each competition entry typically includes information about the dataset, evaluation metrics, modeling strategies, and techniques used by high-ranking competitors. The repository also highlights important machine learning concepts such as feature engineering, cross-validation strategies, ensemble modeling, and post-processing methods commonly used in winning solutions. Because the content is organized by competition categories such as computer vision, natural language processing, tabular data, and time-series forecasting, users can explore techniques relevant to specific problem types. -
7
Metarank
A low code Machine Learning service that personalizes articles
...Ingest historical item listings, clicks and item metadata so Metarank can find hidden dependencies in the data using our simple JSON format.No Machine Learning experience is required, run our CLI tool with a set of features in a YAML configuration. Run Metarank API service, feed it with real-time events and receive a personalized ranking for your items that will boost conversion, click-through rate or any other business-critical metric you define. -
8
TensorFlow Ranking
Learning to rank in TensorFlow
TensorFlow Ranking is a library for Learning-to-Rank (LTR) techniques on the TensorFlow platform. Commonly used loss functions including pointwise, pairwise, and listwise losses. Commonly used ranking metrics like Mean Reciprocal Rank (MRR) and Normalized Discounted Cumulative Gain (NDCG). Multi-item (also known as groupwise) scoring functions. LambdaLoss implementation for direct ranking metric optimization. -
9
Implicit
Fast Python collaborative filtering for implicit feedback datasets
This project provides fast Python implementations of several different popular recommendation algorithms for implicit feedback datasets. All models have multi-threaded training routines, using Cython and OpenMP to fit the models in parallel among all available CPU cores. In addition, the ALS and BPR models both have custom CUDA kernels - enabling fitting on compatible GPU’s. This library also supports using approximate nearest neighbour libraries such as Annoy, NMSLIB and Faiss for speeding... -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
10
LightFM
A Python implementation of LightFM, a hybrid recommendation algorithm
LightFM is a Python implementation of a number of popular recommendation algorithms for both implicit and explicit feedback, including efficient implementation of BPR and WARP ranking losses. It's easy to use, fast (via multithreaded model estimation), and produces high-quality results. It also makes it possible to incorporate both item and user metadata into the traditional matrix factorization algorithms. It represents each user and item as the sum of the latent representations of their features, thus allowing recommendations to generalize to new items (via item features) and to new users (via user features). -
11
lightning library
Large-scale linear classification, regression and ranking in Python
lightning is a library for large-scale linear classification, regression and ranking in Python. -
12
MatchZoo
Facilitating the design, comparison and sharing of deep text models
The goal of MatchZoo is to provide a high-quality codebase for deep text matching research, such as document retrieval, question answering, conversational response ranking, and paraphrase identification. With the unified data processing pipeline, simplified model configuration and automatic hyper-parameters tunning features equipped, MatchZoo is flexible and easy to use. Preprocess your input data in three lines of code, keep track parameters to be passed into the model. Make use of MatchZoo customized loss functions and evaluation metrics. ... -
13
Spotlight
Deep recommender models using PyTorch
Spotlight uses PyTorch to build both deep and shallow recommender models. By providing both a slew of building blocks for loss functions (various pointwise and pairwise ranking losses), representations (shallow factorization representations, deep sequence models), and utilities for fetching (or generating) recommendation datasets, it aims to be a tool for rapid exploration and prototyping of new recommender models. Spotlight offers a slew of popular datasets, including Movielens 100K, 1M, 10M, and 20M. ... -
14
AI learning
AiLearning, data analysis plus machine learning practice
...The number of Github Stars exceeds 60k, and it ranks in the top 100 of all Github organizations. The daily up of all its websites exceeds 4k, and the peak of Alexa ranking is 20k. Our core members are certified as CSDN blog experts and short-book programmers as excellent authors. We have established ApacheCN, a non-profit document, and tutorial translation project. -
15
fantail-mlkit
The fantail machine learning toolkit (Moved)
Moved to https://github.com/quansun/fantail-ml -
16
SuRankCo
Supervised Ranking of Contigs in de novo Assemblies
SuRankCo is a machine learning based software to score and rank contigs from de novo assemblies of next generation sequencing data. It trains with alignments of contigs with known reference genomes and predicts scores and ranking for contigs which have no related reference genome yet. For more details about SuRankCo and its functioning, please see "SuRankCo: Supervised Ranking of Contigs in de novo Assemblies" Mathias Kuhring, Piotr Wojtek Dabrowski, Andreas Nitsche and Bernhard Y. Renard (http://www.biomedcentral.com/1471-2105/16/240/abstract) PLEASE NOTE, it is recommended to read the paper and the readme.txt file before using SuRankCo. ... -
17
Clustering Variation looks for a good subset of attributes in order to improve the classification accuracy of supervised learning techniques in classification problems with a huge number of attributes involved. It first creates a ranking of attributes based on the Variation value, then divide into two groups, last using Verification method to select the best group.
-
18
LPCforSOS is a machine learning framework with a special focus on structured output spaces and pairwise learning. It supports currently multiclass, ordinal, hierarchical, multi-label and label ranking classification settings.
-
19
Leark is a Data Mining library developed in C#.NET. It contains several methods for ranking web documents described with a set of normalized features, and a feature selection algorithm. The methods are based on perceptron and clustering.
-
20
The TreeRank project is a R package implementing a Machine Learning algorithm to build tree-based ranking rules from data with binary labels, based on ROC optimization.
- Previous
- You're on page 1
- Next
