Scribd
Upload
553 views18 pages

Data Mining Task Primitives and Major Issues

Uploaded by

Chaitali Nagbhidkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
553 views18 pages

Data Mining Task Primitives and Major Issues

Uploaded by

Chaitali Nagbhidkar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Data Mining Task Primitives

• We can specify a data mining task in the form of a data mining query.
• This query is input to the system.
• A data mining query is defined in terms of data mining primitives.
• These primitives allows us to communicate in an interactive manner with
the data mining system- ,
• - during discovery to direct the mining process or examine the findings

from different angles or depths.


• Designing a comprehensive data mining language is challenging
because data mining covers a wide spectrum of tasks, from data
characterization to evolution analysis.

• Each task has different requirements.

• The design of an effective data mining query language requires a deep


understanding of the power, limitation, and underlying mechanisms of
the various kinds of data mining tasks.

• This facilitates a data mining system's communication with other


information systems and integrates with the overall information
processing environment.
The data mining
primitives specify
the following,
Task Primitives
1. Set of task-relevant data to be mined.
2. Kind of knowledge to be mined.
3. Background knowledge to be used in the discovery
process.
4. Interestingness measures and thresholds for pattern
evaluation.
5. Representation for visualizing the discovered patterns
1. The set of task-relevant data to be mined

• This specifies the portions of the database or the set of data in which the user is
interested.
• This includes the database attributes or data warehouse dimensions of interest
(the relevant attributes or dimensions).
• In a relational database, the set of task-relevant data can be collected via a
relational query involving operations like selection, projection, join, and
aggregation.
2. The kind of knowledge to be mined

• This specifies the data mining functions to be performed, such as


characterization,
• discrimination,
• association or correlation analysis,
• classification,
• prediction,
• clustering,
• outlier analysis, or
• evolution analysis.
3. The background knowledge to be used in the discovery process

• This knowledge about the domain to be mined is useful for guiding the
knowledge discovery process and evaluating the patterns found.
• Concept hierarchies are a popular form of background knowledge, which
allows data to be mined at multiple levels of abstraction.
• Concept hierarchy defines a sequence of mappings from low-level concepts
to higher-level, more general concepts.

Rolling Up - Generalization of data: Allow to view data at more meaningful and


explicit abstractions and makes it easier to understand. It compresses the data,
and it would require fewer input/output operations.

Drilling Down - Specialization of data: Concept values replaced by lower-level


concepts. Based on different user viewpoints, there may be more than one
concept hierarchy for a given attribute or dimension.
An example of a concept hierarchy for the attribute (or dimension) age is shown
below. User beliefs regarding relationships in the data are another form of
background knowledge.
4. The interestingness measures and thresholds for pattern evaluation

• Different kinds of knowledge may have different interesting measures. They


may be used to guide the mining process or, after discovery, to evaluate the
discovered patterns.
• For example, interesting measures for association rules include support and
confidence. Rules whose support and confidence values are below user-
specified thresholds are considered uninteresting.
Simplicity:
Certainty (Confidence):
Utility (Support):
Novelty:
Novel patterns are those that contribute new information or increased
performance to the given pattern set. For example -> A data exception. Another
strategy for detecting novelty is to remove redundant patterns
5. The expected representation for visualizing the discovered patterns

• This refers to the form in which discovered patterns are to be displayed,


which may include rules, tables, cross tabs, charts, graphs, decision
trees, cubes, or other visual representations.
• Users must be able to specify the forms of presentation to be used for
displaying the discovered patterns.
• Some representation forms may be better suited than others for
particular kinds of knowledge.

For example, generalized relations and their corresponding cross tabs or


pie/bar charts are good for presenting characteristic descriptions, whereas
decision trees are common for classification.
Example of Data Mining Task Primitives

Suppose, as a marketing manager of AllElectronics, you would like to classify


customers based on their buying patterns. You are especially interested in
those customers whose salary is no less than $40,000 and who have bought
more than $1,000 worth of items, each of which is priced at no less than $100.

In particular, you are interested in the customer's age, income, the types of
items purchased, the purchase location, and where the items were made. You
would like to view the resulting classification in the form of rules.

This data mining query is expressed in DMQL3 (Data Mining Query language)
as follows, where each line of the query has been enumerated to aid in our
discussion.
This data mining query is expressed in DMQL3 (Data Mining Query
language) as follows,

use database AllElectronics_db


use hierarchy location_hierarchy for T.branch, age_hierarchy for C.age
mine classification as promising_customers
in relevance to C.age, C.income, I.type, I.place_made, T.branch
from customer C, an item I, transaction T
where I.item_ID = T.item_ID and C.cust_ID = T.cust_ID and C.income ≥ 40,000
and I.price ≥ 100
group by T.cust_ID
Data Mining Issues..
1. Mining Methodology and User Interaction Issues
It refers to the following kinds of issues −

• Mining different kinds of knowledge in databases − Different users may be


interested in different kinds of knowledge. Therefore it is necessary for data
mining to cover a broad range of knowledge discovery task.
• Interactive mining of knowledge at multiple levels of abstraction − The data
mining process needs to be interactive because it allows users to focus the
search for patterns, providing and refining data mining requests based on the
returned results.

• Incorporation of background knowledge − To guide discovery process and to


express the discovered patterns, the background knowledge can be used.
Background knowledge may be used to express the discovered patterns not
only in concise terms but at multiple levels of abstraction.
1. Mining Methodology and User Interaction Issues cont.
It refers to the following kinds of issues −

Data mining query languages and ad hoc data mining − Data Mining Query language
that allows the user to describe ad hoc mining tasks, should be integrated with a data
warehouse query language and optimized for efficient and flexible data mining.

Presentation and visualization of data mining results − Once the patterns are
discovered it needs to be expressed in high level languages, and visual representations.
These representations should be easily understandable.

Handling noisy or incomplete data − The data cleaning methods are required to handle
the noise and incomplete objects while mining the data regularities. If the data cleaning
methods are not there then the accuracy of the discovered patterns will be poor.

Pattern evaluation − The patterns discovered should be interesting because either they
represent common knowledge or lack novelty.
2. Performance Issues

There can be performance-related issues such as follows −


Efficiency and scalability of data mining algorithms − In order to effectively
extract the information from huge amount of data in databases, data mining
algorithm must be efficient and scalable.
Parallel, distributed, and incremental mining algorithms − The factors such as
huge size of databases, wide distribution of data, and complexity of data mining
methods motivate the development of parallel and distributed data mining
algorithms. These algorithms divide the data into partitions which is further
processed in a parallel fashion. Then the results from the partitions is merged.
The incremental algorithms, update databases without mining the data again
from scratch.
3. Diverse Data Types Issues

Handling of relational and complex types of data − The


database may contain complex data objects, multimedia data
objects, spatial data(geographic or geospatial data) , temporal
data (Data that specifically refers to times or dates) etc. It is not
possible for one system to mine all these kind of data.

Mining information from heterogeneous databases and global


information systems − The data is available at different data
sources on LAN or WAN. These data source may be structured,
semi structured or unstructured. Therefore mining the
knowledge from them adds challenges to data mining.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy