Publikation:

Subsampling Conflicts to Construct Better Fuzzy Rules

Lade...
Vorschaubild

Dateien

Datum

2001

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

DOI (zitierfähiger Link)
ArXiv-ID

Internationale Patentnummer

Angaben zur Forschungsförderung

Projekt

Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

Joint 9th IFSA World congress and 20th NAFIPS internat. conf., Vancouver, British Columbia, Canada, July 25 - 28, 2001. 2001, pp. 1098-1103

Zusammenfassung

Many fuzzy rule induction algorithms have been proposed during the past decade or so. Most of these algorithms tend to scale badly with large dimensions of the feature space because the underlying heuristics tend to constrain suboptimal features. Often noisy training instances also influence the size of the resulting rule set. In this paper an algorithm is discussed that extracts a set of so called mixed fuzzy rules. These rules can be extracted from feature spaces with diverse types of attributes and handle the corresponding different types of constraints in parallel. The underlying heuristic minimizes the loss of coverage for each rule when a conflict occurs. We present the original algorithm, which voids conflicts for each pattern individually and demonstrate how a subsampling trategy improves the resulting rule set, both with respect to performance and nterpretability of the resulting rules.

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

9th IFSA and 20th NAFIPS, 25. Juli 2001 - 28. Juli 2001, Vancouver, British Columbia, Canada
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690BERTHOLD, Michael R., 2001. Subsampling Conflicts to Construct Better Fuzzy Rules. 9th IFSA and 20th NAFIPS. Vancouver, British Columbia, Canada, 25. Juli 2001 - 28. Juli 2001. In: Joint 9th IFSA World congress and 20th NAFIPS internat. conf., Vancouver, British Columbia, Canada, July 25 - 28, 2001. 2001, pp. 1098-1103
BibTex
@inproceedings{Berthold2001Subsa-5432,
  year={2001},
  title={Subsampling Conflicts to Construct Better Fuzzy Rules},
  booktitle={Joint 9th IFSA World congress and 20th NAFIPS internat. conf., Vancouver, British Columbia, Canada, July 25 - 28, 2001},
  pages={1098--1103},
  author={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/5432">
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:20Z</dc:date>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:format>application/pdf</dc:format>
    <dcterms:abstract xml:lang="eng">Many fuzzy rule induction algorithms have been proposed during the past decade or so. Most of these algorithms tend to scale badly with large dimensions of the feature space because the underlying heuristics tend to constrain suboptimal features. Often noisy training instances also influence the size of the resulting rule set. In this paper an algorithm is discussed that extracts a set of so called mixed fuzzy rules. These rules can be extracted from feature spaces with diverse types of attributes and handle the corresponding different types of constraints in parallel. The underlying heuristic minimizes the loss of coverage for each rule when a conflict occurs. We present the original algorithm, which voids conflicts for each pattern individually and demonstrate how a subsampling trategy improves the resulting rule set, both with respect to performance and nterpretability of the resulting rules.</dcterms:abstract>
    <dc:language>eng</dc:language>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by-nc-nd/2.0/"/>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5432"/>
    <dc:creator>Berthold, Michael R.</dc:creator>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5432/1/Subsampling_Conflicts_to_Construct_Better_Fuzzy_Rules.pdf"/>
    <dcterms:issued>2001</dcterms:issued>
    <dc:rights>Attribution-NonCommercial-NoDerivs 2.0 Generic</dc:rights>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T15:55:20Z</dcterms:available>
    <dcterms:bibliographicCitation>First publ. in: Joint 9th IFSA World congress and 20th NAFIPS internat. conf., Vancouver, British Columbia, Canada, July 25 - 28, 2001, pp. 1098-1103</dcterms:bibliographicCitation>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/5432/1/Subsampling_Conflicts_to_Construct_Better_Fuzzy_Rules.pdf"/>
    <dc:contributor>Berthold, Michael R.</dc:contributor>
    <dcterms:title>Subsampling Conflicts to Construct Better Fuzzy Rules</dcterms:title>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Nein
Begutachtet
Diese Publikation teilen