The code can be found in the repository, it can be downloaded as ZIP by clicking in the geen Code button. The only necessary file is the notebook confidence.ipynb. To successfully run the notebook, ...
Abstract: Memory-based classification techniques are commonly used for modeling recommendation problems. They rely on the intuition that similar users and/or items behave similarly, facilitating ...
Abstract: This paper considers the application of ultrasonic method of detection of hidden defects of multilayer printed circuit boards of radio-electronic devices using the k-nearest neighbors ...
A K-Dimensional Tree, or K-D Tree, is a space-partitioning data structure which efficiently organizing points in k-dimensional space. For further details regarding K-D Trees, please see a detailed ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results