Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Decision tree induction is the learning of decision trees from class-labeled training tuples. A decision tree is a sequential diagram-like tree structure, where every internal node (non-leaf node) indicates a test on an attribute, each branch defines a result of the test, and each leaf node (or terminal node) influences a class label. The largest node in a tree is the root node.Decision tree induction generates a flowchart-like structure where each internal (non-leaf) node indicates a test on an attribute, each branch corresponds to a result of the test, and each external (leaf) node indicates a class prediction.At each node, ... Read More
In this problem, we are given an arr[] of size N containing values from 1 to N-1 with one value occuring twice in the array. Our task is to find the only repeating element in a sorted array of size n.Let’s take an example to understand the problem, Inputarr[] = {1, 2, 3, 4, 5, 5, 6, 7}Output5Solution ApproachA simple approach to solve the problem is by using linear search and checking if arr[i] and arr[i+1] have the same value. In this case, return arr[i] which is the value repeated.Example 1Program to illustrate the working of our solution#include using ... Read More
A variable transformation defines a transformation that is used to some values of a variable. In other terms, for every object, the revolution is used to the value of the variable for that object. For instance, if only the significance of a variable is essential, then the values of the variable can be changed by creating the absolute value.There are two types of variable transformations: simple functional transformations and normalization.Simple FunctionsA simple mathematical function is used to each value independently. If r is a variable, then examples of such transformations include xk, logx, ex, $\sqrt{x}$, $\frac{1}{x}$, sinx, or |x|. In ... Read More
Data mining is the process of finding useful new correlations, patterns, and trends by transferring through a high amount of data saved in repositories, using pattern recognition technologies including statistical and mathematical techniques. It is the analysis of factual datasets to discover unsuspected relationships and to summarize the records in novel methods that are both logical and helpful to the data owner.Data mining techniques can be used to make three kinds of models for three kinds of tasks such as descriptive profiling, directed profiling, and prediction.Descriptive Profiling − Descriptive models defines what is in the record. The output is multiple ... Read More
In this problem, we are given an arr[] of size N containing values from 1 to N with one value missing in the array. Our task is to find the only missing number in a sorted array.Let’s take an example to understand the problem, Inputarr[] = {1, 2, 3, 5, 6, 7}Output4Solution ApproachA simple solution to the problem is by traversing the sorted array linearly. And then check for the missing value using the fact that arr[i] = (i + 1).Example 1Program to illustrate the working of our solution#include using namespace std; int findMissingValArray(int arr[], int N){ for(int ... Read More
Hypothesis testing is the simplest approach to integrating data into a company’s decision-making processes. The purpose of hypothesis testing is to substantiate or disprove preconceived ideas, and it is a part of almost all data mining endeavors.Data miners provide bounce back and forth among methods, first thinking up possible descriptions for observed behavior and letting those hypotheses dictate the data be computed.Hypothesis testing is what scientists and statisticians traditionally spend their lives doing. A hypothesis is a proposed explanation whose validity can be tested by analyzing data. Such information can easily be collected by observation or created through an experiment, ... Read More
In this problem, we are given an arr[] of size n and two integers a and b. Our task is to find the only element that appears b times.All values of the array occur a time except one value which occurs b times in the array and we need to find that value.Let’s take an example to understand the problem, Inputarr[] = {3, 3, 3, 3, 5, 5, 5, 1, 1, 1, 1} a = 4, b = 3Output5Solution ApproachA simple solution to the problem is by counting the occurrence of each element and then storing it in a 2D ... Read More
In single-attribute evaluators, it can be utilized with the Ranker search methods to make a ranked list from which ranker discards a given number. It is also used in the RankSearch method.Relief Attribute Eval is instance-based − It samples instances randomly and checks neighboring instances of the equal and multiple classes. It works on discrete and continuous class data. Parameters define the multiple instances to sample, the various neighbors to check, whether to weight neighbors by distance, and an exponential function that conducts how increasingly weights decay with distance.InfoGain Attribute Eval − It computes attributes by calculating their information gain ... Read More
Weka is a set of machine learning algorithms for data mining services. The algorithms can be used directly to a dataset or from your own Java program. It includes tools for data pre-processing, classification, regression, clustering, association rules, and visualization. It is also applicable for producing new machine learning schemes.One method of using Weka is to use a learning approach to a dataset and analyze its output to learn more about the record. The second is to need learned models to make predictions on new instances.A third is to use multiple learners and compare their performance to select one for ... Read More
In this problem, we are given an arr[] of size n. Our task is to find the only different element in an array.There are only two different types of elements in the array. All the elements are the same except one.Let’s take an example to understand the problem, Inputarr[] = {1, 1, 1, 2, 1, 1, 1, 1}Output2Solution ApproachA simple approach to solve the problem, we need to traverse the array and find elements which are different from other elements of the array. This approach needs a time complexity of O(N2).Another approach to solve the problem in O(N) is by ... Read More