Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
The electric power can be transmitted either by using AC transmission system or DC transmission system. Each transmission system has its own advantages and disadvantages. Therefore, to choose the right system for electric power transmission, we need to compare the two systems.The following table compares and contrasts the AC transmission system and DC transmission system based on different parameters −ParameterAC Transmission SystemDC Transmission SystemDefinitionAn electric power transmission system that uses alternating current to transmit the power is called the AC transmission system.An electric power transmission system which transmits the electric power in the form of DC supply, is called the ... Read More
Cost of Electrical EnergyThe cost of electrical energy generated can be divided into three parts, viz −Fixed CostSemi-Fixed CostOperating or Running CostFixed Cost of Electrical EnergyThe cost of electrical energy generated which is independent of the units generated and the maximum demand, is known as fixed cost.The fixed cost of electrical energy is mainly due to the annual cost of central organisation, interest on capital cost of land and the salaries of high officials. The annual cost of the central organisation and the salaries of high officials is fixed, it is because, it has to be met whether the power ... Read More
Demand FactorThe demand factor of an electric power station is defined as the ratio of maximum demand on the power station to its connected load, i.e., $$\mathrm{Demand \:Factor\:=\:\frac{Maximum\: Demand}{Connected \:Load}}$$Generally, the value of demand factor is less than 1. It is because the maximum demand on the power station is usually less than the connected load to the power station. The knowledge of demand factor is important in determining the capacity of equipment of the power plant.Numerical Example (1)A generating station has a connected load of 50 MW and a maximum demand of 30 MW. Determine the demand factor of ... Read More
A standard method for handling the graph isomorphism issues is to map each graph into a specific string representation called its code or canonical label. A canonical label has the property that if two graphs are isomorphic, therefore their codes should be equal.This property enables us to test for graph isomorphism by analyzing the canonical labels of the graphs. The first phase toward building the canonical label of a graph is to discover an adjacency matrix description for the graph. It shows an instance of such a matrix for the given graph.A graph can have higher than one adjacency matrix ... Read More
Association analysis algorithms have the probable to make a huge number of patterns. For instance, although the data set include only six items, it can create up to thousands of association rules at specific support and confidence thresholds. As the size and dimensionality of real monetary databases can be large, they can easily end up with thousands or even millions of patterns, some of which cannot be interesting.It is analytical through the patterns to recognize the most interesting ones is not a trivial service because one person's trash can be another person's treasure. It is essential to create a set ... Read More
An FP-tree is a solid description of the input data. It is assembled by reading the data set one transaction at a time and measuring each transaction onto a route in the FP-tree. Several transactions can have multiple items in common, their route can overlap.The more the routes overlap with one another, the more compression can implement using the FP-tree architecture. If the size of the FP-tree is adequate to fit into the main memory, this will enable us to extract frequent itemsets directly from the architecture in memory rather than creating repeated passes over the data saved on disk.Each ... Read More
Apriori is the algorithms to have strongly addressed the combinatorial burst of frequent itemset generation. It implements this by using the Apriori principle to shorten the exponential search area. Despite its important performance enhancement, the algorithm acquires considerable I/O overhead because it needed making various passes over the transaction recordset.The act of the Apriori algorithm can degrade essentially for dense data sets because of the enhancing width of transactions. Several methods have been produced to overcome these drawbacks and enhance the effectiveness of the Apriori, algorithm.The following is a high-level description of these methods which are as follows −Traversal of ... Read More
A maximal frequent itemset is represented as a frequent itemset for which none of its direct supersets are frequent. The itemsets in the lattice are broken into two groups such as those that are frequent and those that are infrequent. A frequent itemset border, which is defined by a dashed line.Each item set situated above the border is frequent, while those located under the border (the shaded nodes) are infrequent. Between the itemsets residing near the border, {a, d}, {a, c, e}, and {b, c, d, e} are treated to be maximal frequent itemsets because their direct supersets are infrequent.An ... Read More
The computational complexity of the Apriori algorithm can be influenced by the following factors which are as follows −Support Threshold − Lowering the support threshold results in higher itemsets being stated as frequent. This has an unfavorable effect on the computational complexity of the algorithm because higher candidate itemsets should be produced and counted.The maximum size of frequent itemsets also influences to improve with lower support thresholds. As the maximum size of the frequent itemsets improves, the algorithm will be required to create more passes over the data set.Number of Items (Dimensionality) − As the number of several items increases, ... Read More
Support counting is the procedure of deciding the frequency of appearance for each candidate itemset that survives the candidate pruning step of the apriori-gen function.One method for doing this is to compare each transaction against each candidate itemset and to refresh the support counts of candidates included in the transaction. This method is computationally costly, particularly when the multiple transactions and candidate itemsets are high.A second approach is to enumerate the itemsets included in each transaction and need them to refresh the support counts of their specific candidate itemsets. Consider a transaction t that includes five items, {I, 2, 3, ... Read More