We propose here a modified inductive learning procedure based on Michalski’s (1973, 1983) star-type methodology. The method is based on some elements of the authors’ previous work. Basically, since the algorithm builds the rule sought in an iterative way, a pre-processing of data (examples) is performed based on an analysis of how frequent the values of the particular attributes occur in the examples. These frequencies are used to derive weights associated with those values, and the problem is represented as a modification of the set covering problems, and solved by a modification of a greedy algorithm (IP_GRE) or a genetic algorithm (IP_GA).
Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.
May 10, 2021
Jan 7, 2020
Viscardi, Tomasz Brzeski, Michał Wacław
Kleczyński, Józef (1841–1900)
Marty, Philippe Darras, Lionel Tabbagh, Jeanne Benech, Christophe Simon, François-Xavier Thiesson, Julien