On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank

Ganian, R, Kanj, I, Ordyniak, S orcid.org/0000-0003-1935-651X et al. (1 more author) (2020) On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank. In: AAAI-20 Technical Tracks 4. The Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI-20), 07-12 Feb 2020, New York, New York, USA. , pp. 3906-3913. ISBN 978-1-57735-835-0

Abstract

Metadata

Authors/Creators:
Dates:
  • Accepted: 11 November 2019
  • Published (online): 3 April 2020
  • Published: 16 June 2020
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRC (Engineering and Physical Sciences Research Council)EP/V00252X/1
Depositing User: Symplectic Publications
Date Deposited: 21 Jul 2021 11:06
Last Modified: 22 Jul 2021 07:50
Status: Published
Identification Number: https://doi.org/10.1609/aaai.v34i04.5804

Download not available

A full text copy of this item is not currently available from White Rose Research Online

Export

Statistics