We know that a binary tree is a rooted tree in which each node has no more than two children. We can extend this definition to an n-ary tree. If a tree is rooted in which each node has no more than N children, it is called an n-ary tree. In other words, n-ary trees are tree data structures with up to n children nodes for each node.

In this article, we want to identify the compounds with the best effect on Acetylcholinesterase protein using XGBoost Machine Learning Algorithm. We will be using the famous ‘Chembl’ database to demonstrate the complete use-case.

Suffix trees are a compressed version of the trie that includes all of a string's suffixes. Suffix trees can be used to solve many string problems that occur in text-editing, free-text search, etc. The ability to search efficiently with mismatches might be considered their greatest strength.

Here we will cover two unordered data structures frequently used in Artificial Intelligence applications: Sets and Dictionaries.

Sentiment Analysis is a technique that comes under natural language processing(NLP) and is used to predict the emotions reflected by a word or a group of words. In this blog, we will discuss one of the simplest probabilistic algorithms, Naive Bayes to predict the sentiments using their tweets.

The word “abstract” means something that defines the skeletal details of an object. In Java language, abstraction is implemented with abstract class and interface. Abstract class and interface are two different types of classes in Java with different rules and properties.