Chapter 1: Data Warehousing and Mining

■ Data Warehouse: Basic Concepts

■ Data Warehouse Modeling: Data Cube and OLAP
■ Data Warehouse Design and Usage
■ Data Warehouse Implementation
■ Data Generalization by Attribute-Oriented
Induction
■ Summary

1
 What is a Data Warehouse?
■ Defined in many different ways, but not rigorously.
■ A decision support database that is maintained separately from
the organization’s operational database
■ Support information processing by providing a solid platform of
consolidated, historical data for analysis.
■ “A data warehouse is a subject-oriented, integrated, time-variant,
and nonvolatile collection of data in support of management’s
decision-making process.”—W. H. Inmon
■ Data warehousing:
■ The process of constructing and using data warehouses

2
 Data Warehouse—Subject-Oriented

■ Organized around major subjects, such as customer,

product, sales
■ Focusing on the modeling and analysis of data for
decision makers, not on daily operations or transaction
processing
■ Provide a simple and concise view around particular
subject issues by excluding data that are not useful in the
decision support process

3
 Data Warehouse—Integrated

■ Constructed by integrating multiple, heterogeneous data

sources
■ relational databases, flat files, on-line transaction

records
■ Data cleaning and data integration techniques are
applied.
■ Ensure consistency in naming conventions, encoding

structures, attribute measures, etc. among different

data sources
■ E.g., Hotel price: currency, tax, breakfast covered, etc.
■ When data is moved to the warehouse, it is
converted.

4
 Data Warehouse—Time Variant

■ The time horizon for the data warehouse is significantly

longer than that of operational systems
■ Operational database: current value data
■ Data warehouse data: provide information from a
historical perspective (e.g., past 5-10 years)
■ Every key structure in the data warehouse
■ Contains an element of time, explicitly or implicitly
■ But the key of operational data may or may not
contain “time element”

5
 Data Warehouse—Nonvolatile
■ A physically separate store of data transformed from the
operational environment
■ Operational update of data does not occur in the data
warehouse environment
■ Does not require transaction processing, recovery,
and concurrency control mechanisms
■ Requires only two operations in data accessing:
■ initial loading of data and access of data

6
 OLTP vs. OLAP

■ OLTP (Online Transaction Processing) manages

day-to-day operations with fast, simple
transactions.
■ OLAP (Online Analytical Processing) handles
complex, multidimensional analysis for business
intelligence and reporting on historical data.

* Data Mining: Concepts and Techniques 7

OLTP vs. OLAP

8
 Why a Separate Data Warehouse?
■ High performance for both systems
■ DBMS— tuned for OLTP: access methods, indexing, concurrency
control, recovery
■ Warehouse—tuned for OLAP: complex OLAP queries,
multidimensional view, consolidation
■ Different functions and different data:
■ missing data: Decision support requires historical data which
operational DBs do not typically maintain
■ data consolidation: DS requires consolidation (aggregation,
summarization) of data from heterogeneous sources
■ data quality: different sources typically use inconsistent data
representations, codes and formats which have to be reconciled
■ Note: There are more and more systems which perform OLAP
analysis directly on relational databases
9
Data Warehouse: A Multi-Tiered Architecture

Monitor
& OLAP Server
Other Metadata
Integrato
sources r
Analysis
Operational Extract Query
DBs Transform Data Serve Reports
Load
Refresh
Warehouse Data mining

Data Marts

Data Sources Data OLAP Engine Front-End

Storage Tools 10
 Three Data Warehouse Models
■ Enterprise warehouse
■ collects all of the information about subjects spanning

the entire organization

■ Data Mart
■ a subset of corporate-wide data that is of value to a

specific groups of users. Its scope is confined to

specific, selected groups, such as marketing data mart
■ Independent vs. dependent (directly from warehouse) data mart
■ Virtual warehouse
■ A set of views over operational databases

■ Only some of the possible summary views may be

materialized
11
 Extraction, Transformation, and Loading (ETL)
■ Data extraction
■ get data from multiple, heterogeneous, and external
sources
■ Data cleaning
■ detect errors in the data and rectify them when possible

■ Data transformation
■ convert data from legacy or host format to warehouse
format
■ Load
■ sort, summarize, consolidate, compute views, check
integrity, and build indicies and partitions
■ Refresh
■ propagate the updates from the data sources to the
warehouse
12
 Metadata Repository
■ Meta data is the data defining warehouse objects. It stores:
■ Description of the structure of the data warehouse
■ schema, view, dimensions, hierarchies, derived data defn, data
mart locations and contents
■ Operational meta-data
■ data lineage (history of migrated data and transformation path),
currency of data (active, archived, or purged), monitoring
information (warehouse usage statistics, error reports, audit trails)
■ The algorithms used for summarization
■ The mapping from operational environment to the data warehouse
■ Data related to system performance
■ warehouse schema, view and derived data definitions
■ Business data
■ business terms and definitions, ownership of data, charging policies
13
 Chapter 1: Data Warehousing and Mining

■ Data Warehouse: Basic Concepts

■ Data Warehouse Modeling: Data Cube and OLAP
■ Data Warehouse Design and Usage
■ Data Warehouse Implementation
■ Data Generalization by Attribute-Oriented
Induction
■ Summary

14
 From Tables and Spreadsheets to
Data Cubes
■ A data warehouse is based on a multidimensional data model
which views data in the form of a data cube
■ A data cube, such as sales, allows data to be modeled and viewed in
multiple dimensions
■ Dimension tables, such as item (item_name, brand, type), or
time(day, week, month, quarter, year)
■ Fact table contains measures (such as dollars_sold) and keys
to each of the related dimension tables
■ In data warehousing literature, an n-D base cube is called a base
cuboid. The top most 0-D cuboid, which holds the highest-level of
summarization, is called the apex cuboid. The lattice of cuboids
forms a data cube.

15
 Cube: A Lattice of Cuboids

all
0-D (apex) cuboid

time item location supplier

1-D cuboids

time,location item,location location,supplier

time,item 2-D cuboids
time,supplier item,supplier

time,location,supplier
3-D cuboids
time,item,location
time,item,supplier item,location,supplier

4-D (base) cuboid

time, item, location, supplier

16
 Conceptual Modeling of Data Warehouses
■ Modeling data warehouses: dimensions & measures
■ Star schema: A fact table in the middle connected to a
set of dimension tables
■ Snowflake schema: A refinement of star schema
where some dimensional hierarchy is normalized into a
set of smaller dimension tables, forming a shape
similar to snowflake
■ Fact constellations: Multiple fact tables share
dimension tables, viewed as a collection of stars,
therefore called galaxy schema or fact constellation

17
 Example of Star Schema
time
time_key item
day item_key
day_of_the_week Sales Fact Table item_name
month brand
quarter time_key type
year supplier_type
item_key
branch_key
branch location
location_key
branch_key location_key
branch_name units_sold street
branch_type city
dollars_sold state_or_province
country
avg_sales
Measures

18
 Example of Snowflake Schema
time
time_key item
day item_key supplier
day_of_the_week Sales Fact Table item_name supplier_key
month brand supplier_type
quarter time_key type
year item_key supplier_key

branch_key
branch location
location_key
location_key
branch_key
units_sold street
branch_name
city_key
branch_type
dollars_sold city
city_key
avg_sales city
state_or_province
Measures country

19
 Example of Fact Constellation
time
time_key item Shipping Fact Table
day item_key
day_of_the_week Sales Fact Table item_name time_key
month brand
quarter time_key type item_key
year supplier_type shipper_key
item_key
branch_key from_location

branch location_key location to_location

branch_key location_key dollars_cost
branch_name
units_sold
street
branch_type dollars_sold city units_shipped
province_or_state
avg_sales country shipper
Measures shipper_key
shipper_name
location_key
shipper_type 20
 A Concept Hierarchy:
Dimension (location)

all all

region Europe ... North_America

country Germany ... Spain Canada ... Mexico

city Frankfurt ... Vancouver ... Toronto

office L. Chan ... M. Wind

21
Differences between operational database
systems and data warehouse

Operational Database Data Warehouse

Aspect
System (OLTP) (OLAP)
Supports day-to-day Supports decision making
Purpose
business operations & analysis
Online Transaction Online Analytical
Type of Processing
Processing (OLTP) Processing (OLAP)
Data Nature Current, up-to-date data Historical data
Insert, Update, Delete
Operations Read-only (rare updates)
(frequent)
Complex, long analytical
Query Type Simple, short queries
queries
Data Volume Small to moderate Very large
Normalization Highly normalized Denormalized
Response Time Very fast for transactions Optimized for analysis
Clerks, operators, Managers, analysts,
Users
end-users decision-makers
Banking system, ERP, Sales analysis, BI reports,
Examples
Billing system dashboards

22
 Question 1: Star Schema
A retail company wants to analyze its sales performance.
The company wants to track:
■Total sales amount

■Number of products sold

■Sales over time

■Sales by customer and region

The following data is available:

Product (Product_ID, Product_Name, Category, Price)
Customer (Customer_ID, Customer_Name, City, State)
Time (Date, Month, Quarter, Year)
Sales (Sales_ID, Product_ID, Customer_ID, Date, Quantity, Total_Amount)

Identify the Fact Table, Dimension Tables andd draw a neat diagram of the Star
Schema.

* Data Mining: Concepts and Techniques 23

 Question 2: Snowflake Schema
A university wants to analyze student performance across departments.
The analysis requires:
■Average marks

■Performance by department and course

■Year-wise results

Available data:
Student (Student_ID, Name, Course_ID)
Course (Course_ID, Course_Name, Dept_ID)
Department (Dept_ID, Dept_Name)
Time (Date, Month, Year)
Marks (Student_ID, Course_ID, Date, Marks)
[Link] the Fact Table

[Link] the dimension tables

[Link] a Snowflake Schema

[Link] the Snowflake Schema diagram

* Data Mining: Concepts and Techniques 24

 Question 3: Star vs Snowflake
Design both Star and Snowflake schemas for an
E-commerce Order Analysis System where analysis is
required by:
■Product category

■Customer location

■Order date

■Sales amount

1. Draw Star Schema

2. Convert Star Schema into Snowflake Schema

* Data Mining: Concepts and Techniques 25

 Data Cube Measures: Three Categories

■ Distributive: if the result derived by applying the function

to n aggregate values is the same as that derived by
applying the function on all the data without partitioning
■ E.g., count(), sum(), min(), max()
■ Algebraic: if it can be computed by an algebraic function
with M arguments (where M is a bounded integer), each of
which is obtained by applying a distributive aggregate
function
■ E.g., avg(), min_N(), standard_deviation()
■ Holistic: if there is no constant bound on the storage size
needed to describe a subaggregate.
■ E.g., median(), mode(), rank()
26
View of Warehouses and Hierarchies

Specification of hierarchies
■ Schema hierarchy
day < {month < quarter;
week} < year
■ Set_grouping hierarchy
{1..10} < inexpensive

27
 Multidimensional Data

■ Sales volume as a function of product, month,

and region
Dimensions: Product, Location, Time
Hierarchical summarization paths
on
gi
Re

Industry Region Year

Category Country Quarter

Product

Product City Month Week

Office Day

Month
28
 A Sample Data Cube

Total annual sales

Date of TVs in U.S.A.
1Qtr 2Qtr 3Qtr sum
t

4Qtr
uc

TV
od

PC U.S.A
Pr

VCR

Country
sum
Canada

Mexico

sum

29
 Cuboids Corresponding to the Cube

all
0-D (apex) cuboid
product date country
1-D cuboids

product,date product,country date, country

2-D cuboids

3-D (base) cuboid

product, date, country

30
 Typical OLAP Operations
■ Roll up (drill-up): summarize data
■ by climbing up hierarchy or by dimension reduction
■ Drill down (roll down): reverse of roll-up
■ from higher level summary to lower level summary or
detailed data, or introducing new dimensions
■ Slice and dice: project and select
■ Pivot (rotate):
■ reorient the cube, visualization, 3D to series of 2D planes
■ Other operations
■ drill across: involving (across) more than one fact table
■ drill through: through the bottom level of the cube to its
back-end relational tables (using SQL)

31
Fig. 3.10 Typical OLAP
Operations

32
 OLAP Operations

1. Roll-up/Drill Up
Roll-up performs
aggregation on a data
cube in any of the
following ways
■By climbing up a
concept hierarchy for a
dimension
■By dimension reduction

* Data Mining: Concepts and Techniques 33

 OLAP Operations

■ Roll-up is performed by climbing up a concept

hierarchy for the dimension location.
■ Initially the concept hierarchy was "street < city
< province < country".
■ On rolling up, the data is aggregated by
ascending the location hierarchy from the level of
city to the level of country.
■ The data is grouped into cities rather than
countries.
■ When roll-up is performed, one or more
dimensions from the data cube are removed
* Data Mining: Concepts and Techniques 34
 OLAP Operations

2. Roll
Down/Drill-down
■Drill-down is the
reverse operation of
roll-up. It is performed
by either of the
following ways −
■By stepping down a
concept hierarchy for a
dimension
■By introducing a new

dimension.

* Data Mining: Concepts and Techniques 35

 OLAP Operations

■ Drill-down is performed by stepping down a

concept hierarchy for the dimension time.
■ Initially the concept hierarchy was "day < month
< quarter &lt year."
■ On drilling down, the time dimension is
descended from the level of quarter to the level
of month.
■ When drill-down is performed, one or more
dimensions from the data cube are added.
■ It navigates the data from less detailed data to
highly detailed data.
* Data Mining: Concepts and Techniques 36
 OLAP Operations

3. Slice
■The slice operation selects
one particular dimension
from a given cube and
provides a new sub-cube.
Consider the following
diagram that shows how
slice works.

* Data Mining: Concepts and Techniques 37

 OLAP Operations

■ Here Slice is performed for the dimension "time"

using the criterion time = "Q1".
■ It will form a new sub-cube by selecting one or
more dimensions.

* Data Mining: Concepts and Techniques 38

 OLAP Operations

4. Dice
■Dice selects two or
more dimensions from
a given cube and
provides a new
sub-cube.
■Consider the following

diagram that shows the

dice operation.

* Data Mining: Concepts and Techniques 39

 OLAP Operations

■ The dice operation on the cube based on the

following selection criteria involves three
dimensions.
(location = "Toronto" or "Vancouver")
(time = "Q1" or "Q2")
(item =" Mobile" or "Modem")

* Data Mining: Concepts and Techniques 40

 OLAP Operations

5. Pivot
■The pivot operation is
also known as rotation. It
rotates the data axes in
view in order to provide
an alternative
presentation of data.
■Consider the following
diagram that shows the
pivot operation.

* Data Mining: Concepts and Techniques 41

 OLAP Cube

1. The college wants to record the Marks for the

courses completed by students using the
dimensions:
I) Course II)Student III) Time & a measure
Aggregate marks. Create a cube and describe
following OLAP operations : I) Slice II) Dice III)
Roll up IV) Drill Down V)Pivot

* Data Mining: Concepts and Techniques 42

 OLAP Cube

2. Consider a Data Warehouse for a sport

manufacturing company storing sales details of
various sports equipment sold, and the time of the
sale. Using this example describe the following
OLAP operations :
(i) Slice (ii) Dice (iii) Rollup (iv) Drill Down (v) Pivot

* Data Mining: Concepts and Techniques 43

* Data Mining: Concepts and Techniques 44
 A Star-Net Query Model
Customer Orders
Shipping Method
Customer
CONTRACTS
AIR-EXPRESS

ORDER
TRUCK
PRODUCT LINE
Time Product
ANNUALY QTRLY DAILY PRODUCT ITEM PRODUCT GROUP
CITY
SALES PERSON
COUNTRY
DISTRICT
REGION
DIVISION
Location Each circle is
called a footprint Promotion Organization
45
Browsing a Data Cube

■ Visualization
■ OLAP capabilities
■ Interactive manipulation
46
 Chapter 1: Data Warehousing and Mining

■ Data Warehouse: Basic Concepts

■ Data Warehouse Modeling: Data Cube and OLAP
■ Data Warehouse Design and Usage
■ Data Warehouse Implementation
■ Data Generalization by Attribute-Oriented
Induction
■ Summary

47
 Design of Data Warehouse: A Business Analysis
Framework
■ Four views regarding the design of a data warehouse
■ Top-down view
■ allows selection of the relevant information necessary for the
data warehouse
■ Data source view
■ exposes the information being captured, stored, and managed
by operational systems
■ Data warehouse view
■ consists of fact tables and dimension tables
■ Business query view
■ sees the perspectives of data in the warehouse from the view
of end-user

48
 Data Warehouse Design Process
■ Top-down, bottom-up approaches or a combination of both
■ Top-down: Starts with overall design and planning (mature)
■ Bottom-up: Starts with experiments and prototypes (rapid)
■ From software engineering point of view
■ Waterfall: structured and systematic analysis at each step before
proceeding to the next
■ Spiral: rapid generation of increasingly functional systems, short
turn around time, quick turn around
■ Typical data warehouse design process
■ Choose a business process to model, e.g., orders, invoices, etc.
■ Choose the grain (atomic level of data) of the business process
■ Choose the dimensions that will apply to each fact table record
■ Choose the measure that will populate each fact table record

49
 Data Warehouse Development: A
Recommended Approach
Multi-Tier Data
Warehouse
Distributed
Data Marts

Enterprise
Data Data
Data
Mart Mart
Warehouse

Model refinement Model refinement

Define a high-level corporate data model

50
 Data Warehouse Usage
■ Three kinds of data warehouse applications
■ Information processing
■ supports querying, basic statistical analysis, and reporting
using crosstabs, tables, charts and graphs
■ Analytical processing
■ multidimensional analysis of data warehouse data
■ supports basic OLAP operations, slice-dice, drilling, pivoting
■ Data mining
■ knowledge discovery from hidden patterns
■ supports associations, constructing analytical models,
performing classification and prediction, and presenting the
mining results using visualization tools

51
* Data Mining: Concepts and Techniques 52
 From On-Line Analytical Processing (OLAP)
to On Line Analytical Mining (OLAM)
■ Why online analytical mining?
■ High quality of data in data warehouses

■ DW contains integrated, consistent, cleaned data

■ Available information processing structure surrounding

data warehouses
■ ODBC, OLEDB, Web accessing, service facilities,

reporting and OLAP tools

■ OLAP-based exploratory data analysis

■ Mining with drilling, dicing, pivoting, etc.

■ On-line selection of data mining functions

■ Integration and swapping of multiple mining

functions, algorithms, and tasks

53
 Chapter 1: Data Warehousing and Mining

■ Data Warehouse: Basic Concepts

■ Data Warehouse Modeling: Data Cube and OLAP
■ Data Warehouse Design and Usage
■ Data Warehouse Implementation
■ Data Generalization by Attribute-Oriented
Induction
■ Summary

54
 Efficient Data Cube Computation
■ Data cube can be viewed as a lattice of cuboids
■ The bottom-most cuboid is the base cuboid
■ The top-most cuboid (apex) contains only one cell
■ How many cuboids in an n-dimensional cube with L
levels?

■ Materialization of data cube

■ Materialize every (cuboid) (full materialization),
none (no materialization), or some (partial
materialization)
■ Selection of which cuboids to materialize
■ Based on size, sharing, access frequency, etc.
55
 The “Compute Cube” Operator
■ Cube definition and computation in DMQL
define cube sales [item, city, year]: sum (sales_in_dollars)
compute cube sales
■ Transform it into a SQL-like language (with a new operator cube
by, introduced by Gray et al.’96) ()
SELECT item, city, year, SUM (amount)
FROM SALES (city) (item) (year)
CUBE BY item, city, year
■ Need compute the following Group-Bys
(date, product, customer), (city, item) (city, year) (item, year)
(date,product),(date, customer), (product, customer),
(date), (product), (customer) (city, item, year)
()
56
 Indexing OLAP Data: Bitmap Index
■ Index on a particular column
■ Each value in the column has a bit vector: bit-op is fast
■ The length of the bit vector: # of records in the base table
■ The i-th bit is set if the i-th row of the base table has the value for
the indexed column
■ not suitable for high cardinality domains
■ A recent bit compression technique, Word-Aligned Hybrid (WAH),
makes it work for high cardinality domain as well [Wu, et al. TODS’06]
Base table Index on Region Index on Type

57
 Indexing OLAP Data: Join Indices

■ Join index: JI(R-id, S-id) where R (R-id, …) 

S (S-id, …)
■ Traditional indices map the values to a list of
record ids
■ It materializes relational join in JI file and
speeds up relational join
■ In data warehouses, join index relates the values
of the dimensions of a start schema to rows in
the fact table.
■ E.g. fact table: Sales and two dimensions city
and product
■ A join index on city maintains for each

distinct city a list of R-IDs of the tuples

recording the Sales in the city
■ Join indices can span multiple dimensions

58
 Efficient Processing OLAP Queries
■ Determine which operations should be performed on the available cuboids
■ Transform drill, roll, etc. into corresponding SQL and/or OLAP operations,
e.g., dice = selection + projection
■ Determine which materialized cuboid(s) should be selected for OLAP op.
■ Let the query to be processed be on {brand, province_or_state} with the
condition “year = 2004”, and there are 4 materialized cuboids available:
1) {year, item_name, city}
2) {year, brand, country}
3) {year, brand, province_or_state}
4) {item_name, province_or_state} where year = 2004
Which should be selected to process the query?
■ Explore indexing structures and compressed vs. dense array structs in MOLAP

59
 OLAP Server Architectures

■ Relational OLAP (ROLAP)

■ Use relational or extended-relational DBMS to store and manage
warehouse data and OLAP middle ware
■ Include optimization of DBMS backend, implementation of
aggregation navigation logic, and additional tools and services
■ Greater scalability
■ Multidimensional OLAP (MOLAP)
■ Sparse array-based multidimensional storage engine
■ Fast indexing to pre-computed summarized data
■ Hybrid OLAP (HOLAP) (e.g., Microsoft SQLServer)
■ Flexibility, e.g., low level: relational, high-level: array
■ Specialized SQL servers (e.g., Redbricks)
■ Specialized support for SQL queries over star/snowflake schemas

60
 Chapter 1: Data Warehousing and Mining

■ Data Warehouse: Basic Concepts

■ Data Warehouse Modeling: Data Cube and OLAP
■ Data Warehouse Design and Usage
■ Data Warehouse Implementation
■ Data Generalization by Attribute-Oriented
Induction
■ Summary

61
 Attribute-Oriented Induction

■ Proposed in 1989 (KDD ‘89 workshop)

■ Not confined to categorical data nor particular measures
■ How it is done?
■ Collect the task-relevant data (initial relation) using a
relational database query
■ Perform generalization by attribute removal or attribute
generalization
■ Apply aggregation by merging identical, generalized
tuples and accumulating their respective counts
■ Interaction with users for knowledge presentation

62
 Attribute-Oriented Induction: An Example
Example: Describe general characteristics of graduate
students in the University database
■ Step 1. Fetch relevant set of data using an SQL
statement, e.g.,
Select * (i.e., name, gender, major, birth_place,
birth_date, residence, phone#, gpa)
from student
where student_status in {“Msc”, “MBA”, “PhD” }
■ Step 2. Perform attribute-oriented induction
■ Step 3. Present results in generalized relation, cross-tab,
or rule forms

63
 Class Characterization: An Example

Initial
Relation

Prime
Generalized
Relation

64
 Basic Principles of Attribute-Oriented Induction

■ Data focusing: task-relevant data, including dimensions,

and the result is the initial relation
■ Attribute-removal: remove attribute A if there is a large set
of distinct values for A but (1) there is no generalization
operator on A, or (2) A’s higher level concepts are
expressed in terms of other attributes
■ Attribute-generalization: If there is a large set of distinct
values for A, and there exists a set of generalization
operators on A, then select an operator and generalize A
■ Attribute-threshold control: typical 2-8, specified/default
■ Generalized relation threshold control: control the final
relation/rule size
65
 Attribute-Oriented Induction: Basic Algorithm

■ InitialRel: Query processing of task-relevant data, deriving

the initial relation.
■ PreGen: Based on the analysis of the number of distinct
values in each attribute, determine generalization plan for
each attribute: removal? or how high to generalize?
■ PrimeGen: Based on the PreGen plan, perform
generalization to the right level to derive a “prime
generalized relation”, accumulating the counts.
■ Presentation: User interaction: (1) adjust levels by drilling,
(2) pivoting, (3) mapping into rules, cross tabs,
visualization presentations.

66
 Presentation of Generalized Results
■ Generalized relation:
■ Relations where some or all attributes are generalized, with counts
or other aggregation values accumulated.
■ Cross tabulation:
■ Mapping results into cross tabulation form (similar to contingency
tables).
■ Visualization techniques:
■ Pie charts, bar charts, curves, cubes, and other visual forms.
■ Quantitative characteristic rules:
■ Mapping generalized result into characteristic rules with quantitative
information associated with it, e.g.,

67
 Mining Class Comparisons

■ Comparison: Comparing two or more classes

■ Method:
■ Partition the set of relevant data into the target class and the
contrasting class(es)
■ Generalize both classes to the same high level concepts
■ Compare tuples with the same high level descriptions
■ Present for every tuple its description and two measures
■ support - distribution within single class
■ comparison - distribution between classes
■ Highlight the tuples with strong discriminant features
■ Relevance Analysis:
■ Find attributes (features) which best distinguish different classes

68
 Concept Description vs. Cube-Based OLAP
■ Similarity:
■ Data generalization
■ Presentation of data summarization at multiple levels of
abstraction
■ Interactive drilling, pivoting, slicing and dicing
■ Differences:
■ OLAP has systematic preprocessing, query independent,

and can drill down to rather low level

■ AOI has automated desired level allocation, and may

perform dimension relevance analysis/ranking when

there are many relevant dimensions
■ AOI works on the data which are not in relational forms

69
 Chapter 1: Data Warehousing and Mining

■ Data Warehouse: Basic Concepts

■ Data Warehouse Modeling: Data Cube and OLAP
■ Data Warehouse Design and Usage
■ Data Warehouse Implementation
■ Data Generalization by Attribute-Oriented
Induction
■ Summary

70
 Summary
■ Data warehousing: A multi-dimensional model of a data warehouse
■ A data cube consists of dimensions & measures
■ Star schema, snowflake schema, fact constellations
■ OLAP operations: drilling, rolling, slicing, dicing and pivoting
■ Data Warehouse Architecture, Design, and Usage
■ Multi-tiered architecture
■ Business analysis design framework
■ Information processing, analytical processing, data mining, OLAM (Online
Analytical Mining)
■ Implementation: Efficient computation of data cubes
■ Partial vs. full vs. no materialization
■ Indexing OALP data: Bitmap index and join index
■ OLAP query processing
■ OLAP servers: ROLAP, MOLAP, HOLAP
■ Data generalization: Attribute-oriented induction

71