INTERNATIONAL RESEARCH JOURNAL OF SCIENCE ENGINEERING AND TECHNOLOGY

( Online- ISSN 2454 -3195 ) New DOI : 10.32804/RJSET

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 288    Submit Your Rating     Cite This   Download        Certificate

DIFFERENT TECHNIQUES OF ANALYSIS OF DATA

    1 Author(s):  ARUN PRATAP SINGH

Vol -  5, Issue- 3 ,         Page(s) : 41 - 47  (2015 ) DOI : https://doi.org/10.32804/RJSET

Abstract

Data mining is a particular data analysis technique that focuses on modeling and knowledge discovery for predictive rather than purely descriptive purposes. Business intelligence covers data analysis that relies heavily on aggregation, focusing on business information. In statistical applications, some people divide data analysis into descriptive statistics, exploratory data analysis (EDA), and confirmatory data analysis (CDA). EDA focuses on discovering new features in the data and CDA on confirming or falsifying existing hypotheses. Predictive analytics focuses on application of statistical models for predictive forecasting or classification, while text analytics applies statistical, linguistic, and structural techniques to extract and classify information from

  1. K. D. Bowers, A. Juels, and A. Oprea, “Hail: A high-availability and integrity layer for cloud storage,” in Proc. of CCS’09, 2009, pp. 187–198.
  2. T. Schwarz and E. L. Miller, “Store, forget, and check: Using algebraic signatures to check remotely administered storage,” inProc. of ICDCS’06, 2006, pp. 12–12.
  3. M. Lillibridge, S. Elnikety, A. Birrell, M. Burrows, andM. Isard, “A cooperative internet backup scheme,” in Proc. of the 2003 USENIXAnnual Technical Conference (General Track), 2003, pp. 29–41.
  4. M. Castro and B. Liskov, “Practical byzantine fault tolerance and proactive recovery,” ACM Transaction on Computer Systems, vol. 20,no. 4, pp. 398–461, 2002.
  5. L. Carter and M. Wegman, “Universal hash functions,” Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143–154, 1979.
  6. J. Hendricks, G. Ganger, and M. Reiter, “Verifying distributed erasure-coded data,” in Proc. of 26th ACM Symposium on Principles of Distributed Computing, 2007, pp. 139–146.
  7. J. S. Plank and Y. Ding, “Note: Correction to the 1997 tutorial on reed-solomon coding,” University of Tennessee, Tech. Rep. CS-03-504, April 2003.
  8. C. Wang, Q. Wang, K. Ren, and W. Lou, “Privacy-preserving public auditing for storage security in cloud computing,” in Proc.of IEEE INFOCOM’10, San Diego, CA, USA, March 2010

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details