Risk prediction for weed infestation using classification rules

This paper proposes a fuzzy classification system for the risk of infestation by weeds in agricultural zones considering the variability of weeds. The inputs of the system are features of the infestation extracted from estimated maps by kriging for the weed seed production and weed coverage, and from the competitiveness, inferred from narrow and broad-leaved weeds. Furthermore, a Bayesian network classifier is used to extract rules from data which are compared to the fuzzy rule set obtained on the base of specialist knowledge. Results for the risk inference in a maize crop field are presented and evaluated by the estimated yield loss. © 2009 IEEE.

Optimal clone identifier based on dynamic rules and process algebra

The rule creation to clone selection in different projects is a hard task to perform by using traditional implementations to control all the processes of the system. The use of an algebraic language is an alternative approach to manage all of system flow in a flexible way. In order to increase the power of versatility and consistency in defining the rules for optimal clone selection, this paper presents the software OCI 2 in which uses process algebra in the flow behavior of the system. OCI 2, controlled by an algebraic approach was applied in the rules elaboration for clone selection containing unique genes in the partial genome of the bacterium Bradyrhizobium elkanii Semia 587 and in the whole genome of the bacterium Xanthomonas axonopodis pv. citri. Copyright© (2009) by the International Society for Research in Science and Technology.

Selecting candidate labels for hierarchical document clusters using association rules

One way to organize knowledge and make its search and retrieval easier is to create a structural representation divided by hierarchically related topics. Once this structure is built, it is necessary to find labels for each of the obtained clusters. In many cases the labels have to be built using only the terms in the documents of the collection. This paper presents the SeCLAR (Selecting Candidate Labels using Association Rules) method, which explores the use of association rules for the selection of good candidates for labels of hierarchical document clusters. The candidates are processed by a classical method to generate the labels. The idea of the proposed method is to process each parent-child relationship of the nodes as an antecedent-consequent relationship of association rules. The experimental results show that the proposed method can improve the precision and recall of labels obtained by classical methods. © 2010 Springer-Verlag.

Comparative study of algorithms for mining association rules: Traditional approach versus multi-relational approach

The multi-relational Data Mining approach has emerged as alternative to the analysis of structured data, such as relational databases. Unlike traditional algorithms, the multi-relational proposals allow mining directly multiple tables, avoiding the costly join operations. In this paper, is presented a comparative study involving the traditional Patricia Mine algorithm and its corresponding multi-relational proposed, MR-Radix in order to evaluate the performance of two approaches for mining association rules are used for relational databases. This study presents two original contributions: the proposition of an algorithm multi-relational MR-Radix, which is efficient for use in relational databases, both in terms of execution time and in relation to memory usage and the presentation of the empirical approach multirelational advantage in performance over several tables, which avoids the costly join operations from multiple tables. © 2011 IEEE.

Multi-relational algorithm for mining association rules in large databases

Multi-relational data mining enables pattern mining from multiple tables. The existing multi-relational mining association rules algorithms are not able to process large volumes of data, because the amount of memory required exceeds the amount available. The proposed algorithm MRRadix presents a framework that promotes the optimization of memory usage. It also uses the concept of partitioning to handle large volumes of data. The original contribution of this proposal is enable a superior performance when compared to other related algorithms and moreover successfully concludes the task of mining association rules in large databases, bypass the problem of available memory. One of the tests showed that the MR-Radix presents fourteen times less memory usage than the GFP-growth. © 2011 IEEE.

Post-processing association rules with clustering and objective measures

The post-processing of association rules is a difficult task, since a large number of patterns can be obtained. Many approaches have been developed to overcome this problem, as objective measures and clustering, which are respectively used to: (i) highlight the potentially interesting knowledge in domain; (ii) structure the domain, organizing the rules in groups that contain, somehow, similar knowledge. However, objective measures don't reduce nor organize the collection of rules, making the understanding of the domain difficult. On the other hand, clustering doesn't reduce the exploration space nor direct the user to find interesting knowledge, making the search for relevant knowledge not so easy. This work proposes the PAR-COM (Post-processing Association Rules with Clustering and Objective Measures) methodology that, combining clustering and objective measures, reduces the association rule exploration space directing the user to what is potentially interesting. Thereby, PAR-COM minimizes the user's effort during the post-processing process.

PAR-COM: A new methodology for post-processing association rules

The post-processing of association rules is a difficult task, since a huge number of rules that are generated are of no interest to the user. To overcome this problem many approaches have been developed, such as objective measures and clustering. However, objective measures don't reduce nor organize the collection of rules, therefore making the understanding of the domain difficult. On the other hand, clustering doesn't reduce the exploration space nor direct the user to find interesting knowledge, therefore making the search for relevant knowledge not so easy. In this context this paper presents the PAR-COM methodology that, by combining clustering and objective measures, reduces the association rule exploration space directing the user to what is potentially interesting. An experimental study demonstrates the potential of PAR-COM to minimize the user's effort during the post-processing process. © 2012 Springer-Verlag.

Long-term outcome of patients followed by nephrologists after an acute tubular necrosis episode

Aims of our study were to describe the long-term survival in patients surviving an acute tubular necrosis (ATN) episode and determine factors associated with late mortality. We performed a prospective cohort study that evaluated the long-term outcome of 212 patients surviving an ATN episode. Mortality at the end of followup was 24.5%, and the probability of these patients being alive 5 years after discharge was 55%. During the followup, 4.7% of patients needed chronic dialysis. Univariate analysis showed that previous CKD (P = 0.0079), cardiovascular disease (P = 0.019), age greater than 60 years (P < 0.0001), and higher SCr baseline (P = 0.001), after 12 months (P = 0.0015) and 36 months (P = 0.004), were predictors of long-term mortality. In multivariate analysis, older age (HR = 6.4, CI 95% = 1.2-34.5, P = 0.02) and higher SCr after 12 months (HR = 2.1, 95% CI 95% = 1.14-4.1, P = 0.017) were identified as risk factors associated with late mortality. In conclusion, 55% of patients surviving an ATN episode were still alive, and less than 5% required chronic dialysis 60 months later; older age and increased Scr after 12 months were identified as risk factors associated with late death. © 2012 G. A. Brito et al.

A single chart with supplementary runs rules for monitoring the mean vector and the covariance matrix of multivariate processes

The MRMAX chart is a single chart based on the standardized sample means and sample ranges for monitoring the mean vector and the covariance matrix of multivariate processes. User's familiarity with the computation of these statistics is a point in favor of the MRMAX chart. As a single chart, the recently proposed MRMAX chart is very appropriate for supplementary runs rules. In this article, we compare the supplemented MRMAX chart and the synthetic MRMAX chart with the standard MRMAX chart. The supplementary and the synthetic runs rules enhance the performance of the MRMAX chart. © 2013 Elsevier Ltd.

Modification of the B meson mass in a magnetic field from QCD sum rules

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

QCD sum rules calculation of heavy Λ semileptonic decay

We set up sum rules for heavy lambda decays in a full QCD calculation which in the heavy quark mass limit incorporates the symmetries of heavy quark effective theory. For the semileptonic Λc decay we obtain a reasonable agreement with experiment. For the Λb semileptonic decay we find at the zero recoil point a violation of the heavy quark symmetry of about 20%. © 1998 Published by Elsevier Science B.V. All rights reserved.

Szegö polynomials: quadrature rules on the unit circle and on [-1, 1]

We consider some of the relations that exist between real Szegö polynomials and certain para-orthogonal polynomials defined on the unit circle, which are again related to certain orthogonal polynomials on [-1, 1] through the transformation x = (z1/2+z1/2)/2. Using these relations we study the interpolatory quadrature rule based on the zeros of polynomials which are linear combinations of the orthogonal polynomials on [-1, 1]. In the case of any symmetric quadrature rule on [-1, 1], its associated quadrature rule on the unit circle is also given.