Search Results for "apriori algorithm in java" - Page 2
Sort By:
Showing 497 open source projects for "apriori algorithm in java"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
1
AngClust
AngClust: Angle-based feature clustering for time series
Citation: Aimin Li, Siqi Xiong, Junhuai Li, Saurav Mallik, Yajun Liu, Rong Fei, Hongfang Zhou, Guangming Liu. AngClust: Angle Feature-Based Clustering for Short Time Series Gene Expression Profiles. January 2022. IEEE/ACM transactions on computational biology and bioinformatics / IEEE, ACM. DOI: 10.1109/TCBB.2022.3192306 Full text: https://ieeexplore.ieee.org/document/9833353/ https://pubmed.ncbi.nlm.nih.gov/35853049/ Highlights * We proposed a novel clustering algorithm based... -
2
FractalImageCompression
Java Fractal Image Compression based on Delaunay triangulation
Implementation of the algorithm of the paper: "Fractal image compression based on Delaunay triangulation and vector quantization" It is a Fractal compression algorithm, based on relationships between regions of the image (in this case triangles), rather than in explicitly the pixel values themselves. Video demo: https://frojasg1.com:8443/resource_counter/resourceCounter?operation=countAndForward&url=https%3A%2F%2Ffrojasg1.com%2Fdemos%2Faplicaciones%2FfractalCompressor... -
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. -
Powering the best of the internet | FastlyEnsure your websites, applications and services can effortlessly handle the demands of your users with Fastly. Fastly’s portfolio is designed to be highly performant, personalized and secure while seamlessly scaling to support your growth.
-
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. -
MongoDB 8.0 on Atlas | Run anywhereMongoDB 8.0 brings enhanced performance and flexibility to Atlas—with expanded availability across 125+ regions globally. Build modern apps anywhere your users are, with the power of a modern database behind you.
-
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
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! -
12
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 -
13
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. -
14
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). -
15
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. -
16
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. -
17
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. -
18
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. -
19
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... -
20
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... -
21
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... -
22
jsprit
Open source toolkit for solving rich vehicle routing problems
jsprit is a java based, open-source toolkit for solving rich Traveling Salesman Problems(TSP) and Vehicle Routing Problems(VRP). It is lightweight, flexible and easy-to-use, and based on a single all-purpose meta-heuristic. Setting up the problem, defining additional constraints, modifying the algorithms and visualizing the discovered solutions is as easy and handy as reading classical VRP instances to benchmark your algorithm. It is fit for change and extension due to its modular design... -
23
Ank Zipper
A free and easy-to-use password protected file archiver
Ank Zipper provides you with a lightweight, Java-based application designed to provide security to your documents. Ank Zipper can compress both files and folders and create password-protected archives, in order to prevent unauthorized access to important files. Additionally, it can be used for extracting or simply browsing ZIP files.It includes AES(Advanced Encryption Standard) algorithm to encrypt/decrypt file(s). Ank Zipper is a cross-platform software that can be used on any platform... -
24
LoopMatcher
Find sequence-specific stem-loops in FASTA and GenBank files.
LoopMatcher is a bioinformatics tool that searches for hairpin structures in cDNA / mRNA sequences (in FASTA, GenBank or Vienna format) with specific consensus sequences in the loop. It uses RNAfold to predict sequence structure and UShuffle to generate random sequences with a defined k nucleotide frequency. Also, sequences in GenBank format can be downloaded directly from NCBI using the NCBI access ID. Requirements JAVA Runtime 8. It's highly recommended to have a multicore processor... -
25
Simple Cipher Algorithm
Java Encryption Utility.
Very simple to use symmetric Java encryption utility. Please write a review. Email me with any questions or problems.
