نتایج جستجو برای: combining rule
تعداد نتایج: 285686 فیلتر نتایج به سال:
One-third of the people with an age over twenty have some signs of degenerated discs. However, in most of the patients the mere presence of degenerative discs is not a problem leading to pain, neurological compression, or other symptoms. This paper presents an interval type-2 fuzzy hybrid rule-based system to diagnose the abnormal degenerated discs where pain variables are represented by interv...
To examine three problems in the interpretation of the Luria-Nebraska Neuropsychological Battery (LNNB), the normal participants from four different studies were pooled to form a sample of 241 LNNB profiles. The first problem addressed was the LNNB's false positive rate. All five yes/no decision rules were applied simultaneously. Each individual rule had a 0% to 8% false positive rate: combinin...
In this paper, we address the problem of dealing with inconsistent knowledge bases consisting of ontologies and non-monotonic rules, following a paraconsistent reasoning approach with a focus on efficiency. Description Logics (DLs) and Logic Programs (LPs) provide different strengths when used for Knowledge Representation and Reasoning. While DLs employ the Open World Assumption and are suited ...
Psychological theories of categorization generally focus on either rule- or exemplar-based explanations. We present 2 experiments that show evidence of both rule induction and exemplar encoding as well as a connectionist model, ATRIUM, that specifies a mechanism for combining rule- and exemplar-based representation. In 2 experiments participants learned to classify items, most of which followed...
Abstrac t . In probabilistic reasoning when we have to build a probability distribution on some events and no further information is available, we then apply the insufficient reasoning principle; i.e. we assume that the events have equal opportunities to occur. In our previous work we have observed that in the Dempster-Shafer theory of evidence the principle is not applied when using Dempster's...
We have developed a finite state transducer based transliteration engine called Konkanverter that performs statistical machine transliteration between three different scripts used to write the Konkani language. The statistical machine transliteration system consists of cascading finite state transducers combining both rule-based and statistical approaches. Based on the limited availability of p...
In this article we study the expected rank problem under full information. Our approach uses the planar Poisson approach from Gnedin (2007) to derive the expected rank of a stopping rule that is one of the simplest non-trivial examples combining rank dependent rules with threshold rules. This rule attains an expected rank lower than the best upper bounds obtained in the literature so far, in pa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید