Bøger af Igor Chikalov

The results presented here (including the assessment of a new tool - inhibitory trees) offer valuable tools for researchers in the areas of data mining, knowledge discovery, and machine learning, especially those whose work involves decision tables with many-valued decisions.

This monograph generalizes several known results on the topic and considers a number of fresh problems. Combinatorics, probability theory and complexity theory are used in the proofs, as well as concepts from discrete mathematics and computer science.

This book covers Test Theory, Rough Sets and Logical Analysis of Data. The authors intend for this comparative appraisal to lead to new theoretical results and real-life applications based on the combination of the three approaches.

Dynamic programming is an efficient technique for solving optimization problems. and multi-stage optimization for such classic combinatorial optimization problems as matrix chain multiplication, binary search trees, global sequence alignment, and shortest paths.