prediction, diagnosis, recovery and recurrence of the breast cancer among the patients are always one of the most important challenges for explorers and scientists. nowadays by using of the bioinformatics sciences, these challenges can be eliminated by using of the previous information of patients records. in this paper has been used adaptive nero fuzzy inference system and data mining techniqu...

We present in this paper an exact algorithm for motif extraction. Efficiency is achieved by means of an improvement in the algorithm and data structures that applies to the whole class of motif inference algorithms based on suffix trees. An average case complexity analysis shows a gain over the best known exact algorithm for motif extraction, when applied to extract long motifs. A full implemen...

The desirability of Horn clauses in logical deductive systems has long been recognized. The reasons are at least threefold. Firstly, while inference algorithms for full logics of any reasonable extent are typically intractable, for systems restricted to Horn clauses the picture is much better. (For example, in ordinary propositional logic, while the full satisfiability problem is NP-complete, a...

We consider a multiple-rule, generalized modus ponens inference scheme, with an interpretation based on compositional rule of inference (CRI) and a residuated implication. We show that such a system is equivalent, as far as CRI is concerned, to a system that satis5es the “basic requirement for fuzzy reasoning”, proposed by Turksen and Tian (Fuzzy Sets and Systems 58 (1993) 3–40). We establish a...

Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step toward an implementation of mtt typechecker that has a practical efficiency. Our approach is to represent an input type obtained from a backward inference as an alternating tree automaton, in a style similar to Tozawa’s X...

In this work, we compare two extensions of two different topic models for the same problem of recommending full-text items: previously developed SVD-LDA and its counterpart SVD-ARTM based on additive regularization. We show that ARTM naturally leads to the inference algorithm that has to be painstakingly developed for LDA.

Hidden variables are well known sources of disturbance when recovering belief networks from data based only on measurable variables. Hence models assuming existence of hidden variables are under development. This paper presents a new algorithm ”accelerating” the known CI algorithm of Spirtes, Glymour and Scheines [20]. We prove that this algorithm does not produces (conditional) independencies ...

In order to get a more general result related on fuzzy implications that induced by aggregation functions, we relax the definition of overlap precisely, removing its right-continuous, and introduce new kind function, which called semi-overlap function. Subsequently, explore some their algebraic properties corresponding residual implications. Moreover, serval scholars have provided kinds methods...

In this paper we show that it is possible to eliminate the converse operator from the propositional dynamic logic CPDL Converse PDL without compromising the soundness and completeness of inference for it Speci cally we present an encoding of CPDL formulae into PDL that eliminates the converse programs from a CPDL formula but adds enough information so as not to destroy its original meaning with...