Computer Engineering is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Computer Engineering

Data Mining and Data Warehousing

Preprocessing, warehouses and OLAP, association rules, clustering, classification.

Interview questions
Your progress in this subject0 of 22 · 0%
  1. 1Data mining and the KDD processOverview of Data Mining and the KDD (Knowledge Discovery in Databases) process: definitions, steps, key tasks, formulas (support/confidence/lift, entropy, information gain), worked examples, common exam mistakes and practice questions.
  2. 2Attribute and data typesClear definitions and rules for attribute and data types (nominal, ordinal, interval, ratio; categorical vs numerical; discrete vs continuous), what operations and statistics are valid on each, encoding methods, examples and exam guidance.
  3. 3Data cleaning and integrationPractical and exam-focused notes on data cleaning (handling missing, noisy, inconsistent, duplicate data) and data integration (schema matching, record linkage, conflict resolution), with definitions, formulas, worked examples and common mistakes.
  4. 4Data reduction and discretisationStudy notes on data reduction and discretisation: why they are used, main methods (numerosity reduction, dimensionality reduction, binning, supervised and unsupervised discretisation), formulas, worked examples (equal-width, equal-frequency, ChiMerge), common mistakes and exam guidance.
  5. 5Normalisation and distance measuresNormalisation rescales attributes to a common range; distance measures (Euclidean, Manhattan, Minkowski, cosine, Hamming, etc.) quantify similarity or dissimilarity between records — both are essential before distance-based data mining (clustering, k-NN) to avoid bias from scale or type differences.
  6. 6Data warehouse concepts and architectureClear, exam-focused notes on data warehouse concepts and architecture: definitions, architectures, components, diagrams to draw, formulas, worked numerical ETL/storage examples, common mistakes and exam tips.
  7. 7ETL and the metadata repositoryClear, exam-focused notes on ETL (Extract, Transform, Load) processes and the metadata repository: definitions, architecture, types of metadata, design guidelines, performance sizing formulas, worked examples, common mistakes, and exam pointers.
  8. 8Data cubes and OLAPData cubes and OLAP let engineers pre-aggregate and explore multidimensional data quickly by organizing measures along dimensions and performing operations such as roll-up, drill-down, slice, dice and pivot.
  9. 9Star, snowflake and fact constellation schemasClear study notes on star, snowflake and fact-constellation (galaxy) schemas: definitions, design rules, storage/performance trade-offs, worked design and cost examples, exam tips and quick checks.
  10. 10OLAP operationsOLAP operations let engineers explore and summarise multi-dimensional data (data cubes) using operations like roll-up, drill-down, slice, dice and pivot; these notes define each operation, give the algebra and formulae, worked examples, common exam mistakes and quick checks.
  11. 11Frequent itemsets and association rulesFrequent itemsets and association rules find which item combinations appear often in transaction data and which implication rules (X → Y) are strong, using measures such as support, confidence and lift and algorithms such as Apriori.
  12. 12Apriori algorithmApriori is the classical algorithm for finding frequent itemsets and deriving association rules from transaction data using the downward-closure (Apriori) property to prune candidates.
  13. 13Cluster analysis: K-means and K-medoidsK-means and K-medoids are partitioning clustering methods: K-means uses cluster centroids (means) to minimize sum of squared Euclidean distances and is fast but sensitive to outliers; K-medoids uses actual data points (medoids) to minimize sum of pairwise dissimilarities and is robust to noise.
  14. 14Evaluating clustersHow to measure the quality of clusters using internal, external and relative validity measures (SSE/WCSS, TSS/BSS, silhouette, Dunn, Davies–Bouldin, Rand index, purity, etc.), with formulas, derivations and worked examples.
  15. 15Decision tree inductionDecision tree induction: principles (entropy, impurity), attribute selection (information gain, gain ratio, Gini), handling continuous/missing data, pruning, algorithms (ID3, C4.5, CART) with worked traces and exam tips.
  16. 16Bayes and naive Bayes classificationBayes theorem gives a way to update class probabilities from evidence; naive Bayes uses a conditional-independence assumption to make classification simple, fast and effective for many engineering problems like spam detection and fault diagnosis.
  17. 17Rule-based classificationRule-based classification builds human-readable if–then rules from labeled data and is used in expert systems, fast interpretable models, and as a post-processing step for other learners.
  18. 18k-nearest neighbour classificationk-nearest neighbour (k-NN) classification is a simple, non-parametric method that labels a query by majority vote of its k closest training examples using a chosen distance measure, widely used for prototype-based classification and baseline models in engineering tasks.
  19. 19Ensembles: bagging and boostingEnsemble methods combine many simple models (base learners) to make a stronger predictor; bagging reduces variance by bootstrap aggregation while boosting sequentially reweights data to reduce error and bias (AdaBoost is the main algorithm).
  20. 20Text, stream, spatial and temporal miningPractical study notes on mining unstructured text, high-speed streams, spatial data and temporal (time-series) data: definitions, key algorithms, formulas, worked examples and exam guidance.
  21. 21Web mining and recommender systemsWeb mining (content, structure, usage) finds patterns from the Web; recommender systems (content-based, collaborative, matrix factorization) predict items users will like and are evaluated by accuracy and ranking metrics.
  22. 22Mining sequences, graphs and networksCovers definitions, algorithms and measures used to mine sequential patterns, and to mine and analyse graphs and networks (frequent subsequences, PrefixSpan, graph metrics, PageRank, frequent subgraphs, modularity and link prediction).

Coming next in Data Mining and Data Warehousing

  1. FP-growth algorithm· notes coming
  2. Evaluating classifiers: holdout, cross-validation and bootstrap· notes coming
  3. Principal component analysis for data reduction· notes coming
  4. Hierarchical and density-based clustering· notes coming
  5. Enterprise warehouses and data marts· notes coming
  6. Data mining functionalities and task primitives· notes coming
  7. Correlation analysis and constraint-based association mining· notes coming
  8. Support vector machines and regression models for prediction· notes coming
  9. Business intelligence: tools, infrastructure and applications· notes coming
  10. BI versus data warehousing and data mining· notes coming
  11. Data cube computation and multidimensional analysis· notes coming
  12. Sampling, partitioning and parallel association rule algorithms· notes coming