Search results for "Pivot"
showing 3 items of 23 documents
Improved pairwise comparison transitivity using strategically selected reduced information
2021
To judge the mutual relationship among elements, pairwise comparisons (PC) are widely used in decision modelling. PC is especially useful when the involved elements are intangible. Frequently, the number of elements to be compared may be very large. When dealing with n elements, the number of PCs is, under the reciprocity hypothesis, n(n − 1)/2. PCs are compiled in so-called pairwise comparison matrices (PCM). In the presence of missing entries due to uncertainty or lack of information, decision-making must be performed from the available incomplete information. Making all the comparisons in the complete case may be tedious, strenuous and time-consuming for the actors, may blur the body of …
Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm
2019
Tensor decomposition is a powerful tool for analyzing multiway data. Nowadays, with the fast development of multisensor technology, more and more data appear in higherorder (order > 4) and nonnegative form. However, the decomposition of higher-order nonnegative tensor suffers from poor convergence and low speed. In this study, we propose a new nonnegative CANDECOM/PARAFAC (NCP) model using proximal algorithm. The block principal pivoting method in alternating nonnegative least squares (ANLS) framework is employed to minimize the objective function. Our method can guarantee the convergence and accelerate the computation. The results of experiments on both synthetic and real data demonstrate …