Solving sparse non-negative tensor equations: algorithms and applications (Q2355654): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11464-014-0377-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968373943 / rank | |||
Normal rank | |||
Revision as of 19:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving sparse non-negative tensor equations: algorithms and applications |
scientific article |
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
