Open Source S/R Artificial Intelligence Software

TXM is a free and open-source cross-platform Unicode & XML based text analysis environment and graphical client, supporting Windows, Linux and Mac OS X. It can also be used online as a J2EE standard compliant web portal (GWT based) with access control built in. DOWNLOAD LATEST VERSION OF TXM : http://textometrie.ens-lyon.fr/spip.php?rubrique61&lang=en TXM offers a comprehensive range of analysis tools (concordances, collocate search, frequency lists, etc.) based on the powerfull CQP full text search engine (http://cwb.sourceforge.net) and a range of statistical functions (factorial analysis, classification, cooccurrency analysis, etc.) based on R packages (http://www.r-project.org). Read the scientific background at the Textométrie project web site http://textometrie.ens-lyon.fr/?lang=en. Read a full description at the TEI Tools wiki http://wiki.tei-c.org/index.php/TXM.

This is the SIGGI program used for a diploma thesis in 2012. It can be used as a solid basis for research concerning Ideation Games (Idea Creation). If you have module requests or want to contribute please contact the author.

VLE is a multi-modeling and simulation environment to study complex dynamic systems. VLE is based on the discrete event specification DEVS. and it implements the DSDE formalism (A merge of Dynamic Structure DEVS, DSDEVS, with Parallel DEVS, PDEVS). VLE provides a complete set of C++ libraries, called VFL (VLE Foundation Libraries), to develop DEVS models, to gets results of simulations, to launch simulation on cluster. The models can be developed with the DEVS formalism or with the classical mathematical formalism: Ordinary Differential Equation with Euler, Range-Kutta or QSS integrator, Finite state automaton (FDDEVS, UML State chart, Hybrid Petri net). The VLE environment provides an IDE to develop C++ models, DEVS coupled models. VLE have also three ports to use the VFL with Python, Java and R programming languages.

Builds synthetic data applicable across multiple domains. This package also provides flexibility to control data distribution to make it relevant to many industry examples.

- MixtureModel_v1r1: overlapping community algorithm [3], which includes novel partition density and fuzzy modularity metrics. - OpenMP versions of algorithms in [1] are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness [1] and Spectral Modularity [2]. Collaborator: Theologos Kotsos. [1] M. Newman & M. Girvan, Physical Review, E 69 (026113), 2004. [2] M. Newman, Physical Review E, 74(3):036104, 2006. [3] B. Ball et al, An efficient and principled method for detecting communities in networks, 2011. The suite is based upon the fast community algorithm implemented by Aaron Clauset <aaron@cs.unm.edu>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <csardi@rmki.kfki.hu>. It also makes of the classes available from Numerical Recipies 3rd Edition W. Press, S. Teukolsky, W. Vetterling, B. Flanne

Platform for parallel computation in the Amazon cloud, including machine learning ensembles written in R for computational biology and other areas of scientific research. Home to MR-Tandem, a hadoop-enabled fork of X!Tandem peptide search engine.

An implementation of the Kernel-based Orthogonal Projections to Latent Structures (K-OPLS) method for MATLAB and R. The supplied functionality includes e.g. cross-validation, kernel parameter optimization, model diagnostics and plot tools.

An open source system for supervised document classification based on statistical machine learning techniques. On the contrary of the state of art classification techniques, MyNook just requires the title of the document, not the content itself.

Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator

This is a variant of k-means algorithm which allows datas to belong to several clusters instead of just one.

This application allow user to predict dissolution profile of solid dispersion systems based on algorithms like symbolic regression, deep neural networks, random forests or generalized boosted models. Those techniques can be combined to create expert system. Application was created as a part of project K/DSC/004290 subsidy for young researchers from Polish Ministry of Higher Education.

Structlab is a machine learning C++ framework for structured domains, which provides a toolbox of learning methods and tools for preprocessing and visualization. It also provides a GUI to setup elaborate experiments in a visual and intuitive way.

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. 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.

User Interface (ui) application which implements the automated feature selection provided by the 'fscaret' package of R-environment.

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.