Ans : Definition: A vertex colouring of a graph G is an assignment of colours to verticesof G in such a way that no two adjacent vertices have the same colour. A graph iscalled k-vertex colourable if it has a Read More …
Blog
Ques : Definition of Hamiltonian cycle & non-Hamiltonian
Ans : A cycle C in a graph G is called a Hamiltonian cycle if it contains all thevertices of G. A graph is called Hamiltonian if it contains a Hamiltonian cycle. Agraph is called non-Hamiltonian if it is not Read More …
Ques : Definition of Planar Graphs
Ans : A graph G is called planar if it can be drawn on a plane in such a waythat no two edges cross each other at any point except possibly at a common endvertex. Such a drawing is called Read More …
Ques : What is Edge Colouring ?
Ans : Definition: A k-edge colouring of a graph G is an assignment of k colours to theedges of G in such a way that no two edges incident with the same vertex have thesame colour. A graph is k-edge Read More …
Ques : Limitations of Dimensionality Reduction
Ans : You might lose some data. You might lose some data. PCA fails when the mean and covariance are not enough to describe a dataset. We don’t know how many major parts we need to keep track of, Read More …
Ques : Describe Dimension reduction can be accomplished in two ways
Ans : Feature selection: During this approach, a subset of the complete set of variables isselected; as a result, the number of conditions that can be utilised to illustrate the issue isnarrowed down. It’s normally done in one of Read More …
Ques : Advantages of FP growth over Apriori algorithm:
Ans : Efficient than Apriori algorithm No candidate itemset generation Only two passes over the transaction set
Ques : Working of FP growth algorithm:
Ans : Create Frequent Pattern Tree, or FP-tree by compressing the transaction database. Along withpreserving the information about the itemset, the tree structure also retains the associationamong the itemset. Divide the transaction database into a set of conditional databases. where Read More …
Ques : What are Association rules ?
Ans : In machine learning, association rules are one of the important concepts that is widely applied inproblems like market basket analysis. Consider a supermarket, where all the related items such asgrocery items, dairy items, cosmetics, stationary items etc are Read More …
Ques : Describe Treasury Risk Management
Ans : Treasury risk management may be best defined as overseeing a company’s working capital, which includes making strategic plans on the best ways to keep the enterprise solvent. This involves monitoring funds to maintain liquidity, and lowering the organization’s Read More …