32. Data Analytics - Data Analysis with R Programming - Week 5

 Learn how to document and report your work using R markdown.

How to install R Markdown in RStudio and create a markdown document.

Learn structure and component of the document.


Definitions:

R Markdown // a file format for making dynamic documents with R

Markdown // a syntax for formatting plain text files

R Notebook // lets users run your code and show the graphs and charts that visualize the code

HTML // set of markup symbols or codes used to create a webpage

Jupiter notebooks // documents that contain computer code and rich text elements, such as comments, links, or descriptions of your analysis and results.

YAML // language for data that translates it so it's readable

Code chunk // code added in an .RMD file. The R markdown file

Delimiter // character that indicates the beginning or end of a data item


Other Notebooks:

        - Project Jupyter, Kaggle, Google Colab

        https://jupyter.org/

        https://realpython.com/jupyter-notebook-introduction/

        https://jupyter-notebook.readthedocs.io/en/stable/notebook.html

        https://gtribello.github.io/mathNET/assets/notebook-writing.html

        https://medium.com/analytics-vidhya/the-jupyter-notebook-formatting-guide-873ab39f765e


R Markdown:

        - can create HTML, PDF, and Word Docs

        - can create slideshows or dashboards

        - install.packages("rmarkdown")

        - File > new R Markdown File

        - Edit the file to include any code of plots and click "Knit" button to generate a report.


Markdown formatting:

        - Italicize: _word_ or *word*


Markdown Document Structures:

        - YAML (yet another markup language) Header, surrounded by 3 dashes top and bottom.

                - for metadata

        - Headers, indicated with ##, more hashtags make it smaller

        - Texts/Information, dont need formatting.

        - R Studio functions, surrounded by 3 back ticks ``` top and bottom.

                    ```{r LABELNAME_HERE} CODE ```

        - Links, encased with <LINKURLHERE>

                Custom links: clickhere[link placeholder word](LINK URL)

        - Bolding, **BOLD**

        - Italicize, *ITALICIZE*

        - Bulletpoints, * BULLET

        - Embed Image Links, ![WORDS](IMAGE_LINK)


Code Chunks:

        - R Studio functions, surrounded by 3 back ticks ``` top and bottom.

                    ```{r LABELNAME_HERE} CODE ```

        - Can turn off what outputs to show and not show.        


R Markdown Output Types:



Additional Resources:

https://rmarkdown.rstudio.com/lesson-1.html

https://rmarkdown.rstudio.com/lesson-15.html

https://rstudio.com/wp-content/uploads/2015/03/rmarkdown-reference.pdf?_ga=2.49295910.1034302809.1602760608-739985330.1601281773

https://bookdown.org/yihui/rmarkdown/

https://www.kaggle.com/docs/notebooks

https://colab.research.google.com/notebooks/intro.ipynb

https://rmarkdown.rstudio.com/gallery.html

https://r4ds.had.co.nz/r-markdown-formats.html

https://rmarkdown.rstudio.com/formats.html

https://github.com/rstudio/bookdown

https://github.com/yixuan/prettydoc/

https://github.com/rstudio/rticles


https://github.com/mitchelloharawild/vitae

https://github.com/rstudio/rticles

https://github.com/rstudio/learnr

https://github.com/rstudio/bookdown

https://github.com/rstudio/flexdashboard

Comments

Post a Comment

Popular posts from this blog

2. FreeCodeCamp - Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges

Dynamic Programming - Parts      PART 1 - Memoization     P ART 2 - Tabulation Dynamic Programming with Fibonacci Example Recursion: Slow because time complexity is O(2^n) func fibR (x int ) int {     if x <= 2 {         return 1     }     return fibR (x- 1 ) + fibR (x- 2 ) } Dynamic Way Example Recursion with Stored Value:  // Fast because it removes duplicate processes by checking map. // Tail recursion-ish // Results are hitchhiking each recursive call func fibR2 (x int , y map [ int ] int ) int {     if _ , ok := y[x]; ok {         return y[x]     }     if x <= 2 {         return 1     }     y[x] = fibR2 (x- 1 , y) + fibR2 (x- 2 , y)     return y[x] }
Read more

20. Data Analytics - Analyze Data to Answer Questions - Week 1

Goal of analysis is to identify trends and relationships within data so you can accurately answer the questions you're asking. Most data is organized in tables, always have data in the right format. Definition : Analysis // process used to make sense of the data collected Sorting // involves arranging data into a meaningful order to make it easier to understand, analyze, visualize Outliers // data points that are very different from similarly collected data and might not be reliable values Filtering // extracting specific data that meet certain criteria while hiding the rest Customized sort order // when you sort data in a spreadsheet using multiple conditions The 4 phases of analysis:          1. Organize data // getting the right data in the right size and order                     - Sorting : arrange data in meaningful order                     - Filtering : can help find errors or outliers          2. Format and adjust data // filtering or sorting or compiling data in a better
Read more

3. Algorithms - Selection Sort

Selection sort sorts an array by finding the lowest value element and appending it to an empty array. The algorithm will shrink the unsorted array and repeat the process recursively until all unsorted elements are used up. package main func selectionSort (list *[] int ) {     sorted := make ([] int , 0 , len (*list))     unSorted := *list     for i := 0 ; i < len (*list); i++ {         min := unSorted[ 0 ]         index := 0         for i , e := range unSorted {             if e <= min {                 min = e                 index = i             }         }         sorted = append (sorted, (unSorted)[index])         if index == 0 {             unSorted = unSorted[ 1 :]         } else if index == ( len (*list) - 1 ) {             unSorted = unSorted[:index]         } else {             unSorted = append (unSorted[ 0 :index], unSorted[index+ 1 :]...)         }     }     * list = sorted } /*func main() {     x := []int{4, 6, 3, 2, 9, 7, 3, 5}     fmt.Print
Read more