Skip to main content

DATA MINING

Data warehouse: 

Introduction to Data warehouse, Difference between operational database systems and Data warehouses. Differences between operational databases systems and data warehouses. 

Multidimensional data model: From Tables and spreadsheets to Data Cubes, stars, Snowflakes, and Fact Constellations schemas for Multidimensional databases. Examples for defining star, snowflake and fact constellation schemas. 

Data Warehouse Architecture: Steps for the design and construction of data warehouses. A three-tier data warehouse architecture. From Data warehousing to data mining: Data warehouse usage, from on-line analytical processing to online analytical mining.

Data Mining Introduction: Data mining-on what kind of data, Relational databases, data warehouses, transactional databases, advanced database systems and advanced database applications. Data mining functionalities, classification of data mining systems, Major issues in data mining. 

Data Pre-processing: Data cleaning: Missing values, Noisy data, inconsistent Data, Data Integration and Transformation: Data Integration, Data transformation Data Reduction: Data cube aggregation, dimensionality reduction, data compression, Numerosity reduction.

Association Rule mining in Large Databases: Association rule mining, mining single dimensional Boolean association rules from transaction databases, Mining multilevel association rules from transaction databases. Mining multidimensional association rules from relational databases. From association mining to correlation analysis. Constraint based association mining.

Classification and Prediction: Issues regarding classification and prediction, Classification by decision tree induction, Bayesian classification, Classification by back propagation, Prediction, classification accuracy.

Cluster Analysis: Types of data in cluster analysis, a categorization of major clustering methods, Partition based methods: K-means, K-medoids. Hierarchical methods: BIRCH, CURE Density-based methods: DBSCAN.

Comments

Post a Comment

Popular posts from this blog

ML Lab Questions

1. Using matplotlib and seaborn to perform data visualization on the standard dataset a. Perform the preprocessing b. Print the no of rows and columns c. Plot box plot d. Heat map e. Scatter plot f. Bubble chart g. Area chart 2. Build a Linear Regression model using Gradient Descent methods in Python for a wine data set 3. Build a Linear Regression model using an ordinary least-squared model in Python for a wine data set  4. Implement quadratic Regression for the wine dataset 5. Implement Logistic Regression for the wine data set 6. Implement classification using SVM for Iris Dataset 7. Implement Decision-tree learning for the Tip Dataset 8. Implement Bagging using Random Forests  9.  Implement K-means Clustering    10.  Implement DBSCAN clustering  11.  Implement the Gaussian Mixture Model  12. Solve the curse of Dimensionality by implementing the PCA algorithm on a high-dimensional 13. Comparison of Classification algorithms  14. Compa...
Post a Comment
Read more

DBSCAN

DBSCAN (Density-Based Spatial Clustering of Applications with Noise) is a popular density-based clustering algorithm that groups data points based on their density in feature space. It’s beneficial for datasets with clusters of varying shapes, sizes, and densities, and can identify noise or outliers. Step 1: Initialize Parameters Define two important parameters: Epsilon (ε) : The maximum distance between two points for them to be considered neighbors. Minimum Points (minPts) : The minimum number of points required in an ε-radius neighborhood for a point to be considered a core point. Step 2: Label Each Point as Core, Border, or Noise For each data point P P P in the dataset: Find all points within the ε radius of P P P (the ε-neighborhood of P P P ). Core Point : If P P P has at least minPts points within its ε-neighborhood, it’s marked as a core point. Border Point : If P P P has fewer than minPts points in its ε-neighborhood but is within the ε-neighborhood of a core point, it’...
Post a Comment
Read more

Gaussian Mixture Model

A Gaussian Mixture Model (GMM) is a probabilistic model used for clustering and density estimation. It assumes that data is generated from a mixture of several Gaussian distributions, each representing a cluster within the dataset. Unlike K-means, which assigns data points to the nearest cluster centroid deterministically, GMM considers each data point as belonging to each cluster with a certain probability, allowing for soft clustering. GMM is ideal when: Clusters have elliptical shapes or different spreads : GMM captures varying shapes and densities, unlike K-means, which assumes clusters are spherical. Soft clustering is preferred : If you want to know the probability of a data point belonging to each cluster (not a hard assignment). Data has overlapping clusters : GMM allows a point to belong partially to multiple clusters, which is helpful when clusters have significant overlap. Applications of GMM Image Segmentation : Used to segment images into regions, where each region can be...
Post a Comment
Read more