A semi-supervised sparse K-Means algorithm

Vouros, A. orcid.org/0000-0002-3383-6133 and Vasilaki, E. orcid.org/0000-0003-3705-7070 (2021) A semi-supervised sparse K-Means algorithm. Pattern Recognition Letters, 142. pp. 65-71. ISSN 0167-8655

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2020 Elsevier. This is an author produced version of a paper subsequently published in Pattern Recognition Letters. Uploaded in accordance with the publisher's self-archiving policy. Article available under the terms of the CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/).
Keywords: Semi-supervised clusterings; parse clustering; feature selection
Dates:
  • Accepted: 29 November 2020
  • Published (online): 10 December 2020
  • Published: February 2021
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 04 Mar 2021 08:30
Last Modified: 22 Mar 2021 11:37
Status: Published
Publisher: Elsevier BV
Refereed: Yes
Identification Number: https://doi.org/10.1016/j.patrec.2020.11.015
Related URLs:

Download

Accepted Version


Embargoed until: 10 December 2021

Filename: 2003.06973v5.pdf

Licence: CC-BY-NC-ND 4.0

Request a copy

file not available

Share / Export

Statistics