This paper critically analyzes reduct construction methods evels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic g...
An implicit assumption of many machine learning algorithms is that all attributes are of the same importance. An algorithm typically selects attributes based solely on their statis...
A new model for the One-dimensional Cutting Stock problem using Genetic Algorithms (GA) is developed to optimize construction steel bars waste. One-dimensional construction stocks...
The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric b...
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...