IJSTR

International Journal of Scientific & Technology Research

IJSTR@Facebook IJSTR@Twitter IJSTR@Linkedin
Home About Us Scope Editorial Board Blog/Latest News Contact Us
CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT
QR CODE
IJSTR-QR Code

IJSTR >> Volume 4 - Issue 1, January 2015 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



Literature Survey On Formation Of Association Rule Using Secure Mining

[Full Text]

 

AUTHOR(S)

Vidisha H. Zodape, Leena H. Patil

 

KEYWORDS

 

ABSTRACT

Abstract: Data mining is the automatic extraction of previously unknown patterns from the database. In order to better serve the needs of web based applications and to find the associated data from web, the overview of privacy preserving in mining association rule and the private dataset is given in this paper. Here protocols are proposed to allow secure association rule on distributed database.

 

REFERENCES

[1] Ms. Monal saxena “Association rules Mining Using Improved Frequent Pattern Tree Algorithm”, International Journal of Computing, Communications and Networking, Volume 2, No.4, October - December 2013

[2] M.J. Freedman, K. Nissim, and B. Pinkas,“Privacy Preserved Collaborative Secure Multiparty Data Mining,” Proc. Int’l Conf. Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 1-19, 2012.

[3] T. Tassa and E. Gudes, “Secure Mining of Association Rules in Horizontally Distributed Databases,” IEEE Trans. Database Systems, vol. 37, 2014.

[4] J. Vaidya and C. Clifton, “Privacy Preserving Association Rule Mining in Vertically Partitioned Data,” Proc. Eighth ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining (KDD), pp. 639- 644, 2012.

[5] H. Grosskreutz, B. Lemmen, and S. R€uping, “Secure Distributed Subgroup Discovery in Horizontally Partitioned Data,” Trans. Data Privacy, vol. 4, no. 3, pp. 147-165, 2011.

[6] T. Tassa and D. Cohen, “Privacy preseving distributed mining of association rules on horizontally partitioned data ,” IEEE Trans. Knowledge and Data Eng., vol. 25, no. 2, pp. 311-324, Feb. 2013.

[7] A R “Fast Algorithms for Mining Association Rules", Sep 12-15 1994, Chile, 487-99, pdf, 1-55860-153-9.

[8] Mannila H,"Efficient algorithms for discovering association rules mining." conference Knowledge Discovery in Databases (SIGKDD). 181-83.

[9] Tan, P. N., M. St., V. Kumar, “Introduction to web Mining”, Addison-Wesley, 2013, 769pp.

[10] I. H. Witten and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques with Java Implementation, 2nd ed. San Mateo.

[11] Huang, H., Wu, X.. Association analysis with one scans of web data bases. Paper submitted at the IEEE On Data Mining, Japan.

[12] R. Jin “An Efficient Implementation of Apriori Association web mining,” Proc. Workshop on High Performance Data webMining, Apr. 2011.

[13] J. H and M. Kaber, “association mining:” 2014.

[14] Han J “Mining frequent patterns without candidate rules mining technique," in the national seminar of the international web of data, ACM Press, pp. 4-11-2004

[15] E-H. Han, G. Caryopsis “Scalable Data web mining for Association web Rules,” IEEE Trans. Eng., vol. 12, no. 3, July 2012.

[16] Brin S., R. Mot, J.D. Ullman, “web item set counting and implication rules

[17] Association mining in data base”, in Proceedings of the ACM SIGMOD International Conference on Management of Data, pp.289-294, 1999.

[18] Masseglia F., “Using Data Mining Techniques on Web Access Logs to Dynamically Improve Hypertext Structure language”, In ACCM Web Letters, Vol. 10 No. 9, pp.13-19, 2011.