Clustering based on principal curve


Dateien zu dieser Ressource

Prüfsumme: MD5:fed7537932b445ac2b6cd65d177902df

CLEJU, Ioan, Pasi FRÄNTI, Xiaolin WU, 2005. Clustering based on principal curve. In: KALVIAINEN, Heikki, ed., Jussi PARKKINEN, ed., Arto KAARNA, ed.. Image Analysis. Berlin, Heidelberg:Springer Berlin Heidelberg, pp. 872-881. ISBN 978-3-540-26320-3. Available under: doi: 10.1007/11499145_88

@inproceedings{Cleju2005Clust-23030, title={Clustering based on principal curve}, year={2005}, doi={10.1007/11499145_88}, number={3540}, isbn={978-3-540-26320-3}, address={Berlin, Heidelberg}, publisher={Springer Berlin Heidelberg}, series={Lecture Notes in Computer Science}, booktitle={Image Analysis}, pages={872--881}, editor={Kalviainen, Heikki and Parkkinen, Jussi and Kaarna, Arto}, author={Cleju, Ioan and Fränti, Pasi and Wu, Xiaolin} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:creator>Fränti, Pasi</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:hasPart rdf:resource=""/> <dcterms:bibliographicCitation>Image Analysis : 14th Scandinavian Conference, SCIA, 2005, Joensuu, Finland, June 19 - 22, 2005; proceedings / Heikki Kalviainen ... (eds.). - Berlin [u.a.] : Springer, 2005. - S. 872-881. - (Lecture notes in computer science ; 3540). - ISBN 978-3-540-26320-3</dcterms:bibliographicCitation> <dc:language>eng</dc:language> <dcterms:rights rdf:resource=""/> <dcterms:isPartOf rdf:resource=""/> <dcterms:title>Clustering based on principal curve</dcterms:title> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Cleju, Ioan</dc:creator> <dc:contributor>Fränti, Pasi</dc:contributor> <dcterms:issued>2005</dcterms:issued> <dcterms:abstract xml:lang="eng">Clustering algorithms are intensively used in the image analysis field in compression, segmentation, recognition and other tasks. In this work we present a new approach in clustering vector datasets by finding a good order in the set, and then applying an optimal segmentation algorithm. The algorithm heuristically prolongs the optimal scalar quantization technique to vector space. The data set is sequenced using one-dimensional projection spaces. We Show that the principal axis is too rigid to preserve the adjacency of the points. We present a way to refine the order using the minimum weight Hamiltonian path in the data graph. Next we propose to use the principal curve to better model the non-linearity of the data and find a good sequence in the data. The experimental results show that the principal curve based clustering method can be successfully used in cluster analysis.</dcterms:abstract> <bibo:uri rdf:resource=""/> <dcterms:available rdf:datatype="">2013-06-10T09:08:32Z</dcterms:available> <dc:creator>Wu, Xiaolin</dc:creator> <dc:date rdf:datatype="">2013-06-10T09:08:32Z</dc:date> <dc:contributor>Wu, Xiaolin</dc:contributor> <dc:rights>terms-of-use</dc:rights> <dspace:hasBitstream rdf:resource=""/> <dc:contributor>Cleju, Ioan</dc:contributor> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Cleju_230303.pdf 70

Das Dokument erscheint in:

KOPS Suche


Mein Benutzerkonto