SIR C.R.

REDDY COLLEGE OF ENGINEERING, ELURU

DEPARTMENT OF INFORMATION TECHNOLOGY
II- Internal test, II-Sem of 2008-09
Subject: : DMDW
Max. Marks 25M
Class : IV/IV I.T. Answer Key
Date of Exam :14-02-09
I. Compulsory
a. Define Data mining query.
A data mining query is defined in terms of the following primitives

Task-relevant data
Database or data warehouse name
Database tables or data warehouse cubes
Task-relevant data selection
Condition for data
Database or data warehouse
Relevant attributes name
or dimensions
Database tables or data warehouse
cubes
Knowledge type to be mined
Condition for dataClustering
Characterization, selection
Relevant attributes or dimensions
Discrimination, Association
Classification/prediction
Knowledge type to be mined
Characterization, Clustering
Discrimination, Association
Classification/prediction
Background knowledge
Concept hierarchies
User beliefs about relationships in the data
Background knowledge
Concept hierarchies
User beliefs about relationships in the
data
Pattern interestingness measures
Simplicity
Certainity (e.g., confidence)
Utility
Novelity

Visualization of discovered patterns

Rules, tables, reports, charts, graphs,
decision trees and cubes.
Drill-down and roll-up

b. Explain the measures of data dispersion?

A. The degree to which numeric data tend to spread is called the dispersion, or variance of the
data. The most common measures of data dispersion are the five-number summary (based on
quartiles), the inter quartile range, and the standard deviation. The plotting of box plots also
serves as a useful graphical method.

1
 A popularly used visual representation of a distribution is the box plot. In a box plot the end
of the box are at the quartiles, so that the box length is the inter quartile range.
c.Explain concept description.
The simplest kind of description data mining is concept description. Concept description is not a
simple enumeration of data. Instead, concept description generates descriptions for
characterization and comparison of the data. It is some times called class description, when the
concept to be described refers to a class of objects characterization provides a concise and
succinct summarization of the given collection of data, while concept or class comparison
provides descriptions comparing two or more collections of data.
d. Define attribute oriented induction.
Proposed in 1989 (KDD ‘89 workshop)
Not confined to categorical data nor particular measures
How it is done?
i. Collect the task-relevant data (initial relation) using a relational database query
ii. Perform generalization by attribute removal or attribute generalization
iii. Apply aggregation by merging identical, generalized tuples and accumulating
their respective counts
iv. Interactive presentation with users
Basic Principles of Attribute-Oriented Induction
i.Data focusing: task-relevant data, including dimensions, and the result is the initial relation
ii.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
iii.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
iv.Attribute-threshold control: typical 2-8, specified/default
v.Generalized relation threshold control: control the final relation/rule size
II. Answer any Three form the following.
1. Explain statistical measures in large data bases?
For many data mining tasks, however, users would like to learn more data characteristics
regarding both central tendency and data dispersion. Measures of central tendency include mean,
median, mode, and midrange, while measures of data dispersion include Quartiles, outliers, and
variance. These descriptive statistics are of great help in understanding the distribution of data.
Measuring the central tendency:

2
 The most common and most effective numerical measure of the “center” of a set of data
is the (arithmetic) mean. Let x 1,x 2 , . . ., x n be a set of n values or observations. The mean of this
set of values is

_ 1 n

x = − ∑ xi .
n i=1

Sometimes , each value of xi in a set may be associated with a weight wi , for i=1,. . .,n.
The weights reflect the significance , importance , or occurrence frequency attached to their
respective values. In this case, we can compute
n

∑ wixi .
i=1
_
x = -------------------
n

∑ wi
i=1

This is called the weighted arithmetic mean or the weighted average.

For skewed data, a better measure of the center of data is the median, M. Suppose that the
values forming a given set of data are numerical order. The median is the middle value of the
ordered set if the number of values n is an add number; otherwise (if n is even), it is the average
of the middle two values.
Although it is not easy to compute the exact median value in a large database, an
approximate median can be effectively computed. For example, for grouped data, the median,
obtained by interpolation, is given by
n/2−(∑f)l
median = L1 + (−−−−−−−−)c,
fmedian
Where L1 is the lower class boundary of the class containing the median, n is the number of
values in the data, (∑f)l is the sum of the frequencies of all of the classes that are lower than the
median class, fmedian is the frequency of the median class, and c is the size of the median class
interval. For uni-modal frequency curves that are moderately skewed, we have the following
empirical relation: mean − mode = 3 × (mean − median)
Measuring the Dispersion of Data:-
The degree to which numeric data tend to spread is called the dispersion, or variance of
the data. The most common measures of the data dispersion are the five number summary, the
3
inter quartile range, and the standard deviation. The plotting of box plots also serves as a useful
graphical method.
Quartiles, Outliers, and Box plots:
The kth percentile of a set of data in numerical order is the value x having the property
that k percent of the data entries lie at or below x. Values at or below the median M correspond
to the 50th percentile.
The most commonly used percentiles other than the median are quartiles. The first
quartile, denoted by Q1, is the 25th percentile; the third quartile, denoted by Q3, is the 75th
percentile. The quartiles, including the median, give some indication of the center, spread, and
shape of a distribution. The distance between the first and third quartiles is a simple measure of
spread that gives the range covered by the middle half of the data. This distance is called the
inter quartile range and is defined as
IQR = Q3 − Q1
One common rule of thumb for identifying suspected outliers is to single out values
falling at lest 1.5×IQR above the third quartile or below the first quartile.
A popularly used visual representation of a distribution is the box plot. In a box plot:
1. Typically, the ends of the box are at the quartiles, so that the box length is the inter quartile
range, IQR.
2. The median is marked by a line within the box.
3. Two lines (called whiskers) outside the box extend to the smallest (Minimum) and largest
(Maximum) observations.
Variance and Standard Deviation:
The variance of n observations x 1,x 2 , . . ., x n is
1 n __ 1 1
------ ---------- ------
s² = ∑ ( xi −x )² = [∑ xi ² − (∑ xi)²]
n−1 i=1 n−1 n

The standard deviation s is the square toot of the variance s².

The basic properties of the standard deviation s as a measure of spread are
1. s measures spread about the mean and should be used only when the mean is chosen as
the measure of center.
2. s=0 only when there is no spread, that is, when all observations have the same value.
Otherwise s>0.
Attribute relevance
Measures of attribute relevance analysis can be used to help identify irrelevant or weakly
relevant attributes that can be excluded from the concept description process. The incorporation

4
of this preprocessing step into class characterization or comparison is referred to as analytical
characterization or analytical comparison, respectively.
The first limitation of class characterization for multidimensional data analysis in data
warehouse and OLAP tools is the handling of complex objects. The second limitation is the lack
of an automated generalization process: the user must explicitly tell the system which
dimensions should be included in the class characterization and to how high a level each
dimension should generalized. Actually, each step of generalization or specialization on any
dimension must be specified by the user.
Methods should be introduced to perform attribute relevance analysis in order to filter out
statistically irrelevant or weakly relevant attributes, and retain or even rank the most relevant
attributes for the descriptive mining task at hand. Class characterization that includes the analysis
of attribute/dimension relevance is called analytical characterization. Class comparison that
includes such analysis is called analytical comparison.
Methods of Attribute Relevance Analysis:
The general idea behind attribute relevance analysis is to compute some measure that is
used to quantify the relevance of an attribute with respect to a given class or concept.
Suppose that there are m classes. Let S contain si samples of class ci, for i=1,…,m. An
arbitrary sample belongs to class ci with probability si/s, where s is the total number of samples in
set S. The expected information needed to classify a given sample is
m si si
I(s1,s2 , . . . , sm ) = − ∑ −− log2 −−
i=1
s s
An attribute A with values {a1,a2,…,av} can be used to partition S into the subsets {S 1,S2,…,Sv},
where Sj contains those samples in S that have value a j of A. Let Sj contain s ij samples of class
Ci. The expected information based on this partitioning by A is known as the entropy of A. It is
the weighted average:
v s1j+ . . . +smj
E(A) = ∑ ------------------ I(s1j , . . ., s mj )
j=1
s
The information gain obtained by this partitioning on A is defined by
Gain(A) = I (s1,s2, . . . , sm ) − E(A)
Attribute relevance analysis for concept description is performed as follows:
a. Data Collection:
Collect data for both the target class and the contrasting class by query
processing. For class comparison, both the target class and the contrasting class are
provided by the user in the data mining query. For class characterization, the target class
5
 is the class to be characterized, whereas the contrasting class is the set of comparable data
that are not in the target class.

b. Preliminary relevance analysis using conservative AOI:

This step identifies a set of dimensions and attributes on which the selected
relevance measure is to be applied. AOI can be used to perform some preliminary
relevance analysis on the data by removing or generalizing attributes having a very large
number of distinct values. Such attributes are unlikely to be found useful for concept
description. To be conservative, the AOI performed here should employ attribute
generalization thresholds that are set reasonably large so as to allow more attributes to be
considered in further relevance analysis by the selected measure. The relation obtained by
such an application of AOI is called the candidate relation of the mining task.
c. Remove irrelevant and weakly relevant attributes using the selected relevance
analysis measure:
Evaluate each attribute in the candidate relation using the selected relevance
analysis measure. This step results in an initial target class working relation and an initial
contrasting class working relation.
d. Generate the concept description using AOI:
Perform AOI using a less conservative set of attribute generalization thresholds.
If the descriptive mining task is class characterization, only the initial target class
working relation is included here. If the descriptive mining task is class comparison, both
the initial target class working relation and the initial contrasting class working relation
are included.
2. Describe Boolean association rules for single dimension data?
Based on the types of values handled in the rule, if a rule concerns associations between the
presence or absence of items, it is a Boolean association rule.
For example:-
Suppose, as manger of an AllElectronics branch, you would like to learn more about the buying
habits of your customers. Specifically ”Which groups or sets of items are customers likely to
purchase on a given trip on the store?”
To answer, market basket analysis may be performed on the retail data of
customer transactions at your store. If we think of the universe as the set of items available at the
store, then each item has a Boolean variable representing the presence or absence of that item.
Each basket can be represented by a Boolean vector of values assigned to these variables. The
Boolean vectors can be analyzed for buying patterns that reflect items that are frequently
6
associated or purchased together. These patterns can be represented in the form of association
rules.
For example, the information that customers who purchase computers also tend to
buy financial management software at the same time is represented in Association rule:
computer => financial_management_software [support=20%, confidence=60%]
support ( A => B)= P(AU B)
confidence (A => B) = P(B/A)
Rules that satisfy minimum support threshold (min_sup) and a minimum confidence threshold
(min_conf) are called strong.
Once the frequent itemsets from transactions in a database D have been found, it is
straightforward to generate strong association rules from them ( where strong association rules
satisfy both minimum support and minimum confidence ). This can be done using the following
equation for confidence, where the conditional probability is expressed in terms of itemset
support count: support_count(AUB)
confidence(A => B) = P(B| A) = ------------------------------------
support_count(A)
Where support_count(AUB) is the number of transactions containing the itemsets AUB, and
support_count(A) is the number of transactions containing the itemset A. Based on this equation
,association rules can be generated as follows:
 for each frequent itemset l, generate all nonempty subsets of l.
 for every nonempty subset s of l, output the rule “s => (l–s)”
support_count(l)

if ---------------------- ≥ min_conf ,
support_count(s)

Where min_conf is the minimum confidence threshold .since the rules are
generated from frequent itemsets, each one automatically satisfies minimum support. Frequent
itemsets can be stored ahead of time in hash tables along with their counts so that they can be
accessed quickly.
In constraint-based mining, mining is performed under the guidance of various kinds of
constraints provided by the users.
These constraints include the following:
Knowledge type constraints:
These specify the type of knowledge to be mined, such as association.
Data constraints:
These specify the set of task-relevant data.
Dimension/level constraints:
7
 These specify the dimension of the data, or levels of the concept hierarchies, to be used.
Interestingness constraints:
These specify thresholds on statistical measures of rule interestingness, such as support
and confidence.
Rule constraints:
These specify the form of rules to be mined. Such constraints may be expressed as meta-
rules (rule templates), as the maximum or minimum number of predicates that can occur in the
rule antecedent or consequent, or as relationships among attributes, attribute values, and/or
aggregates.
The above constraints can be specified using a high-level declarative data mining query
language.
Constraint-based mining allows users to specify the rules to be mined according to their
intention, thereby making the data mining process more effective. In addition, a sophisticated
mining query optimizer can be used to exploit the constraints specified by the user; thereby
making the mining process more efficient. Constraint-based mining encourages interactive
exploratory mining and analysis.
3. How Graphical User Interfaces are designed based on a Data Mining?
A data mining query language provides necessary primitives that allow users to
communicate with data mining systems. However, inexperienced users may find data mining
query languages awkward to use and the syntax difficult to remember.
Instead , users may prefer to communicate with data mining systems through a GUI.
A data mining query language may serve as a core language for data mining system
implementations , providing a basis for the development of GUI’s for effective data mining.
A data mining GUI may consists of the following functional components:
i. Data collection and data mining query composition:
This component allows the user to specify task-relevant data sets and to compose
data mining queries. It is similar to GUI’s used for specification of relational queries.
ii. Presentation of discovered patterns:
This component allows the display of the discovered patterns in various forms
including tables , graphs, charts, curves and other visualization techniques.
iii. Hierarchy specification and manipulation:
This component allows for concept hierarchy specification either manually by the
user or automatically. This component should allow concept hierarchies to be modified by the
user or adjusted automatically based on a given dataset distribution.
iv. Manipulation of data mining primitives:

8
 This component may allow the dynamic adjustment of the data mining thresholds,
as well as the selection , display, and modification of concept hierarchies.
v. Interactive multilevel mining:
This component should allow roll-up or drill-down operations on discovered patterns.
vi. Other miscellaneous information:
This component may include online help manuals, indexed search, debugging,
and other interactive graphical facilities.
4. Suppose that the university course data base for Big University include the following
attributes, student name, address, status(undergraduate, graduate), major and GPA.
a. propose a concept hierarchy for the attributes address, status, major and
GPA.
Ans. Address:

All Universe

India US

AP Karnataka California Newjersy

Hyde Vizag Bang Myso X Y X Y

Status: Big Universities

Under Graduates Graduates

B.A B.Com M.Phil Phd

Major Branches

9
 Science Arts

Physics Chemistry Commerce Economics

GPA:
Good Very Good Excellent
Excelle

0.35 0.5 0.5 0.75 0.75 1.0

b. Write a DMQI query to find the characteristics of students who have an

excellent GPA.

Ans use Big _ Universities _DB

mine characteristics “students”
in relevance to name, address, status, major, and GPA
from student
where GPA in “Excellent”.

c. Write a DMQL query to compare students majoring in science with students

majoring in arts.

Ans use Big _University _DB

mine comparision as “science _ vs _art _students”
in relevance to name, address, status, major, GPA
for “science _students”
where status in “science”
versus “art _students”
where status in “arts _students”
analyze GPA
from student

-----@@@@@@@---

10