Download JAR files tagged by algorithm with all dependencies
marmotta-reasoner from group org.apache.marmotta (version 3.1.0-incubating)
Provides support for the sKWRL rule-based reasoning language. Rule programs can be uploaded and are evaluated
in a forward chaining algorithm whenever a transaction commits. Since the reasoner evaluates rules directly on
the database, reasoning is quite efficient.
Artifact marmotta-reasoner
Group org.apache.marmotta
Version 3.1.0-incubating
Last update 24. September 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 3
Dependencies marmotta-core, kiwi-reasoner, weld-se-core,
There are maybe transitive dependencies!
Group org.apache.marmotta
Version 3.1.0-incubating
Last update 24. September 2013
Organization not specified
URL Not specified
License not specified
Dependencies amount 3
Dependencies marmotta-core, kiwi-reasoner, weld-se-core,
There are maybe transitive dependencies!
ordinalLearningMethod from group nz.ac.waikato.cms.weka (version 1.0.2)
An implementation of the Ordinal Learning Method (OLM). Further information regarding the algorithm and variants can be found in: Arie Ben-David (1992). Automatic Generation of Symbolic Multiattribute Ordinal Knowledge-Based DSSs: methodology and Applications. Decision Sciences. 23:1357-1372.
Group: nz.ac.waikato.cms.weka Artifact: ordinalLearningMethod
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
Artifact ordinalLearningMethod
Group nz.ac.waikato.cms.weka
Version 1.0.2
Last update 26. April 2012
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/ordinalLearningMethod
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
Group nz.ac.waikato.cms.weka
Version 1.0.2
Last update 26. April 2012
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/ordinalLearningMethod
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
NNge from group nz.ac.waikato.cms.weka (version 1.0.2)
Nearest-neighbor-like algorithm using non-nested generalized exemplars (which are hyperrectangles that can be viewed as if-then rules). For more information, see Brent Martin (1995). Instance-Based learning: Nearest Neighbor With Generalization. Hamilton, New Zealand. Sylvain Roy (2002). Nearest Neighbor With Generalization. Christchurch, New Zealand.
0 downloads
Artifact NNge
Group nz.ac.waikato.cms.weka
Version 1.0.2
Last update 26. April 2012
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/NNge
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
Group nz.ac.waikato.cms.weka
Version 1.0.2
Last update 26. April 2012
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/NNge
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
CLOPE from group nz.ac.waikato.cms.weka (version 1.0.2)
Yiling Yang, Xudong Guan, Jinyuan You: CLOPE: a fast and effective clustering algorithm for transactional data. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, 682-687, 2002.
0 downloads
Artifact CLOPE
Group nz.ac.waikato.cms.weka
Version 1.0.2
Last update 26. April 2012
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/CLOPE
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
Group nz.ac.waikato.cms.weka
Version 1.0.2
Last update 26. April 2012
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/CLOPE
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!
porter-stemmer from group gov.sandia.foundry (version 1.4)
The Porter stemming algorithm (or ‘Porter stemmer’) is a process for removing the commoner morphological and inflexional endings from words in English. Its main use is as part of a term normalisation process that is usually done when setting up Information Retrieval systems.
Artifact porter-stemmer
Group gov.sandia.foundry
Version 1.4
Last update 28. August 2011
Organization not specified
URL http://tartarus.org/~martin/PorterStemmer/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group gov.sandia.foundry
Version 1.4
Last update 28. August 2011
Organization not specified
URL http://tartarus.org/~martin/PorterStemmer/
License The BSD License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
gnudiff from group com.bmsi (version 1.7)
A translation of the GNU Diff algorithm to a Java class. The Diff class computes the differences
between two Object arrays as a list of changes. This is very general purpose. Any of the options
to GNU diff can be efficiently implemented as variations on how Object.equals() is implemented
and how the change list is printed.
Artifact gnudiff
Group com.bmsi
Version 1.7
Last update 01. February 2011
Organization not specified
URL http://www.bmsi.com/java/#diff
License GNU GENERAL PUBLIC LICENSE
Dependencies amount 1
Dependencies junit,
There are maybe transitive dependencies!
Group com.bmsi
Version 1.7
Last update 01. February 2011
Organization not specified
URL http://www.bmsi.com/java/#diff
License GNU GENERAL PUBLIC LICENSE
Dependencies amount 1
Dependencies junit,
There are maybe transitive dependencies!
ai-pipeline from group org.apache.skywalking (version 10.0.1)
AI pipeline module include pipelines connecting the OAP kernel and any 3rd party AI and/or algorithm
server. The kernel would call the pipeline in the specific context/scenario with well formatted telemetry data,
and expect the remote to respond with the result of the AI/algorithm as quick as possible, but in async way in
case of large size of data or lower performance behavior of the remote.
0 downloads
Artifact ai-pipeline
Group org.apache.skywalking
Version 10.0.1
Last update 30. May 2024
Organization not specified
URL Not specified
License not specified
Dependencies amount 5
Dependencies grpc-netty, grpc-protobuf, grpc-stub, library-module, library-client,
There are maybe transitive dependencies!
Group org.apache.skywalking
Version 10.0.1
Last update 30. May 2024
Organization not specified
URL Not specified
License not specified
Dependencies amount 5
Dependencies grpc-netty, grpc-protobuf, grpc-stub, library-module, library-client,
There are maybe transitive dependencies!
learnlib-rpni from group de.learnlib (version 0.17.0)
This artifact provides the implementation of (a blue-fringe version of) the "regular positive negative
inference" (RPNI) learning algorithm as presented in the paper "Inferring regular languages in polynomial update
time" (https://dx.doi.org/10.1142/9789812797902_0004) by Jose Oncina and Pedro García.
More details on the blue-fringe version of this algorithm can be found in the book "Grammatical Inference"
(https://doi.org/10.1017/CBO9781139194655) by Colin de la Higuera.
0 downloads
Artifact learnlib-rpni
Group de.learnlib
Version 0.17.0
Last update 15. November 2023
Organization not specified
URL Not specified
License not specified
Dependencies amount 8
Dependencies learnlib-api, learnlib-datastructure-pta, automata-api, automata-commons-smartcollections, checker-qual, buildergen, learnlib-learner-it-support, testng,
There are maybe transitive dependencies!
Group de.learnlib
Version 0.17.0
Last update 15. November 2023
Organization not specified
URL Not specified
License not specified
Dependencies amount 8
Dependencies learnlib-api, learnlib-datastructure-pta, automata-api, automata-commons-smartcollections, checker-qual, buildergen, learnlib-learner-it-support, testng,
There are maybe transitive dependencies!
pmptt from group one.edee.oss (version 1.2.2)
Library encapsulates a special flavour of MPTT algorithm with predictable bound computation logic,
that allows to minimize write overhead that is otherwise closely connected to standard MPTT algorithm.
MPTT flattens hierarchical structure to flat structure with bounds that allow quick filtering children
or parent nodes when required.
Group: one.edee.oss Artifact: pmptt
Show all versions
Show all versions
There is no JAR file uploaded. A download is not possible! Please choose another version.
0 downloads
Artifact pmptt
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization FG Forrest, a.s.
URL https://github.com/FgForrest/PMPTT/
License MIT License
Dependencies amount 3
Dependencies jsr305, commons-logging, lombok,
There are maybe transitive dependencies!
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization FG Forrest, a.s.
URL https://github.com/FgForrest/PMPTT/
License MIT License
Dependencies amount 3
Dependencies jsr305, commons-logging, lombok,
There are maybe transitive dependencies!
pmptt_core from group one.edee.oss (version 1.2.2)
0 downloads
Artifact pmptt_core
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Page 89 from 3 (items total 959)