MapReduce is a high-level programming model and implementation for processing large scale parallel data.
40 Posts In Total
Decision Tree algorithm with example.
Accuracy, precision, recall, and f1 are 4 common metrics in classification evaluation.
Apriori Algorithm (Agrawal & Srikant, 1994) is one of scalable methods for mining frequent patterns.
It is a Candidate Generation and Test Approach
According to the downward closure property of frequent patterns: If there is any itemset which is infrequent, its superset should not be generated/tested (Apriori pruning principle)
Frequent pattern is a pattern (a set of items, subsequences, substructures, etc.) that occurs frequently in a data set. It used for finding inherent regularities in data.
A note of Drexel CS520 - CS Foundations
- Deterministic Finite Automaton (DFA)
- Nondeterministic Finite Automaton (NFA)
Linear Regression
Just a overview
Three ‘guess and check’ methods to search square root and cube root.
- Exhaustive Enumeration
- Bisection Search
- Newton-Raphson (for root finding)
Note of Drexel INFO605.
Algorithm
Python
Leetcode
Data Structure
Design
Dynamic Programming
Linked List
Two Pointers
Searching
Stack
Hash Table
Union Find
Data Science
Data Mining
Bash
Shell
Machine Learning
DFA
Computer Science
NFA
RegExp
docker
container
devops
Relational Database
1%