Simultaneous selection of the number of clusters and of a relevant subset of features is part of data mining challenges. A new approach is proposed to address this difficult issue. It takes benefits of both two-levels clustering approaches and wrapper features selection algorithms. On the one hands, the former enhances the robustness to outliers and to reduce the running time of the algorithm. ...

Scaling laws provide a simple yet meaningful representation of the dominant factors of complex engineering systems, and thus are well suited to guide engineering design. Current methods to obtain useful models of complex engineering systems are typically ad-hoc, tedious, and time consuming. Here we present an algorithm that obtains a scaling law in the form of a power law from experimental data...

This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natural deduction with general elimination and explicit substitution. It also proves strong normalization and Church-Rosser property of the cut-elimination procedure by projecting the sequent calculus to the natural deduction with ...

BACKGROUND Present knowledge indicates a multilayered hierarchical gene regulatory network (ML-hGRN) often operates above a biological pathway. Although the ML-hGRN is very important for understanding how a pathway is regulated, there is almost no computational algorithm for directly constructing ML-hGRNs. RESULTS A backward elimination random forest (BWERF) algorithm was developed for constr...

In deriving a regression model analysts often have to use variable selection, despite of problems introduced by datadependent model building. Resampling approaches are proposed to handle some of the critical issues. In order to assess and compare several strategies, we will conduct a simulation study with 15 predictors and a complex correlation structure in the linear regression model. Using sa...

We examine the Concave Topology Capacity and Flow Assignment (TCFA) problem. Only two algorithms in the literature are appropriate for solving TCFA problems with concave link cost functions: Kleinrock and Gerla’s Concave Branch Elimination (CBE) procedure, [26][20], and a greedy link elimination procedure developed by Gersht [21]. However, neither works well in practice. The CBE procedure does ...

We report experimental results on the relative performance of simultaneous and sequential versions of the Abreu–Matsushima mechanism. Under the simultaneous version, subjects typically use undominated strategies, but apply only a limited number of iterations of dominance. Consequently the unique strategy surviving iterative elimination of strictly dominated strategies is rarely observed. Under ...