Algorithm::Merge - Three-way merge and diff

++

++

lib/RPerl/Algorithm/Sort/Merge.pm

29 ++

29 ++

Algorithm::C3 - A module for merging hierarchies using the C3 algorithm

2 ++

2 ++

This module implements the C3 algorithm. I have broken this out into it's own module because I found myself copying and pasting it way too often for various needs. Most of the uses I have for C3 revolve around class building and metamodels, but it co...

Algorithm::AdaBoost - AdaBoost learning algorithm

1 ++

1 ++

AdaBoost is a machine learning algorithm proposed by Freund and Schapire. Using an arbitrary binary classification algorithm, The algorithm can construct a more accurate classifier (i.e. it is a meta-algorithm)....

Algorithm::SkipList - Perl implementation of skip lists

++

++

This is an implementation of *skip lists* in Perl. Skip lists are similar to linked lists, except that they have random links at various *levels* that allow searches to skip over sections of the list, like so: 4 +---------------------------> +-------...

IDS::Algorithm::MM - Learn or test using a first-order Markov Model (MM).

1 ++

1 ++

Someday more will be here. Ideally, we would be using the algorithm from stolcke94bestfirst. Constructing a DFA rather than a NFA in effect has performed most of the state merging that stolcke93hidden do. Consider also a java or C/C++ implementaion: ...

Algorithm::LibLinear - A Perl binding for LIBLINEAR, a library for classification/regression using linear SVM and logistic regression.

5 ++

5 ++

Algorithm::LibLinear is an XS module that provides features of LIBLINEAR, a fast C library for classification and regression. Current version is based on LIBLINEAR 2.44, released on March 17, 2022....

Algorithm::BloomFilter - A simple bloom filter data structure

2 ++

2 ++

This module implements a simple bloom filter in C/XS....

Algorithm::HyperLogLog - Implementation of the HyperLogLog cardinality estimation algorithm

1 ++

1 ++

This module is implementation of the HyperLogLog algorithm. HyperLogLog is an algorithm for estimating the cardinality of a set....

Algorithm::Networksort - Create Sorting Networks.

1 ++

1 ++

This module will create sorting networks, a sequence of comparisons that do not depend upon the results of prior comparisons. Since the sequences and their order never change, they can be very useful if deployed in hardware, or if used in software wi...

Algorithm::LineSegments - Piecewise linear function approximation

++

++

This module takes discrete data points like time series data and computes a piecewise linear function, line segments, approximating them. It does this by merging groups of adjacent points into lines, always picking the pair that produces the smallest...

Algorithm::VectorClocks - Generating a partial ordering of events in a distributed system

++

++

Description, shamelessly stolen from Wikipedia: Vector Clocks is an algorithm for generating a partial ordering of events in a distributed system. Just as in Lamport timestamps, interprocess messages contain the state of the sending process's logical...

Algorithm::KernelKMeans - Weighted kernel k-means clusterer

++

++

"Algorithm::KernelKMeans" provides weighted kernel k-means vector clusterer. Note that this is a very early release. All APIs may be changed incompatibly. IMPLEMENTATION This class is just a placeholder. Implementation code is in other class and this...

Algorithm::Functional::BFS - A functional approach to the breadth-first search algorithm.

++

++

Algorithm::KernelKMeans::PP

++

++

This class is a pure-Perl implementation of weighted kernel k-means algorithm. Algorithm::KernelKMeans inherits this class by default....

Algorithm::Numerical::Sample - Draw samples from a set

++

++

This package gives two methods to draw fair, random samples from a set. There is a procedural interface for the case the entire set is known, and an object oriented interface when the a set with unknown size has to be processed. A: "sample (set => AR...

Algorithm::Numerical::Shuffle - Shuffle a list.

++

++

"shuffle" performs a one pass, fair shuffle on a list. If the list is passed as a reference to an array, the shuffle is done in situ. The subroutine returns the list in list context, and a reference to the list in scalar context....

Algorithm::Graphs::TransitiveClosure - Calculate the transitive closure.

++

++

This is an implementation of the well known *Floyd-Warshall* algorithm. [1,2] The subroutine "floyd_warshall" takes a directed graph, and calculates its transitive closure, which will be returned. The given graph is actually modified, so be sure to p...

Algorithm::LinearManifoldDataClusterer - for clustering data that resides on a low-dimensional manifold in a high-dimensional measurement space

++

++

If you are new to machine learning and data clustering on linear and nonlinear manifolds, your first question is likely to be: What is a manifold? A manifold is a space that is locally Euclidean. And a space is locally Euclidean if it allows for the ...