Application Of t-Cherry Junction Trees in Pattern Recognition

Clicks: 379
ID: 2166
2010
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Star

Ranked #6 of 31 articles by views in brain: broad research in artificial intelligence and neuroscience

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
Pattern recognition aims to classify data (patterns) based ei-<br />ther on a priori knowledge or on statistical information extracted from the data. In this paper we will concentrate on statistical pattern recognition using a new probabilistic approach which makes possible to select the so called 'informative' features. We develop a pattern recognition algorithm which is based on the conditional independence structure underlying the statistical data. Our method was succesfully applied on a real problem of recognizing Parkinson's disease on the basis of voice disorders.
Reference Key
kovacs2010applicationbrain Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Kovacs, Edith;Szantai, Tamas;
Journal brain: broad research in artificial intelligence and neuroscience
Year 2010
DOI
DOI not found
URL
http://brain.edusoft.ro/index.php/brain/article/view/103
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.