Limited Offer Get 25% off — use code BESTW25
No AI No Plagiarism On-Time Delivery Free Revisions
Claim Now
Prices start at $5 per page · plagiarism-free papers · free revisions for 14 days 24/7 support: support@bestwriters.com
Uncategorized

FROM DATA WAREHOUSING TO DATA MINING

  • Posted
  • Authoradmin
  • Length578 words
  • Reading time3 min
Write My Assignment FREE

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.
 Differences among the three tasks
54
From On-Line Analytical Processing
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.
 Architecture of OLAM

Discovery-Driven Exploration of Data
Cubes
 Hypothesis-driven
 exploration by user, huge search space
 Discovery-driven (Sarawagi, et al.’98)
 Effective navigation of large OLAP data cubes
 pre-compute measures indicating exceptions, guide
user in the data analysis, at all levels of aggregation
 Exception: significantly different from the value
anticipated, based on a statistical model
 Visual cues such as background color are used to
reflect the degree of exception of each cell
57
Kinds of Exceptions and their Computation
 Parameters
 SelfExp: surprise of cell relative to other cells at same
level of aggregation
 InExp: surprise beneath the cell
 PathExp: surprise beneath cell for each drill-down
path
 Computation of exception indicator (modeling fitting and
computing SelfExp, InExp, and PathExp values) can be
overlapped with cube construction
 Exception themselves can be stored, indexed and
retrieved like precomputed aggregates
58
Examples: Discovery-Driven Data Cubes
59
Complex Aggregation at Multiple
Granularities: Multi-Feature Cubes
 Multi-feature cubes (Ross, et al. 1998): Compute complex queries
involving multiple dependent aggregates at multiple granularities
 Ex. Grouping by all subsets of item, region, month, find the
maximum price in 1997 for each group, and the total sales among all
maximum price tuples
select item, region, month, max(price), sum(R.sales)
from purchases
where year = 1997
cube by item, region, month: R
such that R.price = max(price)
 Continuing the last example, among the max price tuples, find the
min and max shelf live, and find the fraction of the total sales due to
tuple that have min shelf life within the set of all max price tuples
60
Cube-Gradient (Cubegrade)
 Analysis of changes of sophisticated measures
in multi-dimensional spaces
 Query: changes of average house price in
Vancouver in ‘00 comparing against ’99
 Answer: Apts in West went down 20%,
houses in Metrotown went up 10%
 Cubegrade problem by Imielinski et al.
 Changes in dimensions  changes in
measures
 Drill-down, roll-up, and mutation
61
From Cubegrade to Multi-dimensional
Constrained Gradients in Data Cubes
 Significantly more expressive than association rules
 Capture trends in user-specified measures
 Serious challenges
 Many trivial cells in a cube  “significance constraint”
to prune trivial cells
 Numerate pairs of cells  “probe constraint” to select
a subset of cells to examine
 Only interesting changes wanted “gradient
constraint” to capture significant changes
62
MD Constrained Gradient Mining
 Significance constraint Csig: (cnt100)
 Probe constraint Cprb: (city=“Van”, cust_grp=“busi”,
prod_grp=“*”)
 Gradient constraint Cgrad(cg, cp):
(avg_price(cg)/avg_price(cp)1.3)

A LiveSet-Driven Algorithm
 Compute probe cells using Csig and Cprb
 The set of probe cells P is often very small
 Use probe P and constraints to find gradients
 Pushing selection deeply
 Set-oriented processing for probe cells
 Iceberg growing from low to high dimensionalities
 Dynamic pruning probe cells during growth
 Incorporating efficient iceberg cubing method
64

The post FROM DATA WAREHOUSING TO DATA MINING appeared first on My Assignment Online.

Plagiarism Free Assignment Help

Expert Help With This Assignment — On Your Terms

✓ Native UK, USA & Australia writers ✓ Deadline from 3 hours ✓ 100% Plagiarism-Free — Turnitin included ✓ Unlimited free revisions ✓ Free to submit — compare quotes

admin

Academic writer and editor at BestWriters.

Get your paper off your plate tonight

Post your instructions for free. Prices start at $5 per page.

Place an order