Download JAR files tagged by algorithm with all dependencies

pmptt_core from group one.edee.oss (version 1.2.2)

Group: one.edee.oss Artifact: pmptt_core
Show all versions Show documentation Show source

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!

pmptt_rdbms from group one.edee.oss (version 1.2.2)

Group: one.edee.oss Artifact: pmptt_rdbms
Show all versions Show documentation Show source

0 downloads

Artifact pmptt_rdbms
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 6
Dependencies darwin, pmptt_core, spring-core, spring-context, spring-jdbc, spring-tx,
There are maybe transitive dependencies!

pmptt_tests from group one.edee.oss (version 1.2.2)

Group: one.edee.oss Artifact: pmptt_tests
Show all versions

0 downloads

Artifact pmptt_tests
Group one.edee.oss
Version 1.2.2
Last update 24. June 2022
Organization not specified
URL Not specified
License not specified
Dependencies amount 2
Dependencies pmptt_core, pmptt_rdbms,
There are maybe transitive dependencies!

optics_dbScan from group nz.ac.waikato.cms.weka (version 1.0.6)

The OPTICS and DBScan clustering algorithms. Martin Ester, Hans-Peter Kriegel, Joerg Sander, Xiaowei Xu: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In: Second International Conference on Knowledge Discovery and Data Mining, 226-231, 1996; Mihael Ankerst, Markus M. Breunig, Hans-Peter Kriegel, Joerg Sander: OPTICS: Ordering Points To Identify the Clustering Structure. In: ACM SIGMOD International Conference on Management of Data, 49-60, 1999.

Group: nz.ac.waikato.cms.weka Artifact: optics_dbScan
Show all versions Show documentation Show source

5 downloads

Artifact optics_dbScan
Group nz.ac.waikato.cms.weka
Version 1.0.6
Last update 16. December 2019
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/optics_dbScan
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!

ecfeed.junit from group com.ecfeed (version 1.0.0)

An open library used to connect to the ecFeed service. It can be also used as a standalone testing tool. It is integrated with Junit5 and generates a stream of test cases using a selected algorithm (e.g. Cartesian, N-Wise). There are no limitations associated with the off-line version but the user cannot access the on-line computation servers and the model database.

Group: com.ecfeed Artifact: ecfeed.junit
Show documentation Show source

0 downloads

Artifact ecfeed.junit
Group com.ecfeed
Version 1.0.0
Last update 04. October 2019
Organization not specified
URL https://ecfeed.com/
License Eclipse Public License - v 1.0
Dependencies amount 1
Dependencies selenium-java,
There are maybe transitive dependencies!

LBFGS from group com.github.thssmonkey (version 1.0.4)

Limited-memory BFGS (L-BFGS) is an optimization algorithm in the family of quasi-Newton methods that approximates the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm using a limited amount of computer memory. It is a popular algorithm for parameter estimation in machine learning. The algorithm's target problem is to minimize f(x) over unconstrained values of the real-vector x where f is a differentiable scalar function.

Group: com.github.thssmonkey Artifact: LBFGS
Show all versions Show documentation Show source

0 downloads

Artifact LBFGS
Group com.github.thssmonkey
Version 1.0.4
Last update 16. May 2019
Organization not specified
URL https://github.com/thssmonkey/LBFGS
License The Apache Software License, Version 2.0
Dependencies amount 4
Dependencies flink-scala_${scala.binary.version}, flink-streaming-scala_${scala.binary.version}, flink-clients_${scala.binary.version}, flink-ml_${scala.binary.version},
There are maybe transitive dependencies!

nilsimsa from group com.weblyzard.lib.string (version 0.0.5)

A Java implementation of the Nilsimsa locality sensitive hash. The Nilsimsa algorithm computes a 256 bit hash value that indicates how different two strings are. The more similar the strings the smaller will be the bitwise difference between their respective Nilsimsa hashes. Therefore, Nilsimsa is well suited to detect texts of the same origin, such as slightly modified spam messages, updated newspaper articles, etc.

Group: com.weblyzard.lib.string Artifact: nilsimsa
Show all versions Show documentation Show source

0 downloads

Artifact nilsimsa
Group com.weblyzard.lib.string
Version 0.0.5
Last update 30. October 2018
Organization not specified
URL https://github.com/weblyzard/nilsimsa
License GNU General Public License, Version 3
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!

trees from group de.cit-ec.tcs.alignment (version 3.1.1)

This module provides two packages, 'trees' and 'forests', which provide algorithms to compute edit distances on trees and forests (that is, unordered or ordered lists of trees) respectively. The edit distance is computed according to the tree edit distance algorithm of Zhang and Shasha (1989). The basic tree data structure is defined by the Tree interface in the trees module. Please refer to the javadoc for more detailed information.

Group: de.cit-ec.tcs.alignment Artifact: trees
Show all versions Show documentation Show source

0 downloads

Artifact trees
Group de.cit-ec.tcs.alignment
Version 3.1.1
Last update 26. October 2018
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 2
Dependencies algorithms, sets,
There are maybe transitive dependencies!

XMeans from group nz.ac.waikato.cms.weka (version 1.0.6)

Cluster data using the X-means algorithm. X-Means is K-Means extended by an Improve-Structure part In this part of the algorithm the centers are attempted to be split in its region. The decision between the children of each center and itself is done comparing the BIC-values of the two structures. For more information see: Dan Pelleg, Andrew W. Moore: X-means: Extending K-means with Efficient Estimation of the Number of Clusters. In: Seventeenth International Conference on Machine Learning, 727-734, 2000.

Group: nz.ac.waikato.cms.weka Artifact: XMeans
Show all versions Show documentation Show source

6 downloads

Artifact XMeans
Group nz.ac.waikato.cms.weka
Version 1.0.6
Last update 28. February 2018
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/XMeans
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!

com.googlecode.jweb1t from group com.googlecode.jweb1t (version 1.4.0)

jWeb1T is an open source Java tool for efficiently searching n-gram data in the Web 1T 5-gram corpus format. It is based on a binary search algorithm that finds the n-grams and returns their frequency counts in logarithmic time. As the corpus is stored in many files a simple index is used to retrieve the files containing the n-grams.

Group: com.googlecode.jweb1t Artifact: com.googlecode.jweb1t
Show all versions Show documentation Show source

1 downloads

Artifact com.googlecode.jweb1t
Group com.googlecode.jweb1t
Version 1.4.0
Last update 03. October 2017
Organization not specified
URL https://dkpro.github.io/jweb1t
License The Apache Software License, Version 2.0
Dependencies amount 3
Dependencies commons-lang3, pcj, commons-logging-api,
There are maybe transitive dependencies!

Page 87 from 93 (items total 930)