An Efficient Storage Mechanism for Non Reference Elements in Cloud Utilizing Tversky Co-Efficient, K-Means and SVM
Shweta Pandey1, Sunil Shukla2
1Shweta, Department of Computer Science, Deshbhagat University Punjab, India.
2Dr. Sunil Shukla, HOD Department of Computer Science, Deshbhagat University Punjab, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 971-974 | Volume-8 Issue-6, August 2019. | Retrieval Number: F8259088619/2019©BEIESP | DOI: 10.35940/ijeat.F8259.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Topical technological advances have prompted the success and popularity of the cloud. This novel hypothesis is becoming more interesting as it provides economical architectures that support storage, transmission, and intensive data computing. Though, these capable storage services pose many challenging design problems because of data control loss with cloud’s abstract nature. The aspiration behind this research is to propose a novel mechanism that could lessen the cloud storage using Tversky Co-efficient technique by means of K-mean clustering. For the cross-validation process, the SVM classification algorithm is considered. For the computation, QoS parameters, such as Formation Time and Formation Time are considered that would enlighten the efficacy of the research work.
Keywords: Cloud computing, cloud storage, Tversky Co-efficient, SVM, Formation Time, Formation Time