Publikation: Finding clusters in parallel universes
Lade...
Dateien
Datum
2001
Autor:innen
Patterson, David
Berthold, Michael R.
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published
Erschienen in
2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236). IEEE, 2001, pp. 123-128. ISBN 0-7803-7087-2. Available under: doi: 10.1109/ICSMC.2001.969799
Zusammenfassung
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.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Clustering, multiple feature space, neighborgrams
Konferenz
IEEE International Conference on Systems, Man & Cybernetics, Tucson, AZ, USA
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
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, 2001, pp. 123-128. ISBN 0-7803-7087-2. Available under: doi: 10.1109/ICSMC.2001.969799BibTex
@inproceedings{Patterson2001Findi-5495, year={2001}, doi={10.1109/ICSMC.2001.969799}, title={Finding clusters in parallel universes}, 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:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/5495"> <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> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:51Z</dcterms:available> <dc:creator>Patterson, David</dc:creator> <dc:language>eng</dc:language> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5495/1/Finding_clusters_in_parallel_universes.pdf"/> <dc:contributor>Berthold, Michael R.</dc:contributor> <dcterms:issued>2001</dcterms:issued> <dc:format>application/pdf</dc:format> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:51Z</dc:date> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5495/1/Finding_clusters_in_parallel_universes.pdf"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5495"/> <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/> <dc:contributor>Patterson, David</dc:contributor> <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> <dcterms:title>Finding clusters in parallel universes</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Berthold, Michael R.</dc:creator> <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights> </rdf:Description> </rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein