• No results found

Data Analysis. Data Mining. Data Mining Defined. Data Mining Definitions. Data Mining Definitions. Data Mining & Knowledge Discovery Process

N/A
N/A
Protected

Academic year: 2021

Share "Data Analysis. Data Mining. Data Mining Defined. Data Mining Definitions. Data Mining Definitions. Data Mining & Knowledge Discovery Process"

Copied!
15
0
0

Loading.... (view fulltext now)

Full text

(1)

Data Mining

&

Knowledge Discovery Process

Hamid R. Nemati, Ph.D.

Data Analysis

• Hidden Information

• The traditional data analysis and data queries may

not be adequate.

• Need for

Intelligent

data analysis tools and

techniques

• Data Mining can be used to

discover

meaningful

new correlations, patterns and trends by sifting

through large amount of data.

Data Mining

• Its tools use a variety of statistical and artificial

intelligence (AI) algorithms to analyze the

correlation of variables in the data and to

discover interesting patterns and relationships to

investigate

• One of the main difficulties associated with data

mining is that the number of possible

relationships may be very large, and therefore

the search process can be complex. Intelligent

search strategies, based upon reliable metadata,

are essential in highlighting data relevant to the

users’ needs.

Data Mining Defined

Data Mining is a “

Human-Centered

process of using a heterogeneous set of

tools and techniques to

Intelligently

and

Automatically

sift through large

databases to discover meaningful and

previously hidden information.

Data Mining Definitions

Data Mining, or Knowledge Discovery in Databases

(KDD) as it is also known, is the nontrivial

extraction of implicit, previously unknown, and

potentially useful information from data. This

encompasses a number of different technical

approaches, such as clustering, data

summarization, learning classification rules,

finding dependency net works, analyzing changes,

and detecting anomalies.

William J Frawley, Gregory Piatetsky-Shapiro and

Christopher J Matheus

Data Mining Definitions

Data mining is the search for relationships and

global patterns that exist in large databases but are

`hidden' among the vast amount of data, such as a

relationship between patient data and their medical

diagnosis. These relationships represent valuable

knowledge about the database and the objects in

the database and, if the database is a faithful

mirror, of the real world registered by the

database.

(2)

Data Mining Definitions

Data mining refers to "using a variety of

techniques to identify nuggets of

information or decision-making knowledge

in bodies of data, and extracting these in

such a way that they can be put to use in the

areas such as decision support, prediction,

forecasting and estimation.

Data Mining Methodology

• Data Mining is a

process

that starts with the raw

data and finishes with the extracted knowledge

which was acquired as a result of the following

stages:

– Problem Analysis – Data Preparation – Mining Activity – Result Interpretation – Integration and Monitoring

Data Mining Methodology

• Problem analysis:

– This step involves analyzing a business problem to assess if it is suitable for tackling using data mining. If it is, then an assessment has to be made of the availability of data, the data mining technology to used (induction, associations, etc.) and how the results of data mining will be deployed as part of the overall solution

• Data Preparation:

– This step involves extracting the data and transforming it to the format required for the data mining algorithm. This involves, aggregation, table joins, deriving new fields, data cleansing, etc.

Data Mining Methodology

• Mining:

– Data Exploration:

• This step precedes the actual knowledge discovery stage. It may involve visualization driven exploration and its aim is to give the user a good feel for the data and to reveal any errors in the data preparation / extraction.

– Knowledge Generation:

• This step involves using rule induction (automatic or interactive) and associations discovery algorithms to generate patterns. This step also involves validating and interpreting the discovered knowledge

Data Mining Methodology

• Result Interpretation :

– A main premise for the deployment of data mining results is that the future resembles the past and hence historic knowledge can be applied to future situations. This strategy is safe only if the historic knowledge are regularly monitored against new data to detect shifts in the discovered knowledge at the earliest possible time.

• Integration and Monitoring :

– This step involves deploying the discovered knowledge as designed in the problem analysis stage. This knowledge is typically used in decision support systems, to produce reports / guidelines, or to filter data for further processing that may result in specific action.

Data Mining Applications

(some)

• Marketing:

• market basket analysis, direct marketing

• Retail:

• product association, temporal trends, product placement

• Banking and Finance:

• risk analysis, securities rating, fraud detection

• Manufacturing:

• quality control, process optimization

• Health and Medical:

(3)

Examples of Profitable Data

Mining Applications

• A supermarket chain mines its customer

transactions data to optimize targeting of

high-value customers.

• A credit card company can use its data warehouse

of customer transactions for fraud detection.

• A major hotel chain can use survey databases to

identify attributes of a “high-value” prospect.

Data Mining Example

• Goal: develop a

Classification

model that predicts

whether a magazine subscriber will renew his

subscription

• Use data mining to

Cluster

the subscribers'

database

• Apply

Neural Networks

to automatically create a

Classification

model for each

Cluster

.

Examples of Data Mining

• Targeting a set of consumers who are most

likely to respond to a direct mail campaign.

– An increase of only 1% in the response rate can result in

several million dollars in additional sales.

• Predicting the probability of default for

consumer loan applications.

– Data mining can help lenders to substantially reduce loan losses by improving their ability to predict bad loans.

• Reducing fabrication flaws in VLSI chips.

– Data mining systems can sift through vast quantities of

data collected during the semiconductor fabrication process, to identify conditions which are causing yield problems.

Examples of Data Mining

• Predicting audience share for television

programs.

– A market share prediction system allows television programming executives to arrange show schedules to maximize market share and increase advertising revenues.

• Predicting the probability that a cancer

patient will respond to radiation therapy.

– By more accurately predicting the effectiveness of expensive medical procedures, health-care costs can be reduced without affecting quality of care.

Data Mining: Issues and Concerns

• Issue of individual privacy

– Data mining makes it possible to analyze routine business transactions and glean a significant amount of information about individuals.

• Issue is of data integrity:

– A key implementation challenge is integrating conflicting or redundant data from different sources – For example, a bank may maintain credit cards

accounts on several different databases. The addresses (or even the names) of a single cardholder may be different in each. Software must translate data from one system to another and select the address most recently entered.

Data Mining: Issues and Concerns

• The underlying data:

– Structure:

• set up a relational database structure • or a multidimensional one.

– Representation and format

• Issue of cost:

– The more powerful the data mining queries, the greater the utility of the information being gleaned from the data, and the greater the pressure to increase the amount of data being collected and maintained, which increases the pressure for faster, more powerful data mining queries. – This increases pressure for larger, faster systems, which are

(4)

Data Mining Functions and

Operations

Most common operations that are associated with

discovery-driven data mining:

– Prediction and Classification Models – Clustering

– Link analysis – Database Segmentation – Deviation Detection – Association.

– Sequential Pattern recognition

Prediction and classification

models

• The most commonly used method of data

mining.

• The goal of this operation is to use the

contents of the database, which reflect

historical data, i.e., data about the past, to

automatically generate a model that can

predict a future behavior.

Classification

• Classification is learning a function that

maps a data item into one or more

predefined classes.

• For Example, a classification model can be

used to determine whether a bank is likely

to fail or a given stock should be a “Buy”,

“Hold” or a “Sell”.

Example of prediction and

classification models

• A financial analyst may be interested in predicting

the return of investment of a particular asset so

that he can determine whether to include it in a

portfolio he is creating.

• A marketing executive may be interested to

predict whether a particular consumer will switch

brands of a product of interest. Model creation has

been traditionally pursued using statistical

techniques.

Creation of prediction and

classification models

• The value added by data mining techniques

in this operation is in their ability to

generate models that are:

– comprehensible, and

– explainable,

• since many data mining modeling

techniques express models as sets of if...

then... rules.

Clustering

• Clustering is used to segment a database into subsets,

the

clusters

, with the members of each cluster sharing

a number of interesting properties.

• Data clustering (“unsupervised learning”): Cluster objects into classes, based on their features, which maximize intraclass similarity and minimize interclass similarity.

• Clustering is used in one of two ways.

– Summarizing the contents of the target database

– Input to other methods

(5)

Link Analysis

• Focus of Link Analysis is to establish

relations between the records in a database.

• A merchandising executive is usually

interested in determining what items sell

together, i.e.., men's shirts sell together with

ties and men's fragrances.

• Has major Decision Support implications:

– decide what items to buy for the store

– how to lay these items out – What items to put on sale

Database Segmentation

• The database is

segmented

based on the records

that describe it.

• As databases grow and are populated with

diverse types of data it is often necessary to

partition

them into collections of related

records either as a means of obtaining a

summary of each database, or before

performing a data mining operation such as

model creation, or link analysis.

Database Segmentation

• For example, assume a department store maintains

a database in which each record describes the

items purchased by a customer during a particular

visit to the store.

• Records that describe sales during:

– "back to school" period

– "after Christmas" period

Deviation Detection

• This operation is the exact opposite of database

segmentation. In particular, its goal is to identify

outlying points in a particular data set, and explain

whether they are due to noise or other impurities

being present in the data, or due to causal reasons.

• It is usually applied in conjunction with database

segmentation. It is usually the source of true

discovery since

outliers express deviation

from

some previously known expectation and norm.

Association

Association

discovery returns a measure of

association that exist among the collection of

items.

• Focus here is to discover affinities among the data

and express them in the form of rules.

• A typical application that can be built using

association discovery is

Market Basket Analysis

.

Association

• Given a collection of

items

and a set of

records

, each of which contain some

number of items from the given

collection

,

an

association

discovery returns a measure

of association that exist among the

collection of items.

(6)

Association

• For Example, "72% of all the records that

contain items A, B and C also contain items

D and E.”

• 60% of customers that purchase items A, B

and C also purchase items D and E.”

• Whenever bread and butter is purchased,

there is 90% chance that milk is also

purchased.

Sequential Patterns

• A sequence discovery function will analyze

collections of related records and will detect

frequently occurring patterns of those items over

time.

• For example, sequential Patterns may discover a rule

that states that 68% of the time when Stock X

increased to value by at most 10% over a 5-day

trading period and Stock Y increased its value

between 10% and 20% during the same period, then

the value of Stock Z also increased in a subsequent

week.

Sequential Patterns

• A sequential pattern discovery detects frequently

occurring patterns of data items over time.

• When a customer purchases a stove, 80% of the

time, they will also purchase cookware within

three weeks.

• 68% of the time when Microsoft Stock increased

by 10% over a 5-day trading period, IBM stock

increased its value between 10% and 20% in a

subsequent week.

Integration of Data Mining and Data

Warehousing

• Data warehouse provides clean, integrated data for fruitful mining.

• Data mining provides powerful tools for analysis of data stored in data warehouses.

• OLAP can be viewed as data summarization and simple data mining facility.

• Data mining provides more analysis tools, e.g., association, classification, clustering, pattern-directed, and trend analysis. • Mining multi-level knowledge by integration with OLAP

facilities: mining in multiple data cubes.

Background Knowledge for

Data Mining

• Conceptual "hierarchies" and generalization operators.

– Instance-based: {freshman, ..., senior} ⊂ undergraduate. – Schema-based: address(city, province, country). – Rule-based: good(x) ←undergraduate(x) ∧gpa(x)≥3.5. – Operation-based: aggregation, approximation, clustering, etc.

• Where to get such background knowledge?

– Implicitly stored in databases, such as address. – Explicitly defined by experts, such as "physics ⊂ science". – Formed with different attribute combinations,

food(category, brand, content _spec, package _size, price). – Generated automatically by data distribution analysis.

• May need dynamic adjustment for a particular set of data. • Choose from multiple hierarchies or try them in parallel.

(7)

Lessons on how to get started

with Data Mining

• Lean the as much about your application as possible.

• Learn the basics: Know what Data mining is, what it

is not, what it can do what it can not do.

• Learn what succeeded and what failed and why?

• See if Data Mining is what is needed.

• Find a product or a consultant that suites your needs

• Realize that “THERE ARE NO MAJIC BULLETS”

Data mining Tools (some)

• Statistical Analysis

• Rule Indication

• Decision Trees

• Nearest neighbor method

• Data Visualization

• Neural Networks

• Genetic Algorithms

• Fuzzy Logic

• Expert Systems

Decision Tree Example

Data Visualization Example

Artificial Neural Networks

• Is the type of information processing whose architecture is inspired by the structure of biological neural systems.

Biological

Artificial

Artificial Neural Networks

Foundations

Based on the following assumptions

:

1. Information processing occurs at many simple

processing elements called

neurons.

2. Signals are passed between neurons over

interconnection links.

3. Each interconnection link has an associated

weight.

4. Each neuron applies an activation function to

determine its output signal.

(8)

Data Mining using Neural

Networks

The Representation Phase:

– initial domain knowledge is represented in a symbolic format

The Mapping Phase:

– knowledge is mapped into an initial connections architecture

The Training Phase:

– network is trained based on the knowledge and the mapping tuple

Operation Phase:

– use the trained network as a predictive tool

Characteristics of Neural

Networks

1. Memories are stored or represented in a neural network in the pattern of interconnection strengths among the neurons.

2. Information is processed by changing the strengths of interconnections and/or changing the state of each neurons.

3. A neural network is trained rather than programmed.

4. A neural network acts as an associative memory. 5. It can generalize.

6. It is robust. (distributed memory)

How to Train a Neural Network

Definitions of Neural Networks

• ... a neural network is a system composed of

many simple processing elements operating in

parallel whose function is determined by network

structure, connection strengths, and the

processing performed at computing elements or

nodes.

According to the DARPA Neural Network Study (1988, AFCEA International Press, p. 60):

Definitions of Neural Networks

• A neural network is a massively parallel distributed

processor that has a natural propensity for storing

experiential knowledge and making it available for

use. It resembles the brain in two respects:

1.Knowledge is acquired by the network through a learning process.

2.Interneuron connection strengths known as synaptic weights are used to store the knowledge.

According to Haykin, S. (1994), Neural Networks: A Comprehensive Foundation, NY: Macmillan, p. 2:

Definitions of Neural Networks

• A neural network is a circuit composed of a very large number of simple processing elements that are neurally based. Each element operates only on local information. Furthermore each element operates asynchronously; thus there is no overall system clock.

– (According to Nigrin, A. (1993), Neural Networks for Pattern Recognition, Cambridge, MA: The MIT Press, p. 11)

• Artificial neural systems, or neural networks, are physical cellular systems which can acquire, store, and utilize experiential knowledge

.

– (According to Zurada, J.M. (1992), Introduction To Artificial Neural Systems, Boston: PWS Publishing Company, p. xv)

(9)

Artificial Neural Networks

Based on the following assumptions:

1. Information processing occurs at many simple

processing elements called

neurons.

2. Signals are passed between neurons over

inter-connection links.

3. Each interconnection link has an associated

weight.

4. Each neuron applies an activation function to

determine its output signal.

Artificial Neural Networks

The Operation of a Neural Network is controlled by

three properties:

1. The pattern of its interconnections, architecture.

2. Method of determining and updating the weights on the interconnections,training.

3. The function that determines the output of each individual neuron, activation or transfer function.

Characteristics of Neural Networks

1. Neural Network is composed of a large number of very simple processing elements called neurons.

2. Each neuron is connected to other neurons by means of interconnections or links with an associated weight. 3. Memories are stored or represented in a neural network in the

pattern of interconnection strengths among the neurons. 4. Information is processed by changing the strengths of

interconnections and/or changing the state of each neurons. 5. A neural network is trained rather than programmed. 6. A neural network acts as an associative memory. It stores

information by associating it with other information in the memory. For example, a thesaurus is an associative memory.

Characteristics of Neural Networks

7. It can generalize; that is, it can detect similarities between new patterns and previously stored patterns. A neural network can learn the characteristics of a general category of objects on a series of specific examples from that category. 8. It is robust, the performance of a neural network does not

degrade appreciably if some of its neurons or interconnections are lost. (distributed memory)

9. Neural networks may be able to recall information based on incomplete or noisy or partially incorrect inputs.

10.A neural network can be self-organizing. Some neural networks can be made to generalize from data patterns used in training without being provided with specific instructions on exactly what to learn.

Model of a Neuron

• A neuron has three basic elements:

1. A set ofsynapses or connecting links, each with a weight or strength of it own. A positive weight is excitatory and a negative weight is inhibitory.

2. Anadderfor summing the input signals.

3. An activation functionfor limiting the range of output signals, usually between [-1, +1] or [0, 1].

• Some neurons may also include:

– a thresholdto lower the net input of the activation function. – a biasto increase the net input of the activationfunction

Traditional Approaches to Information

Processing Vs. Neural Networks

1.

Foundation: Logic vs. Brain:

TA:Simulate and formalize human reasoning and logic process. TA treat the brain as a black box. TA focus on how the elements are related to each other and how to give the machine the same capabilities.

NN:Simulate the intelligence functions of the brain. NN focus on modeling the brain structure. NN attempts to create a system that functions like the brain because it has a structure similar to the structure of the brain.

(10)

Traditional Approaches to Information

Processing Vs. Neural Networks

2.

Processing Techniques: Sequential vs

Parallel

TA:

The processing method of TA is inherently

sequential.

NN:

The processing method of NN is inherently

parallel. Each neuron in a neural network

system functions in parallel with others.

Traditional Approaches to Information

Processing Vs. Neural Networks

3. Learning: Static and External vs. Dynamic and

Internal

TA:Learning takes place outside of the system. The knowledge is obtained outside the system and then coded into the system.

NN:Learning is an integral part of the system and its design. Knowledge is stored as the strength of the connections among the neurons and it is the job of NN to learn these weights from a data set presented to it.

Traditional Approaches to Information

Processing Vs. Neural Networks

4.

Reasoning Method: Deductive vs. Inductive

TA:Is deductive in nature. The use of the system involves a deductive reasoning process, applying the generalized knowledge to a given case.

NN: Is inductive in nature. It constructs an internal knowledge base from the data presented to it. It generalizes from the data, such that when it is presented a new set of data, it can make a decision based on the generalized internal knowledge.

Traditional Approaches to Information

Processing Vs. Neural Networks

5.

Knowledge Representation: Explicit vs. Implicit

TA:It represents knowledge in an explicit form. Rules and relationships can be inspected and altered.

NN:The knowledge is stored in the form of

interconnections strengths among neurons. Nowhere in the system, one can pick up a piece of computer code or a numerical value as a discernible piece of knowledge.

Strengths of Neural Networks

• Generalization

• Self-organization

• Can recall information based on incomplete or

noisy or partially incorrect inputs.

• Inadequate or volatile knowledge base

• Project development time is short and training

time for the neural network is reasonable.

• Performs well in

data-intensive

applications

• Performs well where:

– Standard technology is inadequate

– Qualitative or complex quantitative reasoning is required – Data is intrinsically noisy and error-prone

Limitations of Neural Networks

• No explanation capabilities

• Still a “blackbox” approach to problem

solving

• No established development guidelines

• Not appropriate for all types of problems

(11)

Applications of Neural Networks

• Economic Modeling • Mortgage Application

Assessments • Sales lead assessments • Disease Diagnosis • Manufacturing Quality Control • Sports forecasting • Process Fault detection • Bond Rating • Credit Card Fraud

• Detection

• Oil Refinery Production Forecasting

• Foreign Exchange Analysis • Market and Customer Behavior

Analysis

• Optimal resource Allocation • Financial Investment Analysis • Optical Character Recognition • Optimization

NEURAL NETWORKS IN

FINANCIAL MARKET ANALYSIS

• Karl Bergerson of Seattle’s Neural Trading Co. developed Neural$ Trading System using Brainmaker software. • He used 9 years of financial data including price, and

volume, to train his neural net.

• He ran it against a $10,000 investment. After 2 years, the financial account had grown to $76,034 - a 660% growth. • When tested with new data his system was 89% accurate.

NEURAL NETWORKS IN

BANKRUPTCY PREDICTION

• NeuralWare’s Application Development Services and Support (ADSS) group developed a backpropagation neural network using NeuralWorks Professional software to predict bankruptcies.

• The network had 11 inputs, one hidden layer and one output.

• The network was trained using a set of 1000 examples. The network was able to predict failed banks with an accuracy of 99 percent.

• ADSS has also developed a neural network for a credit card company to identify those credit card holders who have 100% probability of going bankrupt.

NEURAL NETWORKS IN

FORECASTING

• Pugh & Co. of NJ has used Brainmaker to

forecast the next year’s corporate bond ratings for

115 companies.

• The Brainmaker network takes 23

financial-analysis factors and the previous year’s index

rating as inputs and output the rating forecast for

next year.

• Pugh & Co. claims that the network is 100%

accurate in categorizing ratings among categories

and 95% accurate among subcategories.

NEURAL NETWORKS IN QUALITY

CONTROL:

• CTS Electronics of TX has used a NeuroShell

neural network software package for classification

of loudspeaker defects in its Mexico assembly

line.

• 10 input nodes represent distortions and 4 output

nodes represent speaker-defect classes.

• Networks require only a 40 minute training period.

• The efficiency of the network has exceeded CT’s

original specifications.

NEURAL NETWORKS

TRAINING

• To

train

a neural network, the developer repeatedly

present the network with data.

• During the training the network is allowed to

change its interconnections weights using one of

the learning rules.

• The training continues until a pre-specified

condition is reached.

• The design and training a neural network is an

ITERATIVE process. The developer goes through

the designing system, training the systems and

evaluating the system repeatedly .

(12)

Neural Networks Training

• The issue of training the neural networks

can be divided into categories:

Training data set

Training strategies

Developing Neural Network

Applications for Data Mining

1.

Is Neural Network approach appropriate?

2. Select appropriate Paradigm.

3. Select input data and facts.

4. Prepare data.

5. Train and test network.

6. Run the network.

7. Use the Network for Data Mining

Is Neural Network Approach

Appropriate?

• Inadequate knowledge base

• Volatile knowledge bases

• Data-intensive system

• Standard technology is inadequate

• Qualitative or complex quantitative reasoning is

required

• Data is intrinsically noisy and error-prone

• Project development time is short and training time

for the neural network is reasonable.

Select appropriate paradigm:

• Decide on network architecture according to general

problem area (e.g., Classification, filtering, pattern

recognition, optimization, data compression,

prediction)

• Decide on transfer function

• Decide on learning method

• Select network size. (e.g., How many inputs, output

neurons? How many hidden layers and how many

neurons per layer?)

• Decide on nature of input/output.

• Decide on type of training used.

Select Input Data And Facts

• What is the problem domain?

• The training set should contain a good representation

of the entire universe of the domain.

• What are the input sources.

• What is the optimal size of the training set?

– The answer depends on the type of network used. – The size should be relatively large.

– The use a rule of thumb

• For backpropagation networks, the training is more successful when the data contain noise.

Data Set Considerations

In selecting a data set, the following issues

should be considered:

Size

Noise

Knowledge domain representation

Training set and test set

Insufficient data

Coding the input data

(13)

Data Set SIZE

What is the optimal size of the training set?

The answer depends on the type of network used. The size should be relatively large.

The following is used as a rule of thumb for backpropagation networks:

Training Set Size = Number of hidden layers + Number of input neuron Testing Tolerance

NOISE

For back propagation networks, the training is more successful when the data contain noise.

Knowledge Domain

Representation

• The most important consideration in selecting a

data set for Neural Networks

• The training set should contain a good

representation of the entire universe of the

domain.

• May result in an increase in number of training

facts, which may cause the networks size to

change.

Selection of Variables

• It is possible to reduce the size of input data

without degrading the performance of the

network:

– Principle Component Analysis

– Manual Method

Insufficient Data

R

When the data is scarce, the allocation of the data into a

training and a testing set becomes critical.

R

The following schemes are used when collecting more

data is not possible:

Rotation Scheme:

Suppose the data set has N facts. Set aside one of the facts, training the system with N-1 facts. Then set aside another fact and retrain the network with the other N-1 facts. Repeat the process N times.

.

Insufficient Data

CREATING MADE-UP DATA:

– Increase the size of the made up data by including made up-data

– Some times the idea of BOOTSTRAPPING is used. The – decision should be made as whether the distribution of – data should be maintained.

EXPERT-MADE DATA:

– Ask an expert to supply additional data. Some times a multiple expert scheme is used.

Data Preparation

• The next step is to think about different ways to

represent the information.

• Data can be NON Distributed or Distributed.

• Using a NON Distributed date set, each neuron

represents 100% of an item.

• The data set must be NON overlapping and complete.

• In this case, the network can represent only a limited

number of unique patterns.

• Using a Distributed data set, the qualities that define a

unique pattern are spread out over more than one

neuron.

(14)

Data Preparation

• For example, a purple object can be represented

described as being half red and half blue.

• The two neurons assigned to red and blue can

together define purple, eliminating the need to

assign a third purple neuron.

• The problem with the Distributed system is that

the input/output should be translated twice.

• The advantage of these networks is that fewer

neurons are required to define the domain.

Continuous vs. Binary Data

• The developer should decide as whether a piece data

is continuous of binary.

• If a continuous data is represented in a binary form,

the network may NOT be able to train properly.

• The decision as whether a piece data is continuous

of binary may not be simple.

• If the continuous data set is spread evenly within a

data range, it may be reasonable to represent it as

binary.

Actual Values Vs. Change In

Values

• An important decision in representing continuous

data is whether to use actual amounts or changes

in amounts.

• Whenever possible, it is better to use changes in

values.

• Using the changes in values may make it easier for

the network to appreciate the meaning that the

data represents.

Coding the Input Data

The training data set should be properly normalized.

The training data set should match the design of the network.

– Zero-mean-unit Variant (Zscore) – Min-Max Cut off

– Sigmoidale

Training Strategies

R

Training a network depends on the networks

characteristics.

R

Many networks require iterative training, that is the

data is presented to the network repeatedly.

R

For the training a system, the developer faces a

number of training issues:

- Proportional Training - Over-training and Under-training - Updating

- Scheduling

Search for the best network

• Use exhaustive search

• Use Gradient search methods

• Use Genetic Algorithms

• Use Probabilistic search methods

• Use Deterministic search methods

(15)

Proportional Training

• In training a neural network, it is not uncommon that a fact is presented to the network many times. The question is how many times should a given training fact be presented to the network?

• For example, if the training set has 500 fact, it takes 500,000 iteration to train the network, each fact is presented to the network 1,000 times. Is that sufficient? If a training fact is repeated a number of times in the data set, it must receive a proportional representation in the number of iterations it is presented to the network.

OVER-TRAINING AND

UNDER-TRAINING

RIn an iterative training process, a higher number of iterations does NOT always mean a better training outcome.

RToo many iterations may lead to over training and too few iterations may lead to under training.

RThe reason for overtraining is not quite clear yet, but it has been reported that in some networks, training beyond a certain point may lower the over performance of the network.

RThe developer of the network should reach a balance between the two.

• The performance of the system is usually measured with the endogenous data (data used for training the system) and exogeneonous data (data used to test the system, it should represent the data that the system has not seen yet.)

How Do You Know When to

Stop Training

R

Time

R

Number of Epochs

R

Percentage of Error

R

Root Mean Square Error (RMS)

R

R-Squared

References

Related documents

Whereas immunization coverage has increased overall in many countries, children living in rural and urban informal settlements areas have recorded the lowest immunization

Version III; BPRS, Brief Psychiatric Rating Scale; CADSS, Clinician-Administered Dissociative States Scale; CSTAR, Centre for Support and Training in Analysis and Research,

The investigator analyze the total stress of the women teachers working in high schools with their type of school, age, educational qualification, experience, type

A hybrid statistical model representing both the pose and shape variation of the carpal bones is built, based on a number of 3D CT data sets obtained from different subjects

Immunoprecipi- tation and Western blot for FGFR3 proteins confirmed the presence of both FGFR3 proteins in the cell lysate, suggesting that this decrease in phosphorylation did

In examining the ways in which nurses access information as a response to these uncertainties (Thompson et al. 2001a) and their perceptions of the information’s usefulness in

As a formal method it allows the user to test their applications reliably based on the SXM method of testing, whilst using a notation which is closer to a programming language.

For the cells sharing a given channel, the antenna pointing angles are first calculated and the azimuth and elevation angles subtended by each cell may be used to derive