OR/AND neurons and the development of interpretable logic models

In this paper, we are concerned with the concept of fuzzy logic networks and logic-based data analysis realized within this framework. The networks under discussion are homogeneous architectures comprising of OR/AND neurons originally introduced by Hirota and Pedrycz. Being treated here as generic p...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on neural networks Vol. 17; no. 3; pp. 636 - 658
Main Authors: Pedrycz, W., Reformat, M., Li, K.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.05.2006
Institute of Electrical and Electronics Engineers
Subjects:
ISSN:1045-9227, 1941-0093
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this paper, we are concerned with the concept of fuzzy logic networks and logic-based data analysis realized within this framework. The networks under discussion are homogeneous architectures comprising of OR/AND neurons originally introduced by Hirota and Pedrycz. Being treated here as generic processing units, OR/AND neurons are neurofuzzy constructs that exhibit well-defined logic characteristics and are endowed with a high level of parametric flexibility and come with significant interpretation abilities. The composite logic nature of the logic neurons becomes instrumental in covering a broad spectrum of logic dependencies whose character spread in-between between those being captured by plain and and or logic descriptors (connectives). From the functional standpoint, the developed network realizes a logic approximation of multidimensional mappings between unit hypercubes, that is transformations from [0,1] n to [0,1] m . The way in which the structure of the network has been formed is highly modular and becomes reflective of a general concept of decomposition of logic expressions and Boolean functions (as being commonly encountered in two-valued logic). In essence, given a collection of input variables, selected is their subset and transformed into new composite variable, which in turn is used in the consecutive module of the network. These intermediate synthetic variables are the result of the successive problem (mapping) decomposition. The development of the network is realized through genetic optimization. This helps address important issues of structural optimization (where we are concerned with a selection of a subset of variables and their allocation within the network) and reaching a global minimum when carrying out an extensive parametric optimization (adjustments of the connections of the neurons). The paper offers a comprehensive and user-interactive design procedure including a simple pruning mechanism whose intention is to enhance the interpretability of the network while reducing its size. The experimental studies comprise of three parts. First, we demonstrate the performance of the network on Boolean data (that leads to some useful comparative observations considering a wealth of optimization tools available in two-valued logic and digital systems). Second, we discuss synthetic multivalued data that helps focus on the approximation abilities of the network. Finally, show the generation of logic expressions describing selected data sets coming from the machine learning repository
AbstractList In this paper, we are concerned with the concept of fuzzy logic networks and logic-based data analysis realized within this framework. The networks under discussion are homogeneous architectures comprising of OR/AND neurons originally introduced by Hirota and Pedrycz. Being treated here as generic processing units, OR/AND neurons are neurofuzzy constructs that exhibit well-defined logic characteristics and are endowed with a high level of parametric flexibility and come with significant interpretation abilities. The composite logic nature of the logic neurons becomes instrumental in covering a broad spectrum of logic dependencies whose character spread in-between between those being captured by plain and and or logic descriptors (connectives). From the functional standpoint, the developed network realizes a logic approximation of multidimensional mappings between unit hypercubes, that is transformations from [0, 1]n to [0, 1]m. The way in which the structure of the network has been formed is highly modular and becomes reflective of a general concept of decomposition of logic expressions and Boolean functions (as being commonly encountered in two-valued logic). In essence, given a collection of input variables, selected is their subset and transformed into new composite variable, which in turn is used in the consecutive module of the network. These intermediate synthetic variables are the result of the successive problem (mapping) decomposition. The development of the network is realized through genetic optimization. This helps address important issues of structural optimization (where we are concerned with a selection of a subset of variables and their allocation within the network) and reaching a global minimum when carrying out an extensive parametric optimization (adjustments of the connections of the neurons). The paper offers a comprehensive and user-interactive design procedure including a simple pruning mechanism whose intention is to enhance the interpretability of the network while reducing its size. The experimental studies comprise of three parts. First, we demonstrate the performance of the network on Boolean data (that leads to some useful comparative observations considering a wealth of optimization tools available in two-valued logic and digital systems). Second, we discuss synthetic multivalued data that helps focus on the approximation abilities of the network. Finally, show the generation of logic expressions describing selected data sets coming from the machine learning repository.In this paper, we are concerned with the concept of fuzzy logic networks and logic-based data analysis realized within this framework. The networks under discussion are homogeneous architectures comprising of OR/AND neurons originally introduced by Hirota and Pedrycz. Being treated here as generic processing units, OR/AND neurons are neurofuzzy constructs that exhibit well-defined logic characteristics and are endowed with a high level of parametric flexibility and come with significant interpretation abilities. The composite logic nature of the logic neurons becomes instrumental in covering a broad spectrum of logic dependencies whose character spread in-between between those being captured by plain and and or logic descriptors (connectives). From the functional standpoint, the developed network realizes a logic approximation of multidimensional mappings between unit hypercubes, that is transformations from [0, 1]n to [0, 1]m. The way in which the structure of the network has been formed is highly modular and becomes reflective of a general concept of decomposition of logic expressions and Boolean functions (as being commonly encountered in two-valued logic). In essence, given a collection of input variables, selected is their subset and transformed into new composite variable, which in turn is used in the consecutive module of the network. These intermediate synthetic variables are the result of the successive problem (mapping) decomposition. The development of the network is realized through genetic optimization. This helps address important issues of structural optimization (where we are concerned with a selection of a subset of variables and their allocation within the network) and reaching a global minimum when carrying out an extensive parametric optimization (adjustments of the connections of the neurons). The paper offers a comprehensive and user-interactive design procedure including a simple pruning mechanism whose intention is to enhance the interpretability of the network while reducing its size. The experimental studies comprise of three parts. First, we demonstrate the performance of the network on Boolean data (that leads to some useful comparative observations considering a wealth of optimization tools available in two-valued logic and digital systems). Second, we discuss synthetic multivalued data that helps focus on the approximation abilities of the network. Finally, show the generation of logic expressions describing selected data sets coming from the machine learning repository.
In this paper, we are concerned with the concept of fuzzy logic networks and logic-based data analysis realized within this framework. The networks under discussion are homogeneous architectures comprising of OR/AND neurons originally introduced by Hirota and Pedrycz. Being treated here as generic processing units, OR/AND neurons are neurofuzzy constructs that exhibit well-defined logic characteristics and are endowed with a high level of parametric flexibility and come with significant interpretation abilities. The composite logic nature of the logic neurons becomes instrumental in covering a broad spectrum of logic dependencies whose character spread in-between between those being captured by plain and and or logic descriptors (connectives). From the functional standpoint, the developed network realizes a logic approximation of multidimensional mappings between unit hypercubes, that is transformations from [0,1] n to [0,1] m . The way in which the structure of the network has been formed is highly modular and becomes reflective of a general concept of decomposition of logic expressions and Boolean functions (as being commonly encountered in two-valued logic). In essence, given a collection of input variables, selected is their subset and transformed into new composite variable, which in turn is used in the consecutive module of the network. These intermediate synthetic variables are the result of the successive problem (mapping) decomposition. The development of the network is realized through genetic optimization. This helps address important issues of structural optimization (where we are concerned with a selection of a subset of variables and their allocation within the network) and reaching a global minimum when carrying out an extensive parametric optimization (adjustments of the connections of the neurons). The paper offers a comprehensive and user-interactive design procedure including a simple pruning mechanism whose intention is to enhance the interpretability of the network while reducing its size. The experimental studies comprise of three parts. First, we demonstrate the performance of the network on Boolean data (that leads to some useful comparative observations considering a wealth of optimization tools available in two-valued logic and digital systems). Second, we discuss synthetic multivalued data that helps focus on the approximation abilities of the network. Finally, show the generation of logic expressions describing selected data sets coming from the machine learning repository
In this paper, we are concerned with the concept of fuzzy logic networks and logic-based data analysis realized within this framework. The networks under discussion are homogeneous architectures comprising of OR/AND neurons originally introduced by Hirota and Pedrycz. Being treated here as generic processing units, OR/AND neurons are neurofuzzy constructs that exhibit well-defined logic characteristics and are endowed with a high level of parametric flexibility and come with significant interpretation abilities. The composite logic nature of the logic neurons becomes instrumental in covering a broad spectrum of logic dependencies whose character spread in-between between those being captured by plain and and or logic descriptors (connectives). From the functional standpoint, the developed network realizes a logic approximation of multidimensional mappings between unit hypercubes, that is transformations from [0,1] super(n) to [0,1] super(m). The way in which the structure of the network has been formed is highly modular and becomes reflective of a general concept of decomposition of logic expressions and Boolean functions (as being commonly encountered in two-valued logic). In essence, given a collection of input variables, selected is their subset and transformed into new composite variable, which in turn is used in the consecutive module of the network. These intermediate synthetic variables are the result of the successive problem (mapping) decomposition. The development of the network is realized through genetic optimization. This helps address important issues of structural optimization (where we are concerned with a selection of a subset of variables and their allocation within the network) and reaching a global minimum when carrying out an extensive parametric optimization (adjustments of the connections of the neurons). The paper offers a comprehensive and user-interactive design procedure including a simple pruning mechanism whose intention is to enha- - nce the interpretability of the network while reducing its size. The experimental studies comprise of three parts. First, we demonstrate the performance of the network on Boolean data (that leads to some useful comparative observations considering a wealth of optimization tools available in two-valued logic and digital systems). Second, we discuss synthetic multivalued data that helps focus on the approximation abilities of the network. Finally, show the generation of logic expressions describing selected data sets coming from the machine learning repository.
In this paper, we are concerned with the concept of fuzzy logic networks and logic-based data analysis realized within this framework. The networks under discussion are homogeneous architectures comprising of OR/AND neurons originally introduced by Hirota and Pedrycz. Being treated here as generic processing units, OR/AND neurons are neurofuzzy constructs that exhibit well-defined logic characteristics and are endowed with a high level of parametric flexibility and come with significant interpretation abilities. The composite logic nature of the logic neurons becomes instrumental in covering a broad spectrum of logic dependencies whose character spread in-between between those being captured by plain and and or logic descriptors (connectives). From the functional standpoint, the developed network realizes a logic approximation of multidimensional mappings between unit hypercubes, that is transformations from [0, 1]n to [0, 1]m. The way in which the structure of the network has been formed is highly modular and becomes reflective of a general concept of decomposition of logic expressions and Boolean functions (as being commonly encountered in two-valued logic). In essence, given a collection of input variables, selected is their subset and transformed into new composite variable, which in turn is used in the consecutive module of the network. These intermediate synthetic variables are the result of the successive problem (mapping) decomposition. The development of the network is realized through genetic optimization. This helps address important issues of structural optimization (where we are concerned with a selection of a subset of variables and their allocation within the network) and reaching a global minimum when carrying out an extensive parametric optimization (adjustments of the connections of the neurons). The paper offers a comprehensive and user-interactive design procedure including a simple pruning mechanism whose intention is to enhance the interpretability of the network while reducing its size. The experimental studies comprise of three parts. First, we demonstrate the performance of the network on Boolean data (that leads to some useful comparative observations considering a wealth of optimization tools available in two-valued logic and digital systems). Second, we discuss synthetic multivalued data that helps focus on the approximation abilities of the network. Finally, show the generation of logic expressions describing selected data sets coming from the machine learning repository.
In this paper, we are concerned with the concept of fuzzy logic networks and logic-based data analysis realized within this framework. The networks under discussion are homogeneous architectures comprising of OR/AND neurons originally introduced by Hirota and Pedrycz. Being treated here as generic processing units, OR/AND neurons are neurofuzzy constructs that exhibit well-defined logic characteristics and are endowed with a high level of parametric flexibility and come with significant interpretation abilities. The composite logic nature of the logic neurons becomes instrumental in covering a broad spectrum of logic dependencies whose character spread in-between between those being captured by plain and and or logic descriptors (connectives). From the functional standpoint, the developed network realizes a logic approximation of multidimensional mappings between unit hypercubes, that is transformations from [0,1]/sup n/ to [0,1]/sup m/. The way in which the structure of the network has been formed is highly modular and becomes reflective of a general concept of decomposition of logic expressions and Boolean functions (as being commonly encountered in two-valued logic). In essence, given a collection of input variables, selected is their subset and transformed into new composite variable, which in turn is used in the consecutive module of the network. These intermediate synthetic variables are the result of the successive problem (mapping) decomposition. The development of the network is realized through genetic optimization. This helps address important issues of structural optimization (where we are concerned with a selection of a subset of variables and their allocation within the network) and reaching a global minimum when carrying out an extensive parametric optimization (adjustments of the connections of the neurons). The paper offers a comprehensive and user-interactive design procedure including a simple pruning mechanism whose intention is to enhance the interpretability of the network while reducing its size. The experimental studies comprise of three parts. First, we demonstrate the performance of the network on Boolean data (that leads to some useful comparative observations considering a wealth of optimization tools available in two-valued logic -
Author Reformat, M.
Pedrycz, W.
Li, K.
Author_xml – sequence: 1
  givenname: W.
  surname: Pedrycz
  fullname: Pedrycz, W.
  organization: Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, Alta
– sequence: 2
  givenname: M.
  surname: Reformat
  fullname: Reformat, M.
– sequence: 3
  givenname: K.
  surname: Li
  fullname: Li, K.
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17769581$$DView record in Pascal Francis
https://www.ncbi.nlm.nih.gov/pubmed/16722169$$D View this record in MEDLINE/PubMed
BookMark eNqFkc1rVDEUxYNUbDu6diHI21hXbybfL9m1tH5BmYLUdcjk3WgkLxmTjOB_7xtm_EBQV_fC_Z3D4Z5zdJJyAoSeErwkBOvV_Xq9pBjLpRoYVeIBOiOakx5jzU7mHXPRa0qHU3Re62eMCRdYPkKnRA6UEqnP0OXd-9XV-qZLsCs51c6msWufoBvhK8S8nSC1LvsupAZlW6DZTYQu5o_BdVMeIdbH6KG3scKT41ygD69f3V-_7W_v3ry7vrrtHWei9do56a2XknDHORdkAyOowXtJNoJTLvSgRja4-ao4ZqN2wlJPmWeOKOw5W6CXB99tyV92UJuZQnUQo02Qd9UoLcmgCFMzefFPUiqMGaPivyBVWHEp947Pj-BuM8FotiVMtnwzP944Ay-OgK3ORl9scqH-4oZBajGHWyBx4FzJtRbwxoVmW8ipFRuiIdjsazVzrWZfqznUOutWf-h-Wv9V8eygCADwW2CqsVLsO9q-qec
CODEN ITNNEP
CitedBy_id crossref_primary_10_1007_s40815_020_00968_w
crossref_primary_10_1016_j_fss_2009_04_014
crossref_primary_10_1016_j_knosys_2016_03_018
crossref_primary_10_1016_j_fss_2008_06_020
crossref_primary_10_1109_TFUZZ_2009_2030332
crossref_primary_10_1109_TSP_2008_929653
crossref_primary_10_1007_s10115_012_0610_x
crossref_primary_10_1016_j_neucom_2021_11_028
crossref_primary_10_1016_j_eswa_2024_125120
crossref_primary_10_1016_j_ins_2010_07_003
crossref_primary_10_3390_math10203872
crossref_primary_10_1109_TNN_2007_912572
Cites_doi 10.1109/TSMC.1976.5409240
10.1016/S0304-3975(98)00004-8
10.1016/S0304-3975(00)00406-0
10.1109/TSMC.1977.4309805
10.1109/72.265964
10.1016/0165-0114(80)90062-7
10.1016/S0045-7906(00)00004-5
10.1109/91.842154
10.1016/j.fss.2003.11.012
10.1016/j.micpro.2004.03.017
10.1016/S1568-4946(02)00031-5
10.1007/978-3-662-07418-3
10.1016/S0893-6080(00)00081-2
10.1109/tsmc.1980.4308381
10.7551/mitpress/3926.001.0001
10.1109/91.277963
10.1016/b978-0-08-094832-4.50018-0
10.1016/0165-0114(94)90042-6
10.1109/TSMC.1980.4308369
10.1109/91.940965
10.1016/S0166-218X(99)00096-7
10.1007/978-1-4757-2866-8
10.1016/s0019-9958(74)90440-9
10.1109/91.251926
10.1016/s0167-739x(02)00108-5
ContentType Journal Article
Copyright 2006 INIST-CNRS
Copyright_xml – notice: 2006 INIST-CNRS
DBID 97E
RIA
RIE
AAYXX
CITATION
IQODW
CGR
CUY
CVF
ECM
EIF
NPM
7SC
8FD
JQ2
L7M
L~C
L~D
7X8
7TK
DOI 10.1109/TNN.2006.873285
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library
CrossRef
Pascal-Francis
Medline
MEDLINE
MEDLINE (Ovid)
MEDLINE
MEDLINE
PubMed
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
Neurosciences Abstracts
DatabaseTitle CrossRef
MEDLINE
Medline Complete
MEDLINE with Full Text
PubMed
MEDLINE (Ovid)
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
Neurosciences Abstracts
DatabaseTitleList MEDLINE - Academic

Neurosciences Abstracts
MEDLINE
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
– sequence: 3
  dbid: 7X8
  name: MEDLINE - Academic
  url: https://search.proquest.com/medline
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Anatomy & Physiology
Computer Science
Applied Sciences
EISSN 1941-0093
EndPage 658
ExternalDocumentID 16722169
17769581
10_1109_TNN_2006_873285
1629088
Genre orig-research
Research Support, Non-U.S. Gov't
Journal Article
GroupedDBID ---
-~X
.DC
0R~
29I
4.4
53G
5GY
5VS
6IK
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABJNI
ABQJQ
ABVLG
ACGFS
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
F5P
HZ~
H~9
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
S10
TAE
TN5
VH1
AAYXX
CITATION
IQODW
RIG
AAYOK
CGR
CUY
CVF
ECM
EIF
NPM
PKN
Z5M
7SC
8FD
JQ2
L7M
L~C
L~D
7X8
7TK
ID FETCH-LOGICAL-c435t-9cc6faf6614c44451bede87ff61b54245978d37c4c48403d9c5a2f23f3c180f43
IEDL.DBID RIE
ISICitedReferencesCount 15
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000237521300009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1045-9227
IngestDate Thu Sep 04 17:44:34 EDT 2025
Thu Sep 04 22:38:22 EDT 2025
Fri Sep 05 03:11:50 EDT 2025
Wed Feb 19 01:52:28 EST 2025
Mon Jul 21 09:18:06 EDT 2025
Sat Nov 29 08:05:14 EST 2025
Tue Nov 18 22:13:15 EST 2025
Tue Aug 26 16:36:05 EDT 2025
IsPeerReviewed false
IsScholarly true
Issue 3
Keywords pruning
Data analysis
Multivalued function
OR
Parametric programming
fuzzy neurons
Logical programming
Neural network
genetic algorithms
Fuzzy neural nets
Function decomposition
Fuzzy logic
interactive network design
Genetic algorithm
fuzzy logic network
interpretation
OR/AND fuzzy neuron
AND logic operations
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c435t-9cc6faf6614c44451bede87ff61b54245978d37c4c48403d9c5a2f23f3c180f43
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
PMID 16722169
PQID 28084668
PQPubID 23500
PageCount 23
ParticipantIDs pubmed_primary_16722169
ieee_primary_1629088
crossref_citationtrail_10_1109_TNN_2006_873285
proquest_miscellaneous_68003325
proquest_miscellaneous_896178138
pascalfrancis_primary_17769581
crossref_primary_10_1109_TNN_2006_873285
proquest_miscellaneous_28084668
PublicationCentury 2000
PublicationDate 2006-05-01
PublicationDateYYYYMMDD 2006-05-01
PublicationDate_xml – month: 05
  year: 2006
  text: 2006-05-01
  day: 01
PublicationDecade 2000
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: United States
PublicationTitle IEEE transactions on neural networks
PublicationTitleAbbrev TNN
PublicationTitleAlternate IEEE Trans Neural Netw
PublicationYear 2006
Publisher IEEE
Institute of Electrical and Electronics Engineers
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
References ref13
ref15
ref14
ref11
ref10
ref2
ref17
ref16
ref19
ref18
Goldberg (ref12) 1989
ref24
ref23
ref26
ref25
ref20
ref21
(ref7) 1991
ref27
ref29
ref8
Wegener (ref28) 1987
ref9
ref4
ref3
ref6
ref5
Pedrycz (ref22) 1998
Ashenhurst (ref1)
References_xml – ident: ref17
  doi: 10.1109/TSMC.1976.5409240
– ident: ref25
  doi: 10.1016/S0304-3975(98)00004-8
– ident: ref26
  doi: 10.1016/S0304-3975(00)00406-0
– ident: ref27
  doi: 10.1109/TSMC.1977.4309805
– ident: ref23
  doi: 10.1109/72.265964
– ident: ref29
  doi: 10.1016/0165-0114(80)90062-7
– volume-title: Genetic Algorithms in Search, Optimization and Machine Learning
  year: 1989
  ident: ref12
– ident: ref6
  doi: 10.1016/S0045-7906(00)00004-5
– ident: ref15
  doi: 10.1109/91.842154
– ident: ref20
  doi: 10.1016/j.fss.2003.11.012
– ident: ref10
  doi: 10.1016/j.micpro.2004.03.017
– ident: ref5
  doi: 10.1016/S1568-4946(02)00031-5
– ident: ref19
  doi: 10.1007/978-3-662-07418-3
– ident: ref4
  doi: 10.1016/S0893-6080(00)00081-2
– ident: ref16
  doi: 10.1109/tsmc.1980.4308381
– volume-title: An Introduction to Fuzzy Sets; Analysis and Design
  year: 1998
  ident: ref22
  doi: 10.7551/mitpress/3926.001.0001
– ident: ref13
  doi: 10.1109/91.277963
– volume-title: The Complexity of Boolean Functions
  year: 1987
  ident: ref28
– start-page: 74
  volume-title: Proc. Int. Symp. Theory of Switching
  ident: ref1
  article-title: The decomposition of switching functions
– volume-title: Handbook of Genetic Algorithms
  year: 1991
  ident: ref7
– ident: ref9
  doi: 10.1016/b978-0-08-094832-4.50018-0
– ident: ref14
  doi: 10.1016/0165-0114(94)90042-6
– ident: ref2
  doi: 10.1109/TSMC.1980.4308369
– ident: ref24
  doi: 10.1109/91.940965
– ident: ref3
  doi: 10.1016/S0166-218X(99)00096-7
– ident: ref8
  doi: 10.1007/978-1-4757-2866-8
– ident: ref18
  doi: 10.1016/s0019-9958(74)90440-9
– ident: ref21
  doi: 10.1109/91.251926
– ident: ref11
  doi: 10.1016/s0167-739x(02)00108-5
SSID ssj0014506
Score 1.8875366
Snippet In this paper, we are concerned with the concept of fuzzy logic networks and logic-based data analysis realized within this framework. The networks under...
SourceID proquest
pubmed
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 636
SubjectTerms Algorithms
AND logic operations
Applied sciences
Artificial Intelligence
Boolean functions
Computer science; control theory; systems
Connectionism. Neural networks
Data analysis
Digital systems
Exact sciences and technology
function decomposition
Fuzzy Logic
fuzzy logic network
fuzzy neurons
genetic algorithms
Genetics
Hypercubes
Information Storage and Retrieval - methods
Input variables
Instruments
interactive network design
interpretation
Logistic Models
Multidimensional systems
Neural Networks (Computer)
Neurons
OR/AND fuzzy neuron
Pattern Recognition, Automated - methods
pruning
Signal Processing, Computer-Assisted
Systems Theory
Title OR/AND neurons and the development of interpretable logic models
URI https://ieeexplore.ieee.org/document/1629088
https://www.ncbi.nlm.nih.gov/pubmed/16722169
https://www.proquest.com/docview/28084668
https://www.proquest.com/docview/68003325
https://www.proquest.com/docview/896178138
Volume 17
WOSCitedRecordID wos000237521300009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1941-0093
  dateEnd: 20111231
  omitProxy: false
  ssIdentifier: ssj0014506
  issn: 1045-9227
  databaseCode: RIE
  dateStart: 19900101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB61FQc4UNgFukAXHxDiQLqx4-eNVaHiFBAq0t6ixLGlSiVbNbtI_HvGdvaBxB64RcokcTIz8Yzn83wAb2XO67apaSYZsxkXymVN0ZqsNo7b3HvBWRvJJlRZ6sXCfDuCD9u9MM65CD5zF-Ew1vLbpV2HpbIZlSzAco7hWCmZ9mptKwZcRB5NzC5EZhhTQxsfmpvZdVmmqoMOnWkiV41UjNEAct6bjCK7SsBG1j1-Hp94LQ4HnnECujr9v6E_gcdDoEnmyTKewpHrRjCed5hk__xN3pEI_Yxr6iM43XA7kMHVR_Bor1HhGD5-_T6bl59I7H7Z9aTuWoKRI2l3kCOy9ORmi2Bsbh2Jf1USqXb6Z_Dj6vP15Zds4F7ILAZQq8xYK33tw-xteWhi1rjWaeW9pI0I1VLMPttCWTyLKSJq14qaeVb4wlKde148h5Nu2bkzILzhRkslbWMx2KG0KYwPYY70ThiR5xO42CihskNj8sCPcVvFBCU3FSow0GXKKilwAu-3F9ylnhyHRcdBFzuxpIYJTP_S8u48GpYRmk7gzUbtFfpbKKLUnVuu-4rpHN9C6sMSUgeCPIbPJgcktAkbM2mBN3mRTGpvgMkyX_574K_gYVoDCojL13Cyul-7c3hgf61u-vsp-sVCT6Nf_AEabwZG
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Nb9QwEB2VgkQ5UNiFshRaHxDiQLqxYzv2jRVQFVECQovUW5Q4tlSpzVbNLhL_Ho-d_UDqHrhFyiRx8ux4xvM8D-CNTHnV1BVNJGMm4SK3SZ01Oqm05SZ1TnDWBLGJvCjUxYX-sQPvV3thrLWBfGZP8DDk8puZWeBS2ZhKhrSce3AflbP63VqrnAEXQUnTxxci0YzlfSEfmurxtChi3kFhbZqgViNzxijSnDemo6CvguzIqvMfyEVli-2uZ5iCTvf_r_FP4HHvapJJ7BtPYce2AxhOWh9mX_8hb0kgf4ZV9QHsL9UdSD_YB_Boo1ThED58_zmeFJ9IqH_ZdqRqG-J9R9KsSUdk5sjlisNYX1kS_qskiO10z-DX6efpx7OkV19IjHeh5ok2RrrK4fxtOJYxq21jVe6cpLXAfKmPP5ssN_6sDxI9vkZUzLHMZYaq1PHsOey2s9a-AMJrrpXMpamNd3corTPt0NGRzgot0nQEJ0sQStOXJkeFjKsyhCipLj2AKJgpywjgCN6tLriJVTm2mw4Ri7VZhGEER_-gvD6f51ILRUdwvIS99CMO0yhVa2eLrmQq9W8h1XYLqVAij_lnky0WSuPWTJr5mxzELrXRwNgzX97d8GN4eDb9dl6efym-HsJeXBFC_uUr2J3fLuxreGB-zy-726MwOv4Ct7QIpw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=OR%2FAND+neurons+and+the+development+of+interpretable+logic+models&rft.jtitle=IEEE+transactions+on+neural+networks&rft.au=Pedrycz%2C+W.&rft.au=Reformat%2C+M.&rft.au=Li%2C+K.&rft.date=2006-05-01&rft.issn=1045-9227&rft.eissn=1941-0093&rft.volume=17&rft.issue=3&rft.spage=636&rft.epage=658&rft_id=info:doi/10.1109%2FTNN.2006.873285&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TNN_2006_873285
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9227&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9227&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9227&client=summon