Cluster analysis is an unsupervised learning technique used for classification of data. Data elements are partitioned into groups called clusters that represent proximate ...

For minimization problems for which the objective function is a sum of squares, it is often advantageous to use the special structure of the problem. Time and effort can be ...

NProbability[pred, x \[Distributed] dist] gives the numerical probability for an event that satisfies the predicate pred under the assumption that x follows the probability ...

Numerical algorithms for constrained nonlinear optimization can be broadly categorized into gradient-based methods and direct search methods. Gradient search methods use ...

Some integer functions. The remainder on dividing 17 by 3. The integer part of 17/3.

PoincareSection is a setting for the option TrekGenerator that specifies that the Poincaré section for differential equations is used to generate treks.

SparseArray[{pos_1 -> val_1, pos_2 -> val_2, ...}] yields a sparse array in which values val_i appear at positions pos_i. SparseArray[{pos_1, pos_2, ...} -> {val_1, val_2, ...

In some cases it is useful to split the differential system into subsystems and solve each subsystem using appropriate integration methods. Recombining the individual ...

One of the most important issues for using a database is the conversion of data as it is stored and retrieved from a database. This tutorial will discuss how Mathematica ...

GraphData[name] gives a graph with the specified name.GraphData[name, " property"] gives the value for the specified property for a named graph.GraphData["class"] gives a ...