Search Results for "apriori algorithm in java" - Page 2
Sort By:
Showing 495 open source projects for "apriori algorithm in java"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
-
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
1
CalcTools
A library of tools for math calculation
Java source intended to serve as a nexus for teaching both mathematics and software solutions for computation on iterative equations. Public interfaces allow a user to extend the available operator and function lists to external libraries. Currently the packaged libraries include the CERN Colt library and the Anaconda package of math libraries which include MpMath and SciPy. A user can easily extend the functionality by coding to the provided interfaces and dropping a JAR -
2
The program allows you to generate the hashes with the chosen algorithm (MD2, MD5, SHA-1, SHA-256, SHA-384 and SHA-512) of a single file or an entire folder (you can choose to scan the folder recursively or not recursively). It supports drag and drop of files and folders. The hash can be exported to text files. Compiled with openjdk 8. Usage: param 1: exclude symbolic links (0 or 1) [mandatory], param 2: exclude hidden files (0 or 1) [mandatory], param 3: folders to exclude [optional...
-
3
MentDB Weak
Mentalese Database Engine
Welcome to MentDB (Mentalese Database). The platform provides tools for AI, SOA, ETL, ESB, database, web application, data quality, predictive analytics, chatbot ..., in a revolutionary data language (MQL). The server is based on a new generation of AI algorithm, and on an innovative SOA layer to reach the WWD. Mentalese is the language of thought structuring the human brain. This language is able to accommodate different common languages and allows autonomy in a machine. WWD literally... -
4
QScript
Expression and algorithm evaluator (built with Java)
...-UNITL). All the commonly used functions found in Java's Math class are implemented and can easily be extended with user defined functions. Although the download is packaged as a Processing library it does not require Processing, in fact QScript has no third party software dependencies only needing Java. -
Sales CRM and Pipeline Management Software | PipedrivePipedrive’s simple interface empowers salespeople to streamline workflows and unite sales tasks in one workspace. Unlock instant sales insights with Pipedrive’s visual sales pipeline and fine-tune your strategy with robust reporting features and a personalized AI Sales Assistant.
-
5
anotherjavlib
another java library for 3d rendering without hardware accel.
anotherjavlib is another java library built for software 3d rendering. (copyleft, fair use only, warranty void, care should be taken for mission critical systems.) although the library is built with minimum dependency using java system (some of which are arrays, big numbers, zip streams and many more), rendering pipe lines are seemingly coded butally right through. many of packages are tested along with the old dos os of eclipse set, and the included jar files seems running rite yet... -
6
Jadecy
Java lib to compute (code) deps, SCCs, and cycles (Johnson algorithm).
Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31... -
7
Tree Visualisation with Visual Cues
Tree Visualisation with Visual Cues
This project extends a previous work on node link tree visualisation and interaction by providing visual clues on hidden structures. We adopt DOITree from Prefuse package (https://github.com/prefuse/Prefuse), a multi-focal tree layout algorithm, for exploring large hierarchical structures. Related publications: https://www.sciencedirect.com/science/article/pii/S1045926X1630009X https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6902871 -
8
BD-Func
Bidirectional Functional Enrichment of Gene Expression Data
BD-Func is an algorithm to predict activation or inhibition of pathways based upon gene expression patterns. If you use BD-Func, please cite: Warden C, Kanaya N, Chen S, and Yuan Y-C. (2013) BD-Func: A Streamlined Algorithm for Predicting Activation and Inhibition of Pathways. peerJ, 1:e159 -
9
AcoPath for Java
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. -
Photo and Video Editing APIs and SDKsUnlock Picsart's full editing suite by embedding our Editor SDK directly into your platform. Offer your users the power of a full design suite without leaving your site.
-
10
JQM Java Quine McCluskey
JQM - Java Quine McCluskey for minimization of Boolean functions.
Java Quine McCluskey implements the Quine McCluskey algorithm with Petrick’s Method (or the method of prime implicants) for minimization of Boolean functions. This software can be used both for learning and solving real problems. As a learning/teaching tool, it presents not only the results but also how the problem was solved as well as how to use Karnaugh Maps to solve the problem. Up to sixteen functions of sixteen variables can be minimized. A graphical interface is provided for entering... -
11
LeetCode Animation
Demonstrate all the questions on LeetCode in the form of animation
LeetCodeAnimation is an open source project that provides visual animations for solving LeetCode problems, created to make data structures and algorithms easier to understand. The project converts abstract problem-solving processes into clear step-by-step animations that demonstrate how algorithms work internally. It is designed as a study aid for coding interviews, algorithm practice, and computer science education. By visualizing the logic, users can intuitively grasp concepts like recursion... -
12
TengineKit
TengineKit - Free, Fast, Easy, Real-Time Face Detection
Free, Fast, Easy, Real-Time Face Detection & Face Landmarks & Face Attributes & Hand Detection & Hand Landmarks & Body Detection & Body Landmarks & Iris Landmarks & Yolov5 SDK On Mobile. TengineKit is an easy-to-integrate AI algorithm SDK. At present, it can run on various mobile phones at very low latency. We will continue to update this project for better results and better performance! -
13
NtrUtil
A command line interface for encryption and decryption using the NTRU
A command line interface for encryption and decryption using the NTRU cryptography algorithm. "NTRU is a public key cryptosystem that is considered unbreakable even with quantum computers. Commonly used cryptosystems like RSA or ECC, on the other hand, will be broken if and when quantum computers become available."-NTRU -
14
JQuickBase
elementary database files for Java, B+ tree index files, ISAM
Java API to realize quick ISAM (Index Sequential Access Method) functionality for application in the file system. Includes scalable database files w/ space recovery and variable record length, scalable B+Tree index files. Supports file backup and restore. Two package types: one with and one without strong file encryption using Twofish algorithm and state-of-the-art encryption technology. -
15
Jasmine
Super fast Java aexpression and algorithm evaluator
V1.0.1 fully compatible with PS2 and 3. Jasmine uses the ASM byte code manipulation library (http://asm.ow2.org/) to create Java byte code to evaluate numerical expressions and algorithms. Evaluation of compiled expressions is very fast, in most cases it is faster than the equivalent byte code produced by the Java compiler (javac). -
16
Learn Julia the Hard Way
Learn Julia the hard way
... be hard-pressed to find tasks it's completely unsuitable for (although that does not mean it's the best or easiest choice for any of them). Julia was developed with the occasional reference to R, and with an avowed intent to improve upon R's clunkiness. R is a great language, but relatively slow, to the point that most people use it to rapidly prototype, and then implement the algorithm for production in Python or Java. Julia seeks to be as approachable as R but without the speed penalty. -
17
S-DES Crypto App
Encryption/Decryption demonstration app using the S-DES algorithm
Encryption/Decryption demonstration app using the S-DES algorithm. Use the Java runtime environment 11 for execution. The GUI pops up that allows entering a 10-bit encryption/decryption key in binary (0, 1 digits) and the plaintext/ciphertext in the same form (8-bit). Executing the algorithm, decription of the encoding/decoding functionality is provided in the three main text boxes. -
18
BifurcumLib
A library for running through a directional graph.
This is the library for the project Bifurcum. It does all the work. It has a simple algorithm (Deep First Search with modifications) and allows sorting children before traversing. This library sums up the authors 4-years experience when programming a commercial tool for graph traversing (which used a much more advanced algorithm) and coaching its users. -
19
Bifurcum
Software to run through a directional graph.
This software runs through a directional graph and writes the paths it found as test specifications. It has a simple algorithm (Deep First Search with modifications) and allows sorting children before traversing. This application sums up the authors 4-years experience when programming a commercial tool for graph traversing (which used a much more advanced algorithm) and coaching its users. Technically it is a front end for the library Bifurcumlib. -
20
Smart Algorithm
Repository implementing a variety of intelligent algorithms
Smart-Algorithm is a repository implementing a variety of intelligent / metaheuristic optimization algorithms (e.g. Genetic Algorithm, Ant Colony, Particle Swarm, Immune Algorithm). The implementations are provided in multiple languages (Java, Python, MATLAB). The repository’s aim is to offer reference implementations of “smart” algorithms for tasks like route planning, optimization, or algorithm learning. -
21
FinalCrypt
FinalCrypt - Unbreakable One-Time Pad Encryption
Why FinalCrypt? 1. Most people choose Disk-Encryption as it's easier to unlock a whole drive, but Big-Brother or Malware can then also read all your files. Only use File-Encryption! 2. Most software uses recently broken AES encryption. 3. Soon The Shor's algorithm will instantly break all assymmetric encryption with Quantum Computers. 4. FinalCrypt uses Symmetric One Time Pad Encryption, which is the most unbreakable encryption there is. 5. FinalCrypt is the only "One Time Pad... -
22
DISTOD
Distributed discovery of bidirectional order dependencies
The DISTOD data profiling algorithm is a distributed algorithm to discover bidirectional order dependencies (in set-based form) from relational data. DISTOD is based on the single-threaded FASTOD-BID algorithm [1], but DISTOD scales elastically to many machines outperforming FASTOD-BID by up to orders of magnitude. Bidirectional order dependencies (bODs) capture order relationships between lists of attributes in a relational table. They can express that, for example, sorting books... -
23
java-string-similarity
Implementation of various string similarity and distance algorithms
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity. A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented. The main characteristics of each implemented algorithm are presented... -
24
Soma-direct
System Omnichannel Marketing Analysis
Soma - System Omnichannel Marketing Analysis is an open-source solution for simplifying the processes of analyzing and predicting consumer behavior. With Soma, you can combine data from multiple systems and channels in the profile joining process. Interactions and behaviors registered as a part of a unique user create and show what a Customer Journey looks like. The data is subjected to an analysis process which enables the examination of the significance of individual touchpoints for the... -
25
Seshat Naming and Balancing Service
Extended COS Naming and Balancing Service
... using a round robin or a random algorithm. The service uses Spring Security Framework for access control and can be configured to use any Authentication Authorization system supported by the Spring Security Framework.
