Efficient implementation of some contextual classification methods (Q1965995)
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 1409706
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient implementation of some contextual classification methods |
scientific article; zbMATH DE number 1409706 |
Statements
Efficient implementation of some contextual classification methods (English)
0 references
2 March 2000
0 references
The authors describe how a special form of the Cholesky factorization of the Kronecker product \(A\otimes \Sigma\) of two symmetric and positive definite matrices \(A\) and \(\Sigma\) can be used to efficiently compute \(x^T \left(A\otimes\Sigma\right)^{-1}x.\) The method is then used to develop an efficient algorithm to implement contextual classification models. An algorithm for their implementation is presented. The efficiency of this algorithm is analysed.
0 references
Cholesky factorization
0 references
autocorrelation
0 references
spatial dependence
0 references
contextual classification models
0 references
0.709002673625946
0 references
0.680935800075531
0 references
0.6573137640953064
0 references
