Solving sparse non-negative tensor equations: algorithms and applications (Q2355654)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6463957
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving sparse non-negative tensor equations: algorithms and applications |
scientific article; zbMATH DE number 6463957 |
Statements
Solving sparse non-negative tensor equations: algorithms and applications (English)
0 references
24 July 2015
0 references
The authors adapt the classical Jacobi and Gauss-Seidel methods for solving tensor equations arising from data mining applications. They prove linear convergence of the tensor-type methods and present numerical experiments on problems coming from information retrieval by query search and community discovery in multi-dimensional networks.
0 references
nonnegative tensor
0 references
multidimensional network
0 references
information retrieval
0 references
iterative method
0 references
multivariate polynomial equation
0 references
Jacobi method
0 references
Gauss-Seidel method
0 references
linear convergence
0 references
numerical experiment
0 references
query search
0 references
community discovery
0 references
0 references
0.7804023027420044
0 references
0.7784778475761414
0 references
0.7765095233917236
0 references
0.7736528515815735
0 references
0.7618375420570374
0 references
