Options for multimodal classification based on L1-Tucker decomposition
Lists
Only you see this
Abstract
Most commonly used classification algorithms process data in the form of vectors. At the same time, mod- ern datasets often comprise multimodal measurements that are naturally modeled as multi-way arrays, also known as tensors. Processing multi-way data in their tensor form can enable enhanced inference and classification accuracy. Tucker decomposition is a standard method for tensor data processing, which however has demonstrated severe sensitivity to corrupted measurements due to its L2-norm formulation. In this work, we present a selection of classification methods that employ an L1-norm-based, corruption-resistant reformulation of Tucker (L1-Tucker). Our experimental studies on multiple real datasets corroborate the corruption-resistance and classification accuracy afforded by L1-Tucker.
BibTeX
@misc{chachlakis2023options,
author = {Dimitiris G. Chachlakis and Mayur Dhanaraj and Ashley Prater-Bennette and Panos P. Markopoulos},
title = {{Options for multimodal classification based on L1-Tucker decomposition}},
year = {2023},
url = {https://openreview.net/forum?id=29lgasda1vv},
howpublished = {OpenReview},
}Loading related content...