The purpose of this study was to generate more concise rule extraction from the Recursive- Rule Extraction (Re-RX) algorithm by replacing the C4.5 program currently employed in Re-RX with the J48graft algorithm. Experiments were subsequently conducted to determine rules for six different two-class mixed datasets having discrete and continuous attributes and to compare the resulting accuracy, comprehensibility and conciseness. When working with the CARD1, CARD2, CARD3, German, Bene1 and Bene2 datasets, Re-RX with J48graft provided more concise rules than the original Re-RX algorithm. The use of Re-RX with J48graft resulted in 43.2%, 37% and 21% reductions in rules in the case of the German, Bene1 and Bene2 datasets compared to Re-RX. Furthermore, the Re-RX with J48graft showed 8.87% better accuracy than the Re-RX algorithm for the German dataset. These results confirm that the application of Re-RX in conjunction with J48graft has the capacity to facilitate migration from existing data systems toward new concise analytic systems and Big Data.
Polymer brushes containing epoxy groups were grafted onto a porous hollow-fiber membrane by radiation-induced graft polymerization of glycidyl methacrylate. N-Methylglucamino (NMG) groups for binding antimony(III) were introduced to the epoxy groups of the polymer brush using a range of reaction times. To determine the process of the introduction of NMG groups to the polymer brush, the water permeability through the membrane, the swelling ratio of the membrane, and the antimony(III) adsorptivity of the membrane were determined for different NMG conversion values of 0 - 76%. The water permeability and the swelling ratio indicated that the NMG groups reacted with the epoxy groups of the polymer brush on the outside of the base of the polymer first, and then with those inside the base of the polymer matrix. The molar ratio between the NMG groups and the antimony(III) adsorbed on the polymer brush was always 0.5, demonstrating that the NMG groups were introduced from the tail end of the polymer brush to the fixed end due to diffusion and reaction of the NMG groups along the polymer brush.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Information dynamics of cellular automata(CA) is studied using polynomials over finite fields. The information about the uncertainty of cell states is expressed by an indeterminate X called information variable and its dynamics is investigated by extending CA to CA[X] whose cell states are polynomials in X. For the global configuration of extended CA[X], new notions of completeness and degeneracy are defined and their dynamical properties are investigated. A theorem is proved that completeness equals non-degeneracy. With respect to the reversibility, we prove that a CA is reversible, if and only if its extension CA[X] preserves the set of complete configurations. Information dynamics of finite CAs and linear CAs are treated in the separate sections. Decision problems are also referred.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.