Finding clusters in parallel universes


Dateien zu dieser Ressource

Prüfsumme: MD5:5d0fd931b1d2901d1273f76b045ebff0

PATTERSON, David, Michael R. BERTHOLD, 2001. Finding clusters in parallel universes. IEEE International Conference on Systems, Man & Cybernetics. Tucson, AZ, USA. In: 2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236). IEEE, pp. 123-128. ISBN 0-7803-7087-2. Available under: doi: 10.1109/ICSMC.2001.969799

@inproceedings{Patterson2001Findi-5495, title={Finding clusters in parallel universes}, year={2001}, doi={10.1109/ICSMC.2001.969799}, isbn={0-7803-7087-2}, publisher={IEEE}, booktitle={2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236)}, pages={123--128}, author={Patterson, David and Berthold, Michael R.} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:title>Finding clusters in parallel universes</dcterms:title> <dspace:hasBitstream rdf:resource=""/> <dc:contributor>Berthold, Michael R.</dc:contributor> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:bibliographicCitation>First publ. in: E-systems and e-man for cybernetics in cyberspace (Vol. 1) : 2001 IEEE International Conference on Systems, Man, and Cybernetics, Tucson, Arizona, October 7 - 10, 2001. Piscataway, NJ : IEEE Service Center, 2001, pp. 123-128</dcterms:bibliographicCitation> <dspace:isPartOfCollection rdf:resource=""/> <dc:creator>Berthold, Michael R.</dc:creator> <dc:date rdf:datatype="">2011-03-24T15:55:51Z</dc:date> <dcterms:isPartOf rdf:resource=""/> <bibo:uri rdf:resource=""/> <dc:format>application/pdf</dc:format> <dcterms:rights rdf:resource=""/> <dc:rights>terms-of-use</dc:rights> <dcterms:issued>2001</dcterms:issued> <dc:contributor>Patterson, David</dc:contributor> <dc:creator>Patterson, David</dc:creator> <dc:language>eng</dc:language> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dcterms:available rdf:datatype="">2011-03-24T15:55:51Z</dcterms:available> <dcterms:hasPart rdf:resource=""/> <dcterms:abstract xml:lang="eng">Many clustering algorithms have been proposed in recent years. Most methods operate in an iterative manner and aim to optimize a specific energy function. We present an algorithm that directly finds a set of cluster centers based on an analysis of the distribution of patterns in the local neighborhood of each potential duster center through the use of so-called Neighborgrams. In addition this analysis can be carried out in several feature spaces in parallel, effectively finding the optimal set of features for each duster independently. We demonstrate how the algorithm works on an artificial data set and show its usefulness using a well-known benchmark data set.</dcterms:abstract> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

Finding_clusters_in_parallel_universes.pdf 49

Das Dokument erscheint in:

terms-of-use Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: terms-of-use

KOPS Suche


Mein Benutzerkonto