Show simple item record

Files in this item

Item metadata

dc.contributor.authorPham, Duc-Son
dc.contributor.authorArandjelovic, Ognjen
dc.contributor.authorVenkatesh, Svetha
dc.date.accessioned2016-11-21T13:30:12Z
dc.date.available2016-11-21T13:30:12Z
dc.date.issued2016-10-31
dc.identifier.citationPham , D-S , Arandjelovic , O & Venkatesh , S 2016 , Achieving stable subspace clustering by post-processing generic clustering results . in 2016 International Joint Conference on Neural Networks (IJCNN) . vol. 2016-October , 7727496 , IEEE , pp. 2390-2396 , IEEE World Congress on Computational Intelligence , Vancouver , Canada , 24/07/16 . https://doi.org/10.1109/IJCNN.2016.7727496en
dc.identifier.citationconferenceen
dc.identifier.isbn9781509006205
dc.identifier.isbn9781509006199
dc.identifier.otherPURE: 247649789
dc.identifier.otherPURE UUID: 6a1a5b8b-19f6-4f3a-b3de-55f9ca21f209
dc.identifier.otherArXiv: http://arxiv.org/abs/1605.08680v1
dc.identifier.otherScopus: 85007194225
dc.identifier.urihttp://hdl.handle.net/10023/9859
dc.identifier.urihttp://www.scopus.com/inward/record.url?scp=85007194225&partnerID=8YFLogxKen
dc.description.abstractWe propose an effective subspace selection scheme as a post-processing step to improve results obtained by sparse subspace clustering (SSC). Our method starts by the computation of stable subspaces using a novel random sampling scheme. Thus constructed preliminary subspaces are used to identify the initially incorrectly clustered data points and then to reassign them to more suitable clusters based on their goodness-of-fit to the preliminary model. To improve the robustness of the algorithm, we use a dominant nearest subspace classification scheme that controls the level of sensitivity against reassignment. We demonstrate that our algorithm is convergent and superior to the direct application of a generic alternative such as principal component analysis. On several popular datasets for motion segmentation and face clustering pervasively used in the sparse subspace clustering literature the proposed method is shown to reduce greatly the incidence of clustering errors while introducing negligible disturbance to the data points already correctly clustered.en
dc.format.extent7en
dc.language.isoeng
dc.publisherIEEE
dc.relation.ispartof2016 International Joint Conference on Neural Networks (IJCNN)en
dc.rights© 2016, IEEE. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at ieeexplore.ieee.org / http://dx.doi.org/10.1109/IJCNN.2016.7727496en
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectSoftwareen
dc.subjectArtificial Intelligenceen
dc.subjectNDASen
dc.subject.lccQA75en
dc.titleAchieving stable subspace clustering by post-processing generic clustering resultsen
dc.typeConference itemen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.1109/IJCNN.2016.7727496


The following license files are associated with this item:

This item appears in the following Collection(s)

Show simple item record