Fuzzy clustering in parallel universes

Wiswedel, Bernd; Berthold, Michael R.

Fuzzy clustering in parallel universes

Dateien

WiBe07_fcum_ijar.pdfGröße: 393.19 KBDownloads: 396

Datum

2007

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Zeitschriftenartikel

Publikationsstatus

Published

Erschienen in

International Journal of Approximate Reasoning. 2007, 45, pp. 439-454. Available under: doi: 10.1016/j.ijar.2006.06.020

Zusammenfassung

We present an extension of the fuzzy c-Means algorithm, which operates simultaneously on different feature spaces so-called parallel universes and also incorporates noise detection. The method assigns membership values of patterns to different universes, which are then adopted throughout the training. This leads to better clustering results since patterns not contributing to clustering in a universe are (completely or partially) ignored. The method also uses an auxiliary universe to capture patterns that do not contribute to any of the clusters in the real universes and therefore are likely to represent noise. The outcome of the algorithm is clusters distributed over different parallel universes, each modeling a particular, potentially overlapping subset of the data and a set of patterns detected as noise. One potential target application of the proposed method is biological data analysis where different descriptors for molecules are available but none of them by itself shows global satisfactory prediction results.

Fachgebiet (DDC)

004 Informatik

Schlagwörter

Fuzzy clustering, Objective function, Noise handling, Multiple descriptor spaces, Parallel universes

Zitieren

ISO 690

WISWEDEL, Bernd, Michael R. BERTHOLD, 2007. Fuzzy clustering in parallel universes. In: International Journal of Approximate Reasoning. 2007, 45, pp. 439-454. Available under: doi: 10.1016/j.ijar.2006.06.020

BibTex

@article{Wiswedel2007Fuzzy-5467,
  year={2007},
  doi={10.1016/j.ijar.2006.06.020},
  title={Fuzzy clustering in parallel universes},
  volume={45},
  journal={International Journal of Approximate Reasoning},
  pages={439--454},
  author={Wiswedel, Bernd 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/5467">
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5467/1/WiBe07_fcum_ijar.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:format>application/pdf</dc:format>
    <dc:creator>Berthold, Michael R.</dc:creator>
    <dc:contributor>Wiswedel, Bernd</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Wiswedel, Bernd</dc:creator>
    <dcterms:bibliographicCitation>First publ. in: International Journal of Approximate Reasoning 45 (2007), pp. 439-454</dcterms:bibliographicCitation>
    <dc:language>eng</dc:language>
    <dcterms:title>Fuzzy clustering in parallel universes</dcterms:title>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:38Z</dc:date>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5467/1/WiBe07_fcum_ijar.pdf"/>
    <dcterms:abstract xml:lang="eng">We present an extension of the fuzzy c-Means algorithm, which operates simultaneously on different feature spaces   so-called parallel universes   and also incorporates noise detection. The method assigns membership values of patterns  to different universes, which are then adopted throughout the training. This leads to better clustering results since patterns not contributing to clustering in a universe are (completely or partially) ignored. The method also uses an auxiliary universe to capture patterns that do not contribute to any of the clusters in the real universes and therefore are likely to represent noise. The outcome of the algorithm is clusters distributed over different parallel universes, each modeling a particular, potentially overlapping subset of the data and a set of patterns detected as noise. One potential target application of the proposed method is biological data analysis where different descriptors for molecules are available but none of them by itself shows global satisfactory prediction results.</dcterms:abstract>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Berthold, Michael R.</dc:contributor>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5467"/>
    <dcterms:issued>2007</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:38Z</dcterms:available>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Ja