http://localhost:8080/xmlui/handle/123456789/7052 Sun, 12 Apr 2026 01:49:35 GMT 2026-04-12T01:49:35Z http://localhost:8080/xmlui/handle/123456789/7206 Parallel Bidirectional Approach for Eclat Algorithm in Association Rule Mining Rohit, Subhash T. Data mining is used to deal with the huge size of the data stored in the database to extract the desired information and knowledge from the database. There are various methods for extraction of data like association, clustering, classification etc. Association is one of the most efficient data mining method among them. There are various algorithms like Apriori, FP-Growth, and Eclat etc. Among them Eclat algorithm is the best fastest algorithm and find the frequent pattern. But in Eclat algorithm, there are few issues like scanning all dataset, consume more memory and do not handle large dataset. So to reduce this issue and present new algorithm is call Bi-Eclat. Bi-Eclat can reduce the scanning of dataset but it can’t handle the large dataset and consume more memory. So here the given mentioned algorithm is Parallel Eclat algorithm, which gives better results compared to Bi-Eclat method. For Full Thesis Kindly contact to respective Library Sat, 01 Oct 2016 00:00:00 GMT http://localhost:8080/xmlui/handle/123456789/7206 2016-10-01T00:00:00Z http://localhost:8080/xmlui/handle/123456789/7054 Email Based Trust Management System with Perfect Froward Secrecy Digital Signature & Certificate Mali, Nayan Now a days use of mailing system is becoming so broad communication medium for communicating messages and file transfer over the internet. Threats are increasing aggressively in any mailing system. “Email Based Trust Management System” is approached to cope with this phenomenon. In Exiting Email System is becoming vulnerable from attacks coming from fake identities and date for phishing, Trojan horse attacks. Here we try to enhance the existing system by providing measures like trust management, digital signature and authentication certificate. with perfect forward secrecy by changing the sender password each time communication. For Full Thesis Kindly contact to respective Library Wed, 01 May 2013 00:00:00 GMT http://localhost:8080/xmlui/handle/123456789/7054 2013-05-01T00:00:00Z