5 Repos
Algorithms for discovering common associations and patterns within transactional datasets.
Distinguishing note: Focuses on association rule discovery rather than geometric clustering.
Explore 5 awesome GitHub repositories matching artificial intelligence & ml · Frequent Itemset Mining. Refine with filters or upvote what's useful.
This project is an educational toolkit that provides implementations of fundamental machine learning algorithms built from scratch. By avoiding high-level library abstractions, it serves as a pedagogical reference for understanding the mathematical foundations and core mechanics of supervised learning, unsupervised learning, and reinforcement learning models. The repository distinguishes itself through a modular approach to model construction, allowing users to build custom neural networks by chaining independent functional blocks. It covers a wide range of techniques, including gradient-base
Identifies common associations in transactional data using efficient mining algorithms.
This project is a machine learning implementation library featuring a collection of code examples that implement supervised, unsupervised, and reinforcement learning algorithms from scratch. It provides a comprehensive set of toolkits for core machine learning components, including a natural language processing toolkit, a reinforcement learning framework, and suites for data dimensionality reduction and pattern mining. The library includes specialized implementations for reinforcement learning, such as Q-Learning, Deep Q-Networks, and Actor-Critic agents. The natural language processing capab
Implements algorithms for discovering common associations and recurring patterns within transactional datasets.
Smile is a comprehensive JVM machine learning library and statistical computing toolkit. It provides a suite of algorithms for classification, regression, and clustering, implemented natively for Java, Scala, and Kotlin. The project also functions as a deep learning framework, a natural language processing library, and an inference engine for large language models. The library distinguishes itself through GPU acceleration via LibTorch bindings and support for the ONNX model interchange format. It includes specialized capabilities for large language model inference, featuring Byte-Pair Encodin
Implements algorithms for discovering frequent itemsets and association rules in transactional data.
mlxtend is a pure Python machine learning extension library that provides additional tools for association rule mining, ensemble learning, and feature selection. It is built on numpy and pandas, with all data operations accepting and returning pandas DataFrames, and custom estimators inherit from scikit-learn’s base classes to offer a uniform fit-predict interface compatible with grid search. The library implements the Apriori algorithm for mining frequent itemsets from transaction data and generating association rules with confidence and lift metrics. For classification, it combines multiple
Implements the Apriori algorithm to mine frequent itemsets and generate association rules from transaction data.
Dieses Projekt ist eine Data-Mining-Algorithmus-Library und eine Referenzimplementierung für Machine Learning. Es bietet eine Sammlung von Tools zur Durchführung von Klassifizierung, Clustering und Assoziationsregel-Mining sowie ein Toolkit für naturinspirierte Optimierung. Die Library enthält spezialisierte Dienstprogramme für Graph- und Sequenz-Mining, die die Extraktion häufiger Teilgraphen und sequenzieller Muster ermöglichen. Zudem verfügt sie über ein Dienstprogramm zur Dimensionsreduktion, das die Rough-Set-Theorie nutzt, um redundante Attribute aus Datensätzen zu entfernen. Das Projekt deckt ein breites Spektrum analytischer Fähigkeiten ab, darunter Netzwerk- und Graphanalyse zur Bewertung der Knotenwichtigkeit sowie die Verwendung probabilistischer Modelle und Entscheidungsbäume zur Datenklassifizierung. Es implementiert zudem distanz- und dichte-basierte Methoden zur Gruppierung von Daten sowie heuristik-basierte Suchmuster zur Lösung komplexer Optimierungsprobleme.
Identifies frequent itemsets and sequential events by iteratively pruning search spaces and expanding patterns.