All Downloads are FREE. Search and download functionalities are using the official Maven repository.

Download JAR files tagged by neighbors with all dependencies


knn-benchmark from group com.nitayjoffe.thirdparty.net.robowiki.knn (version 0.1)

Group: com.nitayjoffe.thirdparty.net.robowiki.knn Artifact: knn-benchmark
Show documentation Show source 
Download knn-benchmark.jar (0.1)
 

1 downloads

annoy from group com.spotify (version 0.2.6)

Approximate nearest neighbors in Java

Group: com.spotify Artifact: annoy
Show all versions Show documentation Show source 
Download annoy.jar (0.2.6)
 

0 downloads
Artifact annoy
Group com.spotify
Version 0.2.6
Last update 12. August 2019
Organization not specified
URL https://github.com/spotify/annoy-java
License The Apache Software License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!

RankSys-nn from group org.ranksys (version 0.4.3)

RankSys module, providing nearest neighbors recommendation algorithms.

Group: org.ranksys Artifact: RankSys-nn
Show documentation Show source 
Download RankSys-nn.jar (0.4.3)
 

0 downloads
Artifact RankSys-nn
Group org.ranksys
Version 0.4.3
Last update 13. September 2016
Organization not specified
URL http://ranksys.org
License not specified
Dependencies amount 5
Dependencies RankSys-core, RankSys-fast, RankSys-rec, fastutil, jool,
There are maybe transitive dependencies!

java-graphs from group info.debatty (version 0.41)

Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...

Group: info.debatty Artifact: java-graphs
Show all versions Show documentation Show source 
Download java-graphs.jar (0.41)
 

3 downloads
Artifact java-graphs
Group info.debatty
Version 0.41
Last update 23. November 2017
Organization not specified
URL https://github.com/tdebatty/java-graphs
License MIT License
Dependencies amount 2
Dependencies java-string-similarity, java-spamsum,
There are maybe transitive dependencies!

SMOTE from group nz.ac.waikato.cms.weka (version 1.0.3)

Resamples a dataset by applying the Synthetic Minority Oversampling TEchnique (SMOTE). The original dataset must fit entirely in memory. The amount of SMOTE and number of nearest neighbors may be specified. For more information, see Nitesh V. Chawla et. al. (2002). Synthetic Minority Over-sampling Technique. Journal of Artificial Intelligence Research. 16:321-357.

Group: nz.ac.waikato.cms.weka Artifact: SMOTE
Show all versions Show documentation Show source 
Download SMOTE.jar (1.0.3)
 

30 downloads
Artifact SMOTE
Group nz.ac.waikato.cms.weka
Version 1.0.3
Last update 03. April 2013
Organization University of Waikato, Hamilton, NZ
URL http://weka.sourceforge.net/doc.packages/SMOTE
License GNU General Public License 3
Dependencies amount 1
Dependencies weka-dev,
There are maybe transitive dependencies!

k3nn from group io.github.k3nn (version 0.01)

Group: io.github.k3nn Artifact: k3nn
Show documentation Show source 
Download k3nn.jar (0.01)
 

0 downloads
Artifact k3nn
Group io.github.k3nn
Version 0.01


chips-n-salsa from group org.cicirello (version 7.0.1)

Chips-n-Salsa is a Java library of customizable, hybridizable, iterative, parallel, stochastic, and self-adaptive local search algorithms. The library includes implementations of several stochastic local search algorithms, including simulated annealing, hill climbers, as well as constructive search algorithms such as stochastic sampling. Chips-n-Salsa now also includes genetic algorithms as well as evolutionary algorithms more generally. The library very extensively supports simulated annealing. It includes several classes for representing solutions to a variety of optimization problems. For example, the library includes a BitVector class that implements vectors of bits, as well as classes for representing solutions to problems where we are searching for an optimal vector of integers or reals. For each of the built-in representations, the library provides the most common mutation operators for generating random neighbors of candidate solutions, as well as common crossover operators for use with evolutionary algorithms. Additionally, the library provides extensive support for permutation optimization problems, including implementations of many different mutation operators for permutations, and utilizing the efficiently implemented Permutation class of the JavaPermutationTools (JPT) library. Chips-n-Salsa is customizable, making extensive use of Java's generic types, enabling using the library to optimize other types of representations beyond what is provided in the library. It is hybridizable, providing support for integrating multiple forms of local search (e.g., using a hill climber on a solution generated by simulated annealing), creating hybrid mutation operators (e.g., local search using multiple mutation operators), as well as support for running more than one type of search for the same problem concurrently using multiple threads as a form of algorithm portfolio. Chips-n-Salsa is iterative, with support for multistart metaheuristics, including implementations of several restart schedules for varying the run lengths across the restarts. It also supports parallel execution of multiple instances of the same, or different, stochastic local search algorithms for an instance of a problem to accelerate the search process. The library supports self-adaptive search in a variety of ways, such as including implementations of adaptive annealing schedules for simulated annealing, such as the Modified Lam schedule, implementations of the simpler annealing schedules but which self-tune the initial temperature and other parameters, and restart schedules that adapt to run length.

Group: org.cicirello Artifact: chips-n-salsa
Show all versions Show documentation Show source 
Download chips-n-salsa.jar (7.0.1)
 

0 downloads
Artifact chips-n-salsa
Group org.cicirello
Version 7.0.1
Last update 12. December 2024
Organization Cicirello.Org
URL https://chips-n-salsa.cicirello.org/
License GPL-3.0-or-later
Dependencies amount 3
Dependencies jpt, rho-mu, core,
There are maybe transitive dependencies!



Page 1 from 1 (items total 7)


© 2015 - 2024 Weber Informatics LLC | Privacy Policy