25. Data Analytics - Share Data Through the Art of Visualization - Week 2

 Learning Tableau.

*Tableau alternatives: Looker, Google Data Studio

https://public.tableau.com/s/


Definition:

Tableau // business intelligence and analytics platform that helps people see, understand, and make decisions with data

Dynamic visualizations // visualizations that are interactive or change over time

Diverging color palette // displays two ranges of values using color intensity to show the magnitude of the number and the actual color to show which range the number is from


Tableau Terms:

        - Joining // refers to process of combining data sources based on common fields.

        - Relationships // allow you to combine multiple data sources in Tableau.

        - Data blending // another method to combine multiple data sources.


Tableau Joins:

        - Inner Join // SQL function that returns records with matching values in both tables

        - Outer Join // SQL function that combines RIGHT and LEFT JOINs to return all matching

                                records in both tables.


Tableau Data Type Icons:

        - # // numeric data

        - Abc // string data

        - Globe // geographic data

        - calendar // date data

        - calendar with a clock // date and time data


Tableau Don'ts:

        - Don't use color in the wrong way

        - Don't use too many labels

        - Don't structure the chart in a messy way


Additional Resources:

https://public.tableau.com/profile/grow.with.google#!/

https://www.tutorialspoint.com/excel_charts/excel_charts_types.htm

https://towardsdatascience.com/the-ultimate-cheat-sheet-on-tableau-charts-642bca94dde5

http://www.tableau.com/sites/default/files/media/which_chart_v6_final_0.pdf

https://help.tableau.com/current/pro/desktop/en-us/datasource_prepare.htm

https://help.tableau.com/current/pro/desktop/en-us/joining_tables.htm

https://help.tableau.com/v2020.2/pro/desktop/en-us/datasource_dont_be_scared.htm

https://help.tableau.com/current/online/en-us/datasource_relationships_learnmorepage.htm

https://help.tableau.com/current/pro/desktop/en-us/multiple_connections.htm

https://kb.tableau.com/articles/howto/combining-start-and-end-dates-into-a-single-axis


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