LibreTimes

Search results for “модели внимания”

53 results

Алгебра 1, Листок 1

2026Problem sheetAlexey Ilyin

Задачные листки к курсам алгебры. Институт и учебное заведение в исходных публикациях не указаны, поэтому здесь не названы.
0
180

Algebra 1. Lecture 2

2026LectureАртём Авилов

The order of an element and of a group, the order of a permutation as the lcm of its cycle lengths; generators and cyclic groups; homomorphisms and isomorphisms of groups, the classification of cyclic groups; examples — the sign of a permutation, inversion in an abelian group, the exponential, the determinant, S3S_3 and D3D_3; subgroups, kernel and image, the injectivity criterion; left and right cosets and the partition into them; normal subgroups and conjugation, the index, Lagrange's theorem, subgroups of index 2; the quotient group; the homomorphism theorem with examples; conjugate elements, the centre, a group action on a set.

0
150

Vector calculus. Line integrals of the first kind

2026Problem sheetSergey

Integration with respect to arc length: parametrising a curve, the length element ds=∣r′(t)∣ dtds = |\mathbf{r}'(t)|\,dt, arc length, curves in polar coordinates, the mass and centre of mass of a wire, symmetry instead of computation.

0
530

Vector calculus. Stokes' theorem. Circulation

2026Problem sheetSergey

Circulation of a field as the flux of its curl: computing the curl, matching the orientation of the contour and the normal, circulation computed two ways.
0
310

Machine Learning 2. Lecture 8. Association Rule Mining

2026LectureКонстантин Вячеславович Воронцов

Association rule mining as unsupervised learning: binary features, support and frequent itemsets, the association rule, minimum support MinSupp and minimum confidence MinConf; market basket analysis; the link between association rules and logical regularities; the anti-monotonicity of support; the APriori algorithm: breadth-first search for frequent itemsets and recursive extraction of rules; modifications: search on a random subsample, item hierarchies, incremental and decremental algorithms; the FP-growth algorithm: the prefix FP-tree, building it in one pass over the transaction database, computing the support of any itemset from the tree, the conditional FP-tree and recursive search for frequent itemsets; the speed of FP-growth compared with APriori.
0
160