Search Results for "using" - Page 12
Sort By:
Showing 341 open source projects for "using"
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.
-
Outgrown Windows Task Scheduler?Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
-
1
BagaturChess
Java Chess Engine
This is UCI Chess Engine writen in Java. Since version 1.4 (inclusive) the project was moved to https://github.com/bagaturchess/Bagatur -
2
Mass-based dissimilarity
A data dependent dissimilarity measure based on mass estimation.
This software calculates the mass-based dissimilarity matrix for data mining algorithms relying on a distance measure. References: Overcoming Key Weaknesses of Distance-based Neighbourhood Methods using a Data Dependent Dissimilarity Measure. KDD 2016 http://dx.doi.org/10.1145/2939672.2939779 The source code, presentation slide and poster are attached under "Files". The presentation video in KDD 2016 is published on https://youtu.be/eotD_-SuEoo . Since this software is licensed under the Gnu General Public license GPLv3, any derivative work must be licensed under the GPL as well. ... -
3
GA-EoC
GeneticAlgorithm-based search for Heterogeneous Ensemble Combinations
...This is even worst in case of both the high dimensional and class-imbalanced datasets. To overcome the limitations of class-imbalanced data, we split the dataset using a random sub-sampling to balance them. Then, we apply the (alpha,beta)-k feature set method to select a better subset of features and combine their outputs to get a consolidated feature set for classifier training. To enhance classification performances, we propose an ensemble of classifiers that combine the classification outputs of base classifiers using the simplest and largely used majority voting approach. ... -
4
jLDADMM
A Java package for the LDA and DMM topic models
...It provides implementations of the Latent Dirichlet Allocation topic model and the one-topic-per-document Dirichlet Multinomial Mixture model (i.e. mixture of unigrams), using collapsed Gibbs sampling. In addition, jLDADMM supplies a document clustering evaluation to compare topic models. See the usage of jLDADMM in its website at http://jldadmm.sourceforge.net/ -
Atera all-in-one platform IT management software with AI agentsAtera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
-
5
Scene is a computer vision framework that performs background subtraction and object tracking, using two traditional algorithms and three more recent algorithms based on neural networks and fuzzy classification rules. For each detected object, Scene sends TUIO messages to one or several client applications. The present release features GPU accelerated versions of all the background subtraction methods and morphological post processing of the object blobs with dilation and erosion filters, implemented in OpenCL. ...
-
6
LightSpeedANN
Generator for optimized, vectorized neural net code
This Ruby program takes in a topology specification for an artificial neural network and emits optimized C code (using SSE intrinsics) that implements fast forward and backward propagation for that specific topology. -
7
FENNIX
Fast EXperimentation with Neural Networks
FENNIX is a simulator of artificial neural networks written in Java. It allows you to easily describe a complete simulation by using a simple text script language or by adding nodes to a tree of tasks by using the graphical used interface. Moreover, FENNIX is composed of pluggable tools that can be easily modified in order to add new functionalities to the simulator. -
8
DE-HEoC
DE-based Weight Optimisation for Heterogeneous Ensemble
...Average Matthews Correlation Coefficient (MCC) score, calculated over 10-fold cross-validation, has been used as the measure of quality of an ensemble. DE/rand/1/bin algorithm has been utilised to maximize the average MCC score calculated using 10-fold cross-validation on training dataset. The voting weights of base classifiers are optimized for the heterogeneous ensemble of classifiers aiming to attain better generalization performances on testing datasets. -
9
...The second package includes source and object files of DEMass-DBSCAN to be used with the WEKA system. 3. The third package DEMassBayes includes the source and object files of a Bayesian classifier using DEMass. DEMassBayes.7z has jar file to be used with WEKA and a readme file listing parameters used. The source files are included in DEMassBayes_Source.7z. 4. The four package is MassTER includes source and JAR file to be used with WEKA system..
-
Failed Payment Recovery for Subscription BusinessesFlexPay’s innovative platform uses multiple technologies to achieve the highest number of retained customers, resulting in reduced involuntary churn, longer life span after recovery, and higher revenue. Leading brands like LegalZoom, Hooked on Phonics, and ClinicSense trust FlexPay to recover failed payments, reduce churn, and increase customer lifetime value.
-
10
LightSpMV
lightweight GPU-based sparse matrix-vector multiplication (SpMV)
LightSpMV is a novel CUDA-compatible sparse matrix-vector multiplication (SpMv) algorithm using the standard compressed sparse row (CSR) storage format. We have evaluated LightSpMV using various sparse matrices and further compared it to the CSR-based SpMV subprograms in the state-of-the-art CUSP and cuSPARSE. Performance evaluation reveals that on a single Tesla K40c GPU, LightSpMV is superior to both CUSP and cuSPARSE, with a speedup of up to 2.60 and 2.63 over CUSP, and up to 1.93 and 1.79 over cuSPARSE for single and double precision, respectively. -
11
HYBRYD
Library written in C with Python API for IPv6 networking
This project is a rewritten of an initial project that I've called GLUE and created in 2005. I'm trying to readapt it for Python 2.7.3 and GCC 4.6.3 The library has to be build as a simple Python extension using >python setup.py install and allows to create different kind of servers, clients or hybryds (clients-servers) over (TCP/UDP) using the Ipv6 Protocol. The architecture of the code is based on brain architecture. Will put an IPv6 adress active available as soon as possible so that you can download pieces of codes. The aim of that coding was to use primary linux commands easily codable and make an object of an IPv6 connection. ... -
12
Adaptive Gaussian Filtering
Machine learning with Gaussian kernels.
Libagf is a machine learning library that includes adaptive kernel density estimators using Gaussian kernels and k-nearest neighbours. Operations include statistical classification, interpolation/non-linear regression and pdf estimation. For statistical classification there is a borders training feature for creating fast and general pre-trained models that nonetheless return the conditional probabilities. Libagf also includes clustering algorithms as well as comparison and validation routines. ... -
13
Drug Extraction
Drug name extraction
...Feature set: Word, Word-1, Word+1, Word-1_Word, Word_Word+1, DrugBankPresence, POS DrugBankPresence feature indicates the presence of the drug name in the DrugBank. Using CONLL-Evaluation: processed 32065 tokens with 3656 phrases; found: 3251 phrases; correct: 2786. accuracy: 95.25%; precision: 85.70%; recall: 76.20%; FB1: 80.67 Using GATE Corpus Benchmark: Strict: P: 0.65 R: 0.73 F1: 0.69 Lenient: P: 0.74 R: 0.84 F1: 0.78 The details of how to reproduce evaluation, see README. ... -
14
SuRankCo
Supervised Ranking of Contigs in de novo Assemblies
...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. Update Jun2015: * Minor changes to enable BAM support. Update Feb2014: * Added support for FASTA/SAM assemblies in addition to ACE/FASTQ(QUAL). NOTE: features of FASTA/SAM assemblies do not include BaseCount, BaseSeqmentCount and ContigQualities yet. -
15
LexSub
A Lexical Substitution Framework
Lexical substitution framework for supervised all-words lexical substitution using delexicalized features. For a runnable (but GPL-licensed) version of LexSub, see LexSub-GPL (sf.net/p/lexsub/lexsub-gpl) -
16
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.
-
17
ArabicDiacritizer
An automatic restoration of Arabic diacritic marks
.... - Install the application using "Setup.exe". - Put an Arabic text in the Text Box. - Start the diacritization process. If the following problem occured: <Access to the path '..\ArabicDiacritizer v1.0\text.data' is denied> - Access to the path "Program Files\ArabicDiacritizer\ArabicDiacritizer v1.0\", - Right click on "ArabicDiacritizer" - Choose "Run as administrator" For further information, please contact: rebai_ily -
18
KMeansAniX
Animation of kmeans clustering using X Window System
Open source animation of kmeans clustering in X Window System using the C++ libplotter library. Supports Linux, Mac, and BSD. Includes common initialization methods such as Forgy, Macqueen, random, and angular. Sample videos are available through the Files Tab above. The SVN repo is accessible thorugh the Code Tab above. Requires a C++ compiler, libplot-dev, and libncurses5-dev Mac alternative to libplot-dev: macports plotutils +x11 -
19
Genetic Algorithms Engine - Blackjack
A genetic algortihm engine that evolves blackjack basic strategy.
...To see it in action, download the zip file and run either: GABlackjack_Demo.exe (quick) or GABlackjack_Long.exe (slow, but it achieves better results). The code was written in C++, using MS Visual Studio 6.0 and MS Visual Source Safe 6.0. The genetic algorithm engine supports various mutation rates, ranked parental selection, stochastic sampling parental selection, cyclic crossover, crossover at each gene, cloning the best individual each generation, and creating random individuals each generation. To use the genetic algorithm engine to search for a different problem's solution, one needs to program a fitness function, the project settings, and a few virtual functions. -
20
ConvNetJS
Deep learning in Javascript to train convolutional neural networks
ConvNetJS is a Javascript library for training Deep Learning models (Neural Networks) entirely in your browser. Open a tab and you're training. No software requirements, no compilers, no installations, no GPUs, no sweat. ConvNetJS is an implementation of Neural networks, together with nice browser-based demos. It currently supports common Neural Network modules (fully connected layers, non-linearities), classification (SVM/Softmax) and Regression (L2) cost functions, ability to specify and... -
21
BudgetedSVM
BudgetedSVM: A C++ Toolbox for Large-scale, Non-linear Classification
We present BudgetedSVM, a C++ toolbox containing highly optimized implementations of three recently proposed algorithms for scalable training of Support Vector Machine (SVM) approximators: Adaptive Multi-hyperplane Machines (AMM), Budgeted Stochastic Gradient Descent (BSGD), and Low-rank Linearization SVM (LLSVM). BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classi fication problems with millions of... -
22
ANNFiD
A forensic file identification tool using neural networks
Just carved a bunch of bytes and have no idea what they could be? Maybe ANNFiD can help. ANNFiD uses neural network to identify byte patterns. It can be trained and has a GUI to help in the process. The tool is still on a very early stage, but could improve exponentially with the help of the developer community -
23
FineSplice
Enhanced splice junction detection and estimation from RNA-Seq data
FineSplice is a Python wrapper to TopHat2 geared towards a reliable identification of expressed exon junctions from RNA-Seq data, at enhanced detection precision with small loss in sensitivity. Following alignment with TopHat2 using known transcript annotations, FineSplice takes as input the resulting BAM file and outputs a confident set of expressed splice junctions with the corresponding read counts. Potential false positives arising from spurious alignments are filtered out via a semi-supervised anomaly detection strategy based on logistic regression. Multiple mapping reads with a unique location after filtering are rescued and reallocated to the most reliable candidate location. ... -
24
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer Vision and Pattern Recognition, 2012. ... -
25
neural network designer
a dbms for neural nets. Chatbots, DTrees, random forests, n-grams,...
...It is probably best compared to a database management system, but for neural networks instead of relational data. As such, the library is optimized for handling any type of data-size by using advanced streaming and caching algorithms. With the designer, you are able to create different types of decision trees, random forests, n-grams, pattern-matchers, conversational agents and all sorts of AI related algorithms. You can combine statistical approaches as well as pattern matchers or others. Do natural language processing, image or data analysis & interpretation,...
