Short Notes on Data Processing and Machine Learning
### Linear Algebra Basics
1. **Matrices to Represent Relations Between Data**:
- Matrix: Organizes data as rows (samples) and columns (features).
- Example: Adjacency matrix for graphs.
2. **Linear Algebra Operations**:
- Addition/Subtraction, Multiplication, Transpose, Inverse.
3. **Matrix Decomposition**:
- Singular Value Decomposition (SVD): A = U * Sigma * V^T. Applications: Dimensionality reduction.
- Principal Component Analysis (PCA): Captures maximum variance in fewer dimensions.
### Data Pre-processing and Feature Selection
1. **Data Pre-processing**:
- Cleaning: Handle missing values, remove duplicates.
- Integration: Merge datasets from multiple sources.
- Reduction: Sampling, aggregation.
- Transformation: Scaling, normalization; Discretization: Bin continuous data.
2. **Feature Selection**:
- Filters: Use statistical tests (e.g., correlation) to rank features.
- Wrappers: Evaluate subsets of features with a model.
- Embedded Methods: Decision Trees, Random Forests for selection.
### Basic Machine Learning Algorithms
1. **Classifiers**:
- Decision Tree: Splits data using feature values.
- Naive Bayes: Probabilistic model based on Bayes' Theorem.
- k-Nearest Neighbors (k-NN): Classifies using k-nearest neighbors.
2. **Clustering**:
- k-Means: Groups data into k clusters minimizing intra-cluster variance.
3. **Advanced Techniques**:
- Support Vector Machine (SVM): Finds optimal hyperplane for classification.
- Association Rule Mining: Discovers relationships (e.g., Market Basket Analysis).
- Ensemble Methods: Combine models (e.g., Random Forests, AdaBoost).