Table 1 - uploaded by Virendra Singh Kushwah
Content may be subject to copyright.
An Example of Transactional Database
Source publication
The main motive behind the proposed paper is to give a new approach in the field of data mining. The utility mining being a new and innovative field is very much open for the new research work. Privacy preservation in utility mining is one of those new emerging fields. This paper is presented on privacy preservation in utility mining and gives a ne...
Context in source publication
Context 1
... proposed algorithm can be understood with the help of the following description. The description of the working of the algorithm has been explained with the help of above example considering tables :-table 1 and table 2 given above. Step 1:-Calculating the utility value of each itemset pair in the database. ...
Similar publications
Estimates of the elasticity of the marginal utility of income are necessary for determining distributional weights to correct for diminishing marginal utility of income, which is particularly important in light of increasing concern about accounting for distributional impacts in regulatory review. The elasticity is also necessary for computing the...
A buried utility tunnel can effectively protect internal pipes by preventing or mitigating corrosion, external damage, and facilitating maintenance. During an earthquake, the energy from seismic waves is transmitted through the soil to the utility tunnel, then to the support structure, and ultimately to the pipe, making the support’s interaction wi...
Citations
... Association rules were mined using a single scan of the database. In addition, this was also found to increase the security and confidentiality of itemsets [28]. An effective evaluation function is made use of to handle the drawbacks of missing costs and failures. ...
Due to the voluminous amount of itemsets that are generated, the association rules extracted from these itemsets contain redundancy, and designing an effective approach to address this issue is of paramount importance. Although multiple algorithms were proposed in recent years for mining closed association rules most of them underperform in terms of run time or memory. Another issue that remains challenging is the nature of the dataset. While some of the existing algorithms perform well on dense datasets others perform well on sparse datasets. This paper aims to handle these drawbacks by using a genetic algorithm for mining closed association rules. Recent studies have shown that genetic algorithms perform better than conventional algorithms due to their bitwise operations of crossover and mutation. Bitwise operations are predominantly faster than conventional approaches and bits consume lesser memory thereby improving the overall performance of the algorithm. To address the redundancy in the mined association rules a tree-based pruning algorithm has been designed here. This works on the principle of minimal antecedent and maximal consequent. Experiments have shown that the proposed approach works well on both dense and sparse datasets while surpassing existing techniques with regard to run time and memory.
... The resultant acquired by the presented work (WNU) is compared over the existing models, like AAP-CSA, 30 CM-LA, 35 BS-WOA, 36 GA, 37 and PSO. 38 This evaluation is undergone in terms of the cost function, chosen-ciphertext attack (CCA), key sensitivity, attacks as well. Algorithm parameters and values are revealed in Table 4. ...
Currently, the furious competitiveness in global markets and speedy improvements in information technology lead to shorter product life cycles, lesser transportation capabilities, and increased demands as well. In most business scenarios, the supply chain network is becoming one of the most vital focusing areas. In the supply chain network, blockchain technology is a promising solution for secure information sharing. However, it is a bit critical in maintaining security at each level of the blockchain and hence the public-private-key cryptography is more commonly preferred. This study intends to construct a new privacy preservation model in the field of supply chain networks based on blockchain technology by undergoing three major phases, namely, (a) data sanitization, (b) key generation, and (c) restoration. Further, the sensitive fields in the original data are selected during the data sanitization phase, and in the key generation phase; the optimal key is generated to hide the selected sensitive fields. The hidden data with the secured key is transferred from the source (manufacturer) to destination (ven-dor) in the supply chain network via the blockchain. The restoration process takes place in the receiver side with the help of the same key. Among all these
