Search Results for "example" - Page 4

Spark Python Notebooks is a curated collection of example Jupyter notebooks designed to help developers and data engineers learn Apache Spark using Python in an interactive environment. Rather than only providing static code files, this project uses notebooks to teach practical data processing workflows, exposing users to real Spark programming patterns like working with RDDs, DataFrames, and distributed computations.

...The approach treats each concept (e.g. a character) as being generated by a probabilistic program (motor primitives, strokes, spatial relationships), and inference proceeds by fitting those generative programs to a single example, generalizing to new examples, and generating new exemplars. The repository contains code for parsing stroke sequences, fitting motor programs, exemplar generation, classification, re-fitting, and demonstration scripts.

...It provides implementations of feedforward neural networks, convolutional neural networks (CNNs), deep belief networks (DBNs), stacked autoencoders, convolutional autoencoders, and more. The toolbox includes example scripts for each method, enabling users to quickly experiment with architectures, training, and inference workflows. Although it's been flagged as deprecated and no longer actively maintained, it is still used for educational and prototyping purposes. Deep belief networks (DBN) and restricted Boltzmann machines (RBM). Example scripts demonstrating usage.

TreeLiker is a collection of fast algorithms for working with complex structured data in relational form. The data can, for example, describe large organic molecules such as proteins or groups of individuals such as social networks or predator-prey networks etc. The algorithms included in TreeLiker are unique in that, in principle, they are able to search given sets of relational patterns exhaustively, thus guaranteeing that if some good pattern capturing an important feature of the problem exists, it will be found. ...

...The catalog spans evolutionary algorithms, swarm intelligence, immune systems, simulated annealing, tabu search, and other metaheuristics, plus guidance on when and how to tune them. Example implementations and worked problems show how to encode solutions, define fitness, and balance exploration with exploitation. The emphasis is on pragmatism—enough theory to understand why an algorithm works, and enough detail to get it running in your environment. It’s a useful starting point for students and practitioners who want to prototype, benchmark, or hybridize algorithms without digging through scattered academic papers.

...For example, in machine with 64GB, CRF# encodes model with more than 4.5 hundred million features quickly.

Example of using Neural networks to implement chase between mouses and cats. Mouses search for cheese on map, while cats are chasing mouses. Goal of the project is to see will both sides learn some new behavior over time using genetic algorithms.

ANT is a lightweight implementation in C of a kind of artificial neural net called Multilayer Perceptron, which uses the backpropagation algorithm as learning method. The package includes an introductory example to start using artificial neural nets.