Note on Optimal Selection of Independent Binary-Valued Features for Pattern Recognition

Godfried Toussaint

    Research output: Contribution to journalArticle

    Abstract

    Given a set of conditionally independent binary-valued features, a counter example is given to a possible claim that the best subset of features must contain the best single feature.

    Original languageEnglish (US)
    Number of pages1
    JournalIEEE Transactions on Information Theory
    Volume17
    Issue number5
    DOIs
    StatePublished - Jan 1 1971

    Fingerprint

    pattern recognition
    Pattern recognition

    ASJC Scopus subject areas

    • Information Systems
    • Computer Science Applications
    • Library and Information Sciences

    Cite this

    Note on Optimal Selection of Independent Binary-Valued Features for Pattern Recognition. / Toussaint, Godfried.

    In: IEEE Transactions on Information Theory, Vol. 17, No. 5, 01.01.1971.

    Research output: Contribution to journalArticle

    @article{63e41e0158e34102a3a6309b7f152dc3,
    title = "Note on Optimal Selection of Independent Binary-Valued Features for Pattern Recognition",
    abstract = "Given a set of conditionally independent binary-valued features, a counter example is given to a possible claim that the best subset of features must contain the best single feature.",
    author = "Godfried Toussaint",
    year = "1971",
    month = "1",
    day = "1",
    doi = "10.1109/TIT.1971.1054685",
    language = "English (US)",
    volume = "17",
    journal = "IEEE Transactions on Information Theory",
    issn = "0018-9448",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "5",

    }

    TY - JOUR

    T1 - Note on Optimal Selection of Independent Binary-Valued Features for Pattern Recognition

    AU - Toussaint, Godfried

    PY - 1971/1/1

    Y1 - 1971/1/1

    N2 - Given a set of conditionally independent binary-valued features, a counter example is given to a possible claim that the best subset of features must contain the best single feature.

    AB - Given a set of conditionally independent binary-valued features, a counter example is given to a possible claim that the best subset of features must contain the best single feature.

    UR - http://www.scopus.com/inward/record.url?scp=0001172625&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0001172625&partnerID=8YFLogxK

    U2 - 10.1109/TIT.1971.1054685

    DO - 10.1109/TIT.1971.1054685

    M3 - Article

    VL - 17

    JO - IEEE Transactions on Information Theory

    JF - IEEE Transactions on Information Theory

    SN - 0018-9448

    IS - 5

    ER -