Guiding the Search in the NO Region of the Phase Transition Problem with a Partial Subsumption Test
نویسندگان
چکیده
We introduce a test, named π-subsumption, which computes partial subsumptions between a hypothesis h and an example e, as well as a measure, the subsumption index, which quantifies the covering degree between h and e. The behavior of this measure is studied on the phase transition problem.
منابع مشابه
Guiding ILP Search in the Sparse Solutions Region with a Partial Subsumption Test
We introduce a new test, named π-subsumption, which computes partial subsumptions between a hypothesis h and an example e, as well as a new measure, the subsumption index, which quantifies the covering degree between h and e. The behaviour of this measure is studied in the region of the phase transition and compared with θ-subsumption. We then consider the use of this measure for the covering t...
متن کاملThe Role of Partial Internal Wetting in Hysteresis Behavior of Catalyst Pellet
The phenomenon of capillary condensation is studied through the weight change of condensed phase in an internally wetted porous pd catalyst pellet during the course of exothermic reacation of cyclohexane hydrogenation in a thermogravimetric analyzer (TGA). The direct measurement of condensed phase indicates that evaporation of condensed phase is confined to the macropores of catalyst pellet at ...
متن کاملA Model to Study Phase Transition and Plateaus in Relational Learning
The feasibility of symbolic learning strongly relies on the efficiency of heuristic search in the hypothesis space. However, recent works in relational learning claimed that the phase transition phenomenon which may occur in the subsumption test during search acts as a plateau for the heuristic search, strongly hindering its efficiency. We further develop this point by proposing a learning prob...
متن کاملUsing Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem
Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...
متن کاملGENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS
This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...
متن کامل