Algorithms.md

ALGORITHMS and Data Structures : Data Mining, Clustering, ...

• ALGORITHMS
  • Association Rule
  • Checksum
  • Collaborative Filtering
  • Graph Algorithms
  • Pattern Matching
  • Quantum
  • Scheduling Algorithm
  • Sorting
  • Time
• COMPUTATIONAL PROBLEMS
  • NP-complete
    • SAT

---

ALGORITHMS

• DataStructures.jl :: This package implements a variety of data structures, viz. Deque, CircularBuffer, CircularDeque, Stack, Queue, Accumulators and Counters (i.e. Multisets / Bags), Disjoint Sets, Binary Heap, Mutable Binary Heap, Ordered Dicts and Sets, Dictionaries with Defaults, Trie, Linked List and Mutable Linked List, Sorted Dict, Sorted Multi-Dict and Sorted Set, DataStructures.IntSet, Priority Queue, Fenwick Tree

Association Rule

• ARules.jl :: Julia package for Association Rule Learning algorithms.

Checksum

• CRC.jl :: This is a Julia module for calculating Cyclic Redundancy Checksums (CRCs).
• CRC32.jl :: 32-bit cyclic redundancy check (CRC-32) checksum implementation.

Collaborative Filtering

• RecSys.jl :: An implementation of the algorithm from Yunhong Zhou, Dennis Wilkinson, Robert Schreiber and Rong Pan. Large-Scale Parallel Collaborative Filtering for the Netflix Prize. Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management. Shanghai, China pp. 337-348, 2008.

Graph Algorithms

• aleph_star :: Reinforcement learning with A* and a deep heuristic.

Pattern Matching

• AhoCorasick.jl :: Julia implementation of the Aho-Corasick algorithm for fast string searching.
• association_rules_jl :: This package implements algorithms for association rule mining and sequential pattern mining, viz., the Apriori algorithm (Agrawal & Srikant, 1994) and the SPADE algorithm (Zaki, 2001). The former is used for association rule mining (e.g., "market basket" analysis), and the latter is used for identifying sequential patterns when the data possess a temporal ordering.
• BlossomV.jl :: An interface for the Blossom V perfect matching algorithm.
• JellyFish.jl :: Port of the jellyfish string comparison library.
• Loess.jl :: is a loess implementation based on the fast kd-tree based approximation algorithm, a space-partitioning data structure for organizing points in a k-dimensional space.
• Match.jl :: Advanced Pattern Matching for Julia.
  • DOCS :: https://matchjl.readthedocs.org/en/latest/
• NearestNeighbors.jl :: Data structures for nearest neighbor search.
• ReverseRegexes.jl :: Adds functionality to reverse-search strings with regexes

Quantum

• AdiaRoll.jl :: An Adiabatic Computation Simulator for quantum computation.
• Hadamard.jl :: Fast multidimensional Walsh-Hadamard transforms.

Scheduling Algorithm

• HClust.jl :: Hierarchical Clustering for Julia, similar to R's hclust().

Sorting

• NaturalSort.jl :: Natural sort order.
• SearchSortAlgos.jl :: An API for common search and sort algorithms.
• SortingAlgorithms.jl :: extra sorting algorithms extending Julia's sorting API.
• SortingLab.jl :: Experimental implementations of sorting algorithms.

Time

• LabelPropagation.jl :: A fast, nearly linear time algorithm for detecting communtiy structure in networks.

RESOURCES

• algo-book-julia :: Snippets from Problem Solving with Algorithms and Data Structures in Julia.
• study :: A study of interesting algorithms.

---

COMPUTATIONAL PROBLEMS

NP-complete

• TravelingSalesmanHeuristics.jl :: Julia package for simple traveling salesman problem heuristics.

SAT

• dReal.jl :: Nonlinear SMT solving using dReal.
• PicoSAT.jl :: Provides Julia bindings to the popular SAT solver picosat by Armin Biere. It is based off the Python pycosat and Go pigosat bindings written by Ilan Schnell and Willam Schwartz.
• Z3.jl :: This is a Julia interface to Z3 - a high performance theorem prover developed at Microsoft Research. Z3 can solve satisfiability modulo theory (SMT) problems.