ECG recognition by Boolean decision rules

被引:0
|
作者
Valev, V [1 ]
Radeva, P [1 ]
机构
[1] Bulgarian Acad Sci, Inst Math & Informat, BU-1113 Sofia, Bulgaria
关键词
D O I
暂无
中图分类号
R-058 [];
学科分类号
摘要
The classical pattern recognition problem is considered. A model of construction of Boolean decision rules is implemented. Computational procedures for construction of non-reducible descriptors is briefly discussed. Applications of Boolean decision rules to ECG analysis and ECG recognition are suggested.
引用
收藏
页码:556 / 560
页数:5
相关论文
共 50 条
  • [41] COMBINING DECISION RULES IN A DECISION TABLE
    SHWAYDER, K
    COMMUNICATIONS OF THE ACM, 1975, 18 (08) : 476 - 480
  • [42] Decision rules in multivalued decision systems
    Rzasa, W
    Paluch, A
    Suraj, Z
    ROUGH SETS AND CURRENT TRENDS IN COMPUTING, 2004, 3066 : 504 - 509
  • [43] Decision lists and related Boolean functions
    Eiter, T
    Ibaraki, T
    Makino, K
    THEORETICAL COMPUTER SCIENCE, 2002, 270 (1-2) : 493 - 524
  • [44] ON BOOLEAN DECISION TREES WITH FAULTY NODES
    KENYON, C
    KING, V
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 601 : 24 - 31
  • [45] Complexity of decision trees for boolean functions
    Freivalds, R
    Miyakawa, M
    Rosenberg, IG
    33RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2003, : 253 - 255
  • [46] The ECG as Decision Support in STEMI
    Ripa, Maria Sejersten
    DANISH MEDICAL JOURNAL, 2012, 59 (03):
  • [47] Extensions to Adaptive Boolean Decision Fusion
    Liggins, ME
    SIGNAL PROCESSING, SENSOR FUSION, AND TARGET RECOGNITION XI, 2002, 4729 : 288 - 296
  • [48] ON BOOLEAN DECISION TREES WITH FAULTY NODES
    KENYON, C
    KING, V
    RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (03) : 453 - 464
  • [49] On the explanatory power of Boolean decision trees
    Audemard, Gilles
    Bellart, Steve
    Bounia, Louenas
    Koriche, Frederic
    Lagniez, Jean-Marie
    Marquis, Pierre
    DATA & KNOWLEDGE ENGINEERING, 2022, 142
  • [50] On the computational power of Boolean decision lists
    Matthias Krause
    computational complexity, 2006, 14 : 362 - 375