KE22 FINAL YEAR PROJECT PHASE 2 Modeling and Simulation of Milling Forces SIMTech Project Ryan Soon, Henry Woo, Yong Boon April 9, 2011 Confidential –

Slides:



Advertisements
Similar presentations
Clustering Clustering of data is a method by which large sets of data is grouped into clusters of smaller sets of similar data. The example below demonstrates.
Advertisements

K-means Clustering Given a data point v and a set of points X,
Discrimination amongst k populations. We want to determine if an observation vector comes from one of the k populations For this purpose we need to partition.
SEEM Tutorial 4 – Clustering. 2 What is Cluster Analysis?  Finding groups of objects such that the objects in a group will be similar (or.
Fuzzy Inference Systems. Review Fuzzy Models If then.
Hierarchical Clustering
1 CSE 980: Data Mining Lecture 16: Hierarchical Clustering.
Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
Data Mining Cluster Analysis: Basic Concepts and Algorithms
Metrics, Algorithms & Follow-ups Profile Similarity Measures Cluster combination procedures Hierarchical vs. Non-hierarchical Clustering Statistical follow-up.
AEB 37 / AE 802 Marketing Research Methods Week 7
Cluster Analysis.
Automated rule Generation Maryam Mustafa Sarah Karim
4. Ad-hoc I: Hierarchical clustering
Learning From Data Chichang Jou Tamkang University.
Neuro-Fuzzy Control Adriano Joaquim de Oliveira Cruz NCE/UFRJ
CSE 300: Software Reliability Engineering Topics covered: Software metrics and software reliability Software complexity and software quality.
Semi-Supervised Clustering Jieping Ye Department of Computer Science and Engineering Arizona State University
Bioinformatics Challenge  Learning in very high dimensions with very few samples  Acute leukemia dataset: 7129 # of gene vs. 72 samples  Colon cancer.
Introduction to Bioinformatics - Tutorial no. 12
K-means Clustering. What is clustering? Why would we want to cluster? How would you determine clusters? How can you do this efficiently?
Neuro-fuzzy Systems Xinbo Gao School of Electronic Engineering Xidian University 2004,10.
Evaluating Performance for Data Mining Techniques
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
CPSC 386 Artificial Intelligence Ellen Walker Hiram College
Radial Basis Function Networks
KE22 FINAL YEAR PROJECT Modeling and Simulation of Milling Forces SIMTech Project Ryan Soon, Henry Woo, Yong Boon April 9, 2011 Confidential – Internal.
Milling Process Sensor Setup Data Acquisition Data pre- processing Features Extraction Microscopic tool wear measurement Prognostic modeling system and.
A nonlinear hybrid fuzzy least- squares regression model Olga Poleshchuk, Evgeniy Komarov Moscow State Forest University, Russia.
Least-Mean-Square Training of Cluster-Weighted-Modeling National Taiwan University Department of Computer Science and Information Engineering.
COMMON EVALUATION FINAL PROJECT Vira Oleksyuk ECE 8110: Introduction to machine Learning and Pattern Recognition.
Hierarchical Clustering
1 Motivation Web query is usually two or three words long. –Prone to ambiguity –Example “keyboard” –Input device of computer –Musical instruments How can.
Cluster Analysis Cluster Analysis Cluster analysis is a class of techniques used to classify objects or cases into relatively homogeneous groups.
ANFIS (Adaptive Network Fuzzy Inference system)
Clustering.
Marketing Research Aaker, Kumar, Day and Leone Tenth Edition Instructor’s Presentation Slides 1.
Data Mining Practical Machine Learning Tools and Techniques Chapter 4: Algorithms: The Basic Methods Section 4.8: Clustering Rodney Nielsen Many of these.
Machine Learning Queens College Lecture 7: Clustering.
A new initialization method for Fuzzy C-Means using Fuzzy Subtractive Clustering Thanh Le, Tom Altman University of Colorado Denver July 19, 2011.
KE22 FINAL YEAR PROJECT PHASE 3 Modeling and Simulation of Milling Forces SIMTech Project Ryan Soon, Henry Woo, Yong Boon April 9, 2011 Confidential –
Neural Networks Vladimir Pleskonjić 3188/ /20 Vladimir Pleskonjić General Feedforward neural networks Inputs are numeric features Outputs are in.
Lloyd Algorithm K-Means Clustering. Gene Expression Susumu Ohno: whole genome duplications The expression of genes can be measured over time. Identifying.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 28 Nov 9, 2005 Nanjing University of Science & Technology.
Clustering Algorithms Sunida Ratanothayanon. What is Clustering?
Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.
Introduction of Fuzzy Inference Systems By Kuentai Chen.
The article written by Boyarshinova Vera Scientific adviser: Eltyshev Denis THE USE OF NEURO-FUZZY MODELS FOR INTEGRATED ASSESSMENT OF THE CONDITIONS OF.
Cluster Analysis What is Cluster Analysis? Types of Data in Cluster Analysis A Categorization of Major Clustering Methods Partitioning Methods.
Linear Models & Clustering Presented by Kwak, Nam-ju 1.
Data Mining Cluster Analysis: Basic Concepts and Algorithms Lecture Notes Introduction to Data Mining by Tan, Steinbach, Kumar © Tan,Steinbach, Kumar Introduction.
A Presentation on Adaptive Neuro-Fuzzy Inference System using Particle Swarm Optimization and it’s Application By Sumanta Kundu (En.R.No.
CLUSTER ANALYSIS. Cluster Analysis  Cluster analysis is a major technique for classifying a ‘mountain’ of information into manageable meaningful piles.
Data Mining: Basic Cluster Analysis
Semi-Supervised Clustering
Chapter 7. Classification and Prediction
Hierarchical Clustering
A Simple Artificial Neuron
CSE 473 Introduction to Artificial Intelligence Neural Networks
Dr. Unnikrishnan P.C. Professor, EEE
Hierarchical and Ensemble Clustering
An open-source software library for Machine Intelligence
Cluster Analysis.
Ch 4.1 & 4.2 Two dimensions concept
Facultad de Ingeniería, Centro de Cálculo
Clustering The process of grouping samples so that the samples are similar within each group.
SEEM4630 Tutorial 3 – Clustering.
Cluster analysis Presented by Dr.Chayada Bhadrakom
Physics-guided machine learning for milling stability:
Using Clustering to Make Prediction Intervals For Neural Networks
Presentation transcript:

KE22 FINAL YEAR PROJECT PHASE 2 Modeling and Simulation of Milling Forces SIMTech Project Ryan Soon, Henry Woo, Yong Boon April 9, 2011 Confidential – Internal Only

2| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only PROBLEM DESCRIPTION  3 set of cutter tool data were given –07, 31, T12  Belong to the same family type but with differences in drill bit shape and knife edges  Problem domain requires us to build a hybrid KE system to predict the cutter tool wear  Full Microsoft.NET C# implementation of Hybrid KE system  Hierarchical Clustering –Derive number of Fuzzy linguistic values for each variable –Derive number of Fuzzy rules  ANFIS (Neural Fuzzy System) to learn and predict the tool wear –Generic tool wear prediction model

3| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only DATA CORRELATION ANALYSIS – 1  And within each cutter tool data –3 sets of individual tool head data  F1, F2, F3  Within each “F” data (315 records) –Acoustic emission data (16 features) –Force (x dimension) data (16 features) –Force (y dimension) data (16 features)  Too much features –Use correlation coefficient method and cut down on the features

4| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only DATA CORRELATION ANALYSIS – 2  By using Pearson Correlation Coefficients, the linear dependence between the measured features values and the tool wear values can be calculated  AE data is not influencing the tool wear strongly  The top influencing features are consistent between the 3 forces AEFxFyFz

5| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only FUZZY SYSTEM IDENTIFICATION

6| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only OVERVIEW OF HIERARCHICAL CLUSTERING  Agglomerative HC starts with each object describing a cluster, and then combines them into more inclusive clusters until only one cluster remains.  4 Main Steps –Construct the finest partition –Compute the distance matrix –DO  Find the clusters with the closest distance  Put those two clusters into one cluster  Compute the distances between the new groups and the remaining groups by recalculated distance to obtain a reduced distance matrix –UNTIL all clusters are agglomerated into one group.  Ward Methods, minimize ESS (Error Sum-Of-Square)

7| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only OVERVIEW OF ANFIS  ANFIS architecture  Premise ANFIS MF(Bell)  Consequence Linear Sugeno  Learning Algorithms FWBW PremiseFixedGradient Descent ConsequenceLSEFixed

8| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only OPTIMAL HIERARCHICAL CLUSTERING  Determine the numbers of clustering using RSS with penalty. Where, is the penalty factor for addition # of cluster. K’ and K = number of clusters RSS = Residual Sum of Squares  Borrow concept from K-means using RSS as goal function.

9| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only HIERARCHICAL CLUSTERING + ANFIS  Two Different Approaches for HC + ANFIS –Use HC to determine # of linguistic values for each input features –Use HC to determine # of rules

10| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only OPTIMAL HIERARCHICAL CLUSTERING # OF LINGUISTIC VARIABLES  Example on SRE variables, opt # of cluster = 3  Perform HC on selected features on FX Variables Name# of Clusters p2p4 std_fea4 sre3 fstd4

11| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only ANFIS ARCHITECTURES # OF LINGUISTIC VARIABLES  ANFIS with 4 inputs variables contains 3~4 linguistics variables generated 192 Rules!

12| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only ANFIS – RESULTS # OF LINGUISTIC VARIABLES  ANFIS Predict vs Actual –Train Data with Avg Error 4.84 –Test Data with Avg Error  Membership Functions –P2p –Std_fea –Sre –fstd

13| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only OPTIMAL HIERARCHICAL CLUSTERING # OF RULES  Build HC on all variables, opt # of cluster = 5

14| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only ANFIS ARCHITECTURES # OF RULES  ANFIS with 4 inputs variables contains 5 linguistics variables and 5 rules.  Each cluster centre is a fuzzy rules!

15| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only ANFIS – RESULTS # OF RULES  ANFIS Predict vs Actual –Train Data with Avg Error 5.75 –Test Data with Avg Error  Membership Functions –P2p –Std_fea –Sre –fstd

16| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only WHAT’S NEXT?  Full.NET C# Implementation  Development of Hierarchical Clustering toolset with frontend GUI –Manual range input of number cluster by user –Optimal clustering suggesting the optimal number of cluster  Make use of ANFIS model to evaluate –GUI engine for cluster center drawing  Development of ANFIS toolset with frontend GUI –Develop the ANFIS Engine which will do the optimization –Develop User Interface for:  Display predicted tool-wear result  Evaluation of error

17| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only THE END Demo

18| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only THE END Q&A

19| KE22 FYP, Modeling and Simulation of Milling Forces | April 9, 2011 | Confidential – Internal Only BACKUP