A Variant of Adaptive Mean Shift-Based Clustering

ResearchSpace/Manakin Repository

Show simple item record

dc.contributor.author Li, Fajie en
dc.contributor.author Klette, Reinhard en
dc.date.accessioned 2008-12-16T00:44:26Z en
dc.date.available 2008-12-16T00:44:26Z en
dc.date.issued 2008 en
dc.identifier.citation ICONIP 2008 - 15th International Conference on Neural Information Processing of the Asia-Pacific Neural Network Assembly - Poster Session 5 - (128), (2008) en
dc.identifier.uri http://hdl.handle.net/2292/3274 en
dc.description Conference Details: ICONIP 2008 - 15th International Conference on Neural Information. Processing of the Asia-Pacific Neural Network Assembly November 25-28, 2008, Auckland, New Zealand en
dc.description.abstract We are interested in clustering sets of highly overlapping clusters. For example, given is an observed set of stars (considered to be a set of points); how to find (recover) clusters which are the contributing galaxies of the observed union of those clusters? Below we propose a modification of an adaptive mean shift-based clustering algorithm (called Algorithm 1) proposed in 2003 by B. Geogescu, I. Shimsoni and P. Meer en
dc.relation.ispartofseries ICONIP 2008 - 15th International Conference on Neural Information en
dc.rights Copyright Li & Klette. Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.title A Variant of Adaptive Mean Shift-Based Clustering en
dc.type Conference Poster en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder Copyright: the author en


Full text options

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Advanced Search

Browse