http://localhost:8080/xmlui/handle/123456789/7058 2026-04-12T03:27:07Z http://localhost:8080/xmlui/handle/123456789/7236 INTEGRATING COMPRESSION TECHNIQUE FOR ASSOCIATION RULE MINING SINGH, SHUBHAM Data Reduction in the field of process becomes a challenging issue in the data mining. Everyone wants that there data must be processed quickly in order to get the result. There are various methods that can allow the large data to be processed quickly or in lesser amount of time. In order to do so, one of the method which is widely used in most of the fields is, “Data Compression” which can easily made availability of the required space. Data mining has many useful applications in recent years because it can help users to discover the interesting knowledge in large databases. If the Data is already pre-processed then data compression over such type of data can easily be done in quick succession of time, Here we analyze the methods simple Apriori, and the Partition Apriori over compressed database using the mining merge transaction compression technique, existing compression algorithms are not appropriate for mining due to lack of consistency of maintaining the compressed database. Two different approaches were proposed in which, first we need to compress databases by applying K-mediod while merging the transaction tables and then perform the data mining process that can promises to increased up the processing time in large databases by using the compression techniques. In this research an approach called Mining Merged Transactions with the Quantification Table is used by applying k-mediod merge compression. The Partition Apriori is used to find the frequent item sets in the database then the compressed database is maintained in the future as this table relationship of transactions is used to merge related transactions and builds a quantification table to prune the candidate item sets. For Full Thesis Kindly Contact to Respective Library 2016-10-01T00:00:00Z http://localhost:8080/xmlui/handle/123456789/7235 Energy Efficient Cryptographic Techniques in Mobile Cloud Computing TAMBOLI, GRISHMA P. The Technology World, Mobile Devices such as Smart phones, Tablets are becoming important part of the Human life. They are facing some challenges in their resource such as battery life, bandwidth and storage. They also are facing some challenges of communication and security. It describes how securely mobile data to store in a cloud using various cryptographic technique with Symmetric Algorithm & Asymmetric Algorithm using Parameter Mean Processing time And Speedup ratio which related to this Parameters to find out Time Efficiency and increase security using Asymmetric algorithm. For Full Thesis Kindly Contact to Respective Library 2016-05-01T00:00:00Z http://localhost:8080/xmlui/handle/123456789/7233 RELIABLE & ROBUST MULTIHOP COMMUNICATION IN DELAY TOLERANT NETWORK SINGH, SONAM RAMPUKAR Delay/Disruption Tolerant Network is designed for intermittently connected network where network partitions are frequent and very high delays are associated with some links. Due to lack of consistent connectivity, DTN routing usually follows store-carryand- forward; i.e., after receiving some packets, a node carries them around until it contacts another node and then forwards the packets. Routing is one of the major issues affecting the overall Performance of DTN networks in terms of resource consumption and data delivery. This research aims to improve the routing scheme of the existing system [1] in terms of high data delivery and reduce overhead or delay by using network coding concept. Path for transmission is found using DIF & PIF algorithm and then packets to be delivered are encoded at the node and finally when the encoded packets reach the destination are decoded at the destination to fetch the original packets. Through simulation it is shown that the proposed network coded DIF & PIF improves the performance of existing algorithm [1] making the network more reliable & robust. For Full Thesis Kindly Contact to Respective Library 2016-05-01T00:00:00Z http://localhost:8080/xmlui/handle/123456789/7232 Efficient and Secure Mining for Vertically Distributed Database Ray, Krishna J. Privacy preserving is most popular study for the research field. Privacy means gives the protection to the private information at preserving time. In Market place, discovery of frequent item sets using association rules mining is one of most important tasks in mining. Association rules is very helpful for finding frequent item sets to predicate about which item sets purchased together in a market and generate qualitative information that is useful for decision making. For distributed environment, database may be distributed as horizontally, vertically or mixed in computer network. The main problem in secure mining with the help of association rules is that transactions are distributed as vertically and the various sites want to find frequent item sets by participating themselves without discovering their individual data. The proposed method will find frequent item sets for vertical distributed database with the help of data miner using encryption based technique. Each sites prepare matrix with the local frequent item sets as per minimum support and encrypted it than send to other sites. The Scalar product with Boolean matrix is used for finding frequent item sets with secure computation between multiple sites without disclosing private input which improved efficiency and privacy of system. For Full Thesis Kindly Contact to Respective Library 2016-05-01T00:00:00Z