© 2002 IBM Corporation IBM Research 1 Policy Transformation Techniques in Policy- based System Management Mandis Beigi, Seraphin Calo and Dinesh Verma.

Slides:



Advertisements
Similar presentations
Analysis of High-Throughput Screening Data C371 Fall 2004.
Advertisements

Ch2 Data Preprocessing part3 Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2009.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Data Mining Feature Selection. Data reduction: Obtain a reduced representation of the data set that is much smaller in volume but yet produces the same.
Molecular Biomedical Informatics 分子生醫資訊實驗室 Machine Learning and Bioinformatics 機器學習與生物資訊學 Machine Learning & Bioinformatics 1.
Data Mining Classification: Alternative Techniques
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
Data preprocessing before classification In Kennedy et al.: “Solving data mining problems”
Lazy vs. Eager Learning Lazy vs. eager learning
Feature Selection Presented by: Nafise Hatamikhah
Exploratory Data Mining and Data Preparation
UNIVERSITY OF JYVÄSKYLÄ Yevgeniy Ivanchenko Yevgeniy Ivanchenko University of Jyväskylä
Lecture Notes for CMPUT 466/551 Nilanjan Ray
Chapter 3 Database Management
1 Abstract This study presents an analysis of two modified fuzzy ARTMAP neural networks. The modifications are first introduced mathematically. Then, the.
Lazy Learning k-Nearest Neighbour Motivation: availability of large amounts of processing power improves our ability to tune k-NN classifiers.
Chapter 4: Database Management. Databases Before the Use of Computers Data kept in books, ledgers, card files, folders, and file cabinets Long response.
1 Automatic Request Categorization in Internet Services Abhishek B. Sharma (USC) Collaborators: Ranjita Bhagwan (MSR, India) Monojit Choudhury (MSR, India)
Laurent Itti: CS599 – Computational Architectures in Biological Vision, USC Lecture 7: Coding and Representation 1 Computational Architectures in.
Dan Simon Cleveland State University
DASHBOARDS Dashboard provides the managers with exactly the information they need in the correct format at the correct time. BI systems are the foundation.
Major Tasks in Data Preprocessing(Ref Chap 3) By Prof. Muhammad Amir Alam.
Face Recognition Using Neural Networks Presented By: Hadis Mohseni Leila Taghavi Atefeh Mirsafian.
Principal Component Analysis (PCA) for Clustering Gene Expression Data K. Y. Yeung and W. L. Ruzzo.
Data Mining Techniques
Data Mining Chun-Hung Chou
Chapter 3 Data Exploration and Dimension Reduction 1.
Chapter 8: Problem Solving
A Shaft Sensorless Control for PMSM Using Direct Neural Network Adaptive Observer Authors: Guo Qingding Luo Ruifu Wang Limei IEEE IECON 22 nd International.
Introduction to variable selection I Qi Yu. 2 Problems due to poor variable selection: Input dimension is too large; the curse of dimensionality problem.
BsysE595 Lecture Basic modeling approaches for engineering systems – Summary and Review Shulin Chen January 10, 2013.
ArrayCluster: an analytic tool for clustering, data visualization and module finder on gene expression profiles 組員:李祥豪 謝紹陽 江建霖.
7.1 Managing Data Resources Chapter 7 Essentials of Management Information Systems, 6e Chapter 7 Managing Data Resources © 2005 by Prentice Hall.
Access Control Via Face Recognition Progress Review.
Chapter 7: Transformations. Attribute Selection Adding irrelevant attributes confuses learning algorithms---so avoid such attributes Both divide-and-conquer.
Data Reduction. 1.Overview 2.The Curse of Dimensionality 3.Data Sampling 4.Binning and Reduction of Cardinality.
6.1 © 2010 by Prentice Hall 6 Chapter Foundations of Business Intelligence: Databases and Information Management.
MANAGING DATA RESOURCES ~ pertemuan 7 ~ Oleh: Ir. Abdul Hayat, MTI.
ISOMAP TRACKING WITH PARTICLE FILTER Presented by Nikhil Rane.
Chapter1: Introduction Chapter2: Overview of Supervised Learning
Neural Networks Demystified by Louise Francis Francis Analytics and Actuarial Data Mining, Inc.
Chapter 20 Classification and Estimation Classification – Feature selection Good feature have four characteristics: –Discrimination. Features.
Data Mining and Decision Support
Computational Intelligence: Methods and Applications Lecture 33 Decision Tables & Information Theory Włodzisław Duch Dept. of Informatics, UMK Google:
20 Copyright © 2008, Oracle. All rights reserved. Cache Management.
Feature Selection and Extraction Michael J. Watts
Feature Selction for SVMs J. Weston et al., NIPS 2000 오장민 (2000/01/04) Second reference : Mark A. Holl, Correlation-based Feature Selection for Machine.
IEEE AI - BASED POWER SYSTEM TRANSIENT SECURITY ASSESSMENT Dr. Hossam Talaat Dept. of Electrical Power & Machines Faculty of Engineering - Ain Shams.
Instance-Based Learning Evgueni Smirnov. Overview Instance-Based Learning Comparison of Eager and Instance-Based Learning Instance Distances for Instance-Based.
SUPERVISED AND UNSUPERVISED LEARNING Presentation by Ege Saygıner CENG 784.
Data Mining Techniques Applied in Advanced Manufacturing PRESENT BY WEI SUN.
Chapter 12 Case Studies Part B. Control System Design.
Data statistics and transformation revision Michael J. Watts
1 C.A.L. Bailer-Jones. Machine Learning. Data exploration and dimensionality reduction Machine learning, pattern recognition and statistical data modelling.
SNS COLLEGE OF TECHNOLOGY
Data Transformation: Normalization
Chapter 7. Classification and Prediction
School of Computer Science & Engineering
Vincent Granville, Ph.D. Co-Founder, DSC
MANAGING DATA RESOURCES
Blind Signal Separation using Principal Components Analysis
Design of Hierarchical Classifiers for Efficient and Accurate Pattern Classification M N S S K Pavan Kumar Advisor : Dr. C. V. Jawahar.
Neural Networks and Their Application in the Fields of Coporate Finance By Eric Séverin Hanna Viinikainen.
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
Chapter 7: Transformations
Feature Selection Methods
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
Data Preprocessing Copyright, 1996 © Dale Carnegie & Associates, Inc.
Memory-Based Learning Instance-Based Learning K-Nearest Neighbor
Presentation transcript:

© 2002 IBM Corporation IBM Research 1 Policy Transformation Techniques in Policy- based System Management Mandis Beigi, Seraphin Calo and Dinesh Verma mandis, scalo, us.ibm.com IBM Research June 7, 2004

IBM Research © 2003 IBM Corporation 2 Policy Transformation Advantages  Simplifies policy-based management  Hides complex policies from administrators  Provides business level abstractions Objective  Build a generic policy transformer  To be used by many disciplines  Bidirectional policy transformer –Business level to low level configuration –Low level configuration to business level (Policy Advisor)

IBM Research © 2003 IBM Corporation 3 Policy Transformation  Types of transformation –Offline – Uses static predefined rules –Real time/online – feedback loop  Transformation taken place in 2 places –At management tool – before placed onto repository –At decision point – before send to the enforcement points

IBM Research © 2003 IBM Corporation 4 Policy-based System Management

IBM Research © 2003 IBM Corporation 5 Policy Transformation Enablement

IBM Research © 2003 IBM Corporation 6 Existing Approaches  Analytical Models Need model of the system Need to solve for model parameters Need to make simplifying assumptions Drawback - Exact models do not exist for real-life environments  Online Adaptive Control Using concepts from control theory Develop a neural network model Drawback - Discipline specific  Simulation Approach Model the system using a simulator Drawback – Discipline specific

IBM Research © 2003 IBM Corporation 7 Proposed Approach: Transformation using static rules  Example: High Level policy: If the user is from Schwab, then provide Gold level service Low Level Policy: If the user is from the subnet /24, then reserve a bandwidth of 20 Mbps and provide an encryption of 128 bits Transformation Rules: 1.Schwab user is on the /24 subnet 2.Gold service is to provide a bandwidth of 20 Mbps and an encryption of 128 bits

IBM Research © 2003 IBM Corporation 8 Proposed Approach: Transformation based on table lookup Transformation module holds a table of policies appropriate for the system

IBM Research © 2003 IBM Corporation 9 Proposed Approach: Transformation using case based reasoning Applications using CBR: 1.Diagnostics 2.Planning 3.Prediction A table of cases is kept from past measurements or training set Data my consist:  Noise  Inconsistent cases  Multiple cases having the same outcome  Missing measurements

IBM Research © 2003 IBM Corporation 10 Sample of a Case Database Tier0 # of Disks Tier1 # of Disks Tier0 # of Nodes Tier1 # of Nodes User Response Time sec sec sec sec sec sec sec sec

IBM Research © 2003 IBM Corporation 11 Feature Selection  A typical system would have many configuration parameters and goal values How do you know which are the right set of configs and goals to include in the transform data? How does one eliminate unnecessary responses  Need to select a subset of best features from the monitored data E1, E2, E3, E4, E5, E6  G1, G2, G3 Select E2, E4 and E5 Or give them different weights by sorting them according to most relevant to least relevant

IBM Research © 2003 IBM Corporation 12 Feature Selection  Backward Generation Remove one feature at a time until desired accuracy is obtained  Complete Search Strategy Consider all possible combinations of features  Accuracy Evaluation Measured against a set of known test-cases

IBM Research © 2003 IBM Corporation 13 Data Pre-processing  Removes irrelevant or redundant data to make data simpler  Reduces computational overhead  Increases accuracy 3-step process: 1.Dimensionality reduction  By Feature Selection – Weights based on accuracy  Principal Component Analysis (PCA) Combines correlated axes  Cross Correlation Matrix – Direct relationship of variables Linearly dependent variables Correlation:ρ 12 = ∑ x 1 x 2 / N σ 1 σ 2 2.Normalizing 3.Data Unit Consistencies

IBM Research © 2003 IBM Corporation 14 Principal Component Analysis  Finds components that represent maximum variance  A set of correlated variables  a set of uncorrelated variables  Reduces dimension of data  Reduces noise  Example: Linear reduction of 2 dimensions to 1 dimension

IBM Research © 2003 IBM Corporation 15 Data Clustering  K-nearest neighbor clustering  Fixed or variable number of clusters  Robust to noise in data  Find the cluster with the smallest distance to lookup data point

IBM Research © 2003 IBM Corporation 16 Experiments and Results  IBM High Volume Web Site simulator  Multi-tiered web site  Different workload patterns 1.Online shopping 2.Trading 3.Reservations 4.Auctions  User session characteristics  Software/hardware characteristics per tier

IBM Research © 2003 IBM Corporation 17 Web-site Architecture

IBM Research © 2003 IBM Corporation 18 Experiment  N: # of configuration parameters  M: # of goal parameters  k: # of clusters N=21M=16k=data size/100 Each case: Generated 21 uniformly distributed random variables Measured the goal values Generated 100,000 data points (cases)

IBM Research © 2003 IBM Corporation 19 Components of the Transformation Module

IBM Research © 2003 IBM Corporation 20 Accuracy of the System  Euclidean distance  PCA:M=16 -> M’=6 reduced M by 10  In real systems N can also be reduced

IBM Research © 2003 IBM Corporation 21 Experiment Results  Cross correlation matrix  Values between -1 and +1  10,000 cases Configuration KnobGoal valueCross Correlation Value ‘ThinkTime’‘SessionTime’ ‘BackgroundUtilization’‘CPUUtilization’ Tier0 # of Nodes Tier1 # of Nodes Tier2 # of Nodes Average Response Time

IBM Research © 2003 IBM Corporation 22 Online/Real Time Policy Transformation

IBM Research © 2003 IBM Corporation 23 Online Transformation  Online monitoring component  Ensures objectives are being met  Configuration parameters are dynamically modified  Configuration parameters and objectives are measured  Builds case database  Useful for state dependent systems

IBM Research © 2003 IBM Corporation 24 Summary  Different types of transformation  Discipline independent - generic solution  Offline and online methods