SECURE MINING OF ASSOCITION RULUES OVER HORIZONTALLY PARTIONED DATA IN DATA MINING

§ Tirumala Engg College

Send Message

To: Author

SECURE MINING OF ASSOCITION RULUES OVER HORIZONTALLY PARTIONED DATA IN DATA MINING

Article Fingerprint

ReserarchID

CST7Y869

SECURE MINING OF ASSOCITION RULUES OVER HORIZONTALLY PARTIONED DATA IN DATA MINING Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

Data mining can extract important knowledge from large data collection. Sometimes these large collections are split among various parties, which can share the data. For example, insurance companies share the data from medical hospitals. Privacy concerns may prevent the parties from directly sharing the data. Here this project addresses secure mining of association rules over horizontally partitioned data. The existing work provides security by using some techniques like Randomization, Secure Multi Party computation, etc., The drawbacks in the existing work are inaccuracy, inefficiency and lacking of security. To overcome the drawbacks of existing system we proposed a new method by using Commutative Encryption tool, Randomization and Secure multi party computation. This work also provides security for multiple numbers of sites. Examples include knowledge discovery among intelligence services of different countries and collaboration among corporations without revealing trade secrets.

References

11 Cites in Article
  1. Dimitris Achlioptas (2004). Random Matrices in Data Analysis.
  2. J Vaidya,C Clifton (2002). Prviacy Preserving Association Rule Mining in Vertically Partitioned Data.
  3. Jie Wang,Jun Zhang,Shuting Xu,Weijun Zhong (2007). A novel data distortion approach via selective SSVD for privacy protection.
  4. Rakesh Agrawal,Ramakrishnan Srikant (2000). Privacy-preserving data mining.
  5. A Evfimievski,R Srikant,R Agrawal,J Gehrke (2002). Pr i vacy Preserving Mining of Association Rules.
  6. R Rivest,A Shamir,L Adleman (1978). A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.
  7. S Pohlig,M Hellman (1978). An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance.
  8. O Goldreich (2003). Encryption Schemes.
  9. Y Lindell,B Pinkas (2000). Privacy Preserving Data Mining.
  10. I Ioannidis,A Grama (2003). An Efficient Protocol for Yao's Millionaires'Problem.
  11. M Reiter,A Rubin Crowds: Anonymity for Web Transactions.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Dr. M.Mohan Rao, M.Laxmaiah. 1970. "SECURE MINING OF ASSOCITION RULUES OVER HORIZONTALLY PARTIONED DATA IN DATA MINING". Global Journal of Computer Science and Technology GJCST Volume 10 (GJCST Volume 10 Issue 14).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Version of record

v1.2

Issue date
October 14, 2010

Language
English
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 5.6K
Total Downloads: 272
All Trends

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

SECURE MINING OF ASSOCITION RULUES OVER HORIZONTALLY PARTIONED DATA IN DATA MINING

Dr. Rao
Dr. Rao Tirumala Engg College
M.Laxmaiah
M.Laxmaiah