• DocumentCode
    324537
  • Title

    Learning Boolean functions without training

  • Author

    Luk, P.C.K. ; Neville, R.S.

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Hertfordshire Univ., Hatfield, UK
  • Volume
    2
  • fYear
    1998
  • fDate
    4-9 May 1998
  • Firstpage
    1095
  • Abstract
    This paper presents a new theory that enables one to obtain a set of Boolean functions from one learnt Boolean function. We do this by transposition of the weight matrices of the unit or network once they have learnt a single Boolean function. The methodology we utilise has its root in mathematics and in particular the field of matrix geometric transformations. Here, a transformation of a surface, a plane or a function is a manipulation of the function in such a manner that each point of the transposed function (or `image´) corresponds uniquely to a point in the original function. We develop the theory that enables us to learn Boolean functions without training
  • Keywords
    Boolean functions; geometry; learning (artificial intelligence); matrix algebra; neural nets; transforms; Boolean function learning; matrix geometric transformations; neural nets; weight matrix transposition; Boolean functions; Hamming distance; Input variables; Lattices; Logic functions; Mathematics; Random access memory; Read-write memory; Sampling methods; Visualization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks Proceedings, 1998. IEEE World Congress on Computational Intelligence. The 1998 IEEE International Joint Conference on
  • Conference_Location
    Anchorage, AK
  • ISSN
    1098-7576
  • Print_ISBN
    0-7803-4859-1
  • Type

    conf

  • DOI
    10.1109/IJCNN.1998.685925
  • Filename
    685925