%0 Journal Article %1 Vidyadevi_2015 %A Vidyadevi, R. %A Pravinkumar, D. %D 2015 %I Auricle Technologies, Pvt., Ltd. %J International Journal on Recent and Innovation Trends in Computing and Communication %K Association Data Databases Frequent Mining Rule frequent item pattern set tree %N 2 %P 676--679 %R 10.17762/ijritcc2321-8169.150252 %T Secure Protocol for Mining in Horizontally Scattered Database Using Association Rule %U http://dx.doi.org/10.17762/ijritcc2321-8169.150252 %V 3 %X Data mining is the Data mining is the analysis step of the "Knowledge Discovery in Databases" process or KDD. In this paper, produced protocol for secure protocol for mining in scattered database using association rule. Here frequent pattern tree used to find a frequent item sets. The primary part in this protocol is secure multi party algorithm in which one compute the union of private subsets that each of the interacting players hold, and another one that test the inclusion of an element hold by one player in a subset which another subset has. Our protocol provides privacy more securely than previous protocols. In addition, it is simpler and it is improved in terms of communication rounds, communication cost and computational cost than other protocols

@article{Vidyadevi_2015, abstract = {Data mining is the Data mining is the analysis step of the "Knowledge Discovery in Databases" process or KDD. In this paper, produced protocol for secure protocol for mining in scattered database using association rule. Here frequent pattern tree used to find a frequent item sets. The primary part in this protocol is secure multi party algorithm in which one compute the union of private subsets that each of the interacting players hold, and another one that test the inclusion of an element hold by one player in a subset which another subset has. Our protocol provides privacy more securely than previous protocols. In addition, it is simpler and it is improved in terms of communication rounds, communication cost and computational cost than other protocols}, added-at = {2015-08-04T07:59:58.000+0200}, author = {Vidyadevi, R. and Pravinkumar, D.}, biburl = {https://www.bibsonomy.org/bibtex/2340c3a4a69fa3bd4b715c64360989e8f/ijritcc}, doi = {10.17762/ijritcc2321-8169.150252}, interhash = {748413641cc23fe090ba2498854ecb5a}, intrahash = {340c3a4a69fa3bd4b715c64360989e8f}, journal = {International Journal on Recent and Innovation Trends in Computing and Communication}, keywords = {Association Data Databases Frequent Mining Rule frequent item pattern set tree}, month = {february}, number = 2, pages = {676--679}, publisher = {Auricle Technologies, Pvt., Ltd.}, timestamp = {2015-08-04T07:59:58.000+0200}, title = {Secure Protocol for Mining in Horizontally Scattered Database Using Association Rule}, url = {http://dx.doi.org/10.17762/ijritcc2321-8169.150252}, volume = 3, year = 2015 }