Skip to main content

DATA WARE HOUSING AND DATA MINING - R20- III Year –I Semester - JNTUK

UNIT –I: Data Warehousing and Online Analytical Processing: Data Warehouse: Basic concepts, Data Warehouse Modelling: Data Cube and OLAP, Data Warehouse Design and Usage, Data Warehouse Implementation, Introduction: Why and What is data mining, What kinds of data need to be mined and patterns can be mined, Which technologies are used, Which kinds of applications are targeted.

Unit-1 material

UNIT –II: Data Pre-processing: An Overview, Data Cleaning, Data Integration, Data Reduction, Data Transformation and Data Discretization.

UNIT –III: Classification: Basic Concepts, General Approach to solving a classification problem, Decision Tree Induction: Attribute Selection Measures, Tree Pruning, Scalability and Decision Tree Induction, Visual Mining for Decision Tree Induction.

Unit-3 Material

UNIT –IV: Association Analysis: Problem Definition, Frequent Item set Generation, Rule Generation: Confident Based Pruning, Rule Generation in Apriori Algorithm, Compact Representation of frequent item sets, FPGrowth Algorithm.

Unit-4 Material

UNIT –V Cluster Analysis: Overview, Basics and Importance of Cluster Analysis, Clustering techniques, Different Types of Clusters; K-means: The Basic K-means Algorithm, K-means Additional Issues, Bi-secting K Means,

Comments

Popular posts from this blog

Data structures: Introduction to Trees

Tree: The data in a tree are not stored in a sequential manner i.e., they are not stored linearly. Instead, they are arranged on multiple levels or we can say it is a hierarchical structure. For this reason, the tree is considered to be a non-linear data structure. KeyConcepts : Nodes : Individual units within the tree, each storing data and potentially linking to other nodes. Edges : Connections between nodes, representing relationships (parent-child, sibling, etc.). Root : The topmost node in the tree, from which all other nodes originate. Parent : A node that has one or more child nodes. Child : A node connected to a parent node. Leaf : A node with no children. Subtree : A portion of a tree that is itself a tree. Representation of tree: Binary search tree :

Hashing and hash functions

Types of hash functions

Data structures dequeues