In Part 1 and Part 2 of my series, we have created conclusions about data such as “This data instance is in this class!” The next question will be “What if we assign a probability to a data instance belonging to a given class?” The answer will be discussed in the this tip.
You probably have solved the basic problem when you try to find the first number k that is divisible by a given number n, example:
Using swap etc. from generic code must be done properly. Here’s how to fix it for good.
An introduction to Decision Trees.
In this tip, I’ll discuss our first machine-learning algorithm: k-Nearest Neighbors.
In this article, we will formulate and discuss CLOPE data mining clustering algorithm that allows to drastically increase the quality and efficiency of categorized data clustering and can be easily used for recommendation-specific purposes
Best Practice For Opinion and Text Mining Based on Naïve Bayesian Classifier. This article will explain complete and describe detail by detail and step by step computational matters.
This article shows how to use Winforms, WPF and C# to create a File Explorer Clone with Tabs and an extremely fast parallel file search utility.
Finding a Fundamental Cycle Set Forming a Complete Basis to Enumerate All Cycles of a Given Undirected Graph
Comprehensive unit parsing library
With recent scientific advancements in Deep Learning, Artificial Intelligence and Neural Networks, as well as steadily evolving tools such as Tensorflow, Pytorch, and Keras, writing, testing and optimizing your own Neural Networks is now easier than ever before.
Many improvements over a pretty new and unknown very fast 2D Convex Hull algorithm and much more.
To optimize, or not to optimize, that is the question…
Entry in the Artificial Intelligence and Machine Learning Contest. Here's how I learned / guessed how to find spam.