| Summary: | In this paper, the approach of utilizing the core tensor from the Tucker decomposition, in place of theuncompressed tensor, for nding a valid tensor rank for the PARAFAC decomposition is considered.Validity of the proposed method is investigated in terms of error and time consumption. As thesolutions of the PARAFAC decomposition are unique, stability of the solutions through split-halfanalysis is investigated. Simulated and real data are considered. Although, no general validity ofthe method could be observed, the results for some datasets look promising with 10% compressionin all modes. It is also shown that increased compression does not necessarily imply less timeconsumption.
|
|---|
