RSES – reducts and discretization of attributes presented by Zbigniew W. Ras University of North Carolina, Charlotte, NC & Warsaw University of Technology,

Slides:

Advertisements

Similar presentations

YOSI! BLUE (30 sec play) Ball moves to X1 from X2

Advertisements

BESTIALES IV COLLECTION Reference numberDescriptionAvailable units BS Large backpack Size: 31x40x15cm Available in three models Reference.

An Introduction to Calculus. Calculus Study of how things change Allows us to model real-life situations very accurately.

Table de multiplication, division, addition et soustraction.

robot con 6 gradi di mobilità

Evaluation and Validation

Chapter 4 Section 3 Matrix Multiplication. Scalar Multiplication Scalar Product - multiplying each element in a matrix by a scalar (real number) –Symbol:

Buffer stocks to stabilise incomes P QO D a P1P1.

Maximal Independent Subsets of Linear Spaces. Whats a linear space? Given a set of points V a set of lines where a line is a k-set of points each pair.

THE TIME DIMENSION Short-run and long-run price adjustmentShort-run and long-run price adjustment –short- and long-run demand and supply curves –short-

Rule Learning – Overview Goal: learn transfer rules for a language pair where one language is resource-rich, the other is resource-poor Learning proceeds.

PROLOG MORE PROBLEMS.

Bank Accounts Management System - p. 448

The Dating Game With Our Host, Welcome to the Dating Game, the game where we find the greatest common factors between different numbers. Hopefully well.

CS 473Lecture X1 CS473-Algorithms I Lecture X Dynamic Tables.

© 2009 IBM Corporation IBM Research Xianglong Liu 1, Junfeng He 2,3, and Bo Lang 1 1 Beihang University, Beijing, China 2 Columbia University, New York,

Inverting a Singly Linked List Instructor : Prof. Jyh-Shing Roger Jang Designer ： Shao-Huan Wang The ideas are reference to the textbook “Fundamentals.

Error-Correcting codes

Outcome: Determine the square root of perfect squares.

Constant, Linear and Non-Linear Constant, Linear and Non-Linear

Global Constraints Toby Walsh National ICT Australia and University of New South Wales

4.1 Introduction to Matrices

23-8 3x6 Double it Take Away 6 Share By 9 Double it +10 Halve it Beginner Start Answer Intermediate 70 50% of this ÷7÷7 x8 Double it Start Answer.

LA TABLA DEL 5 5X1= 5X2= 5X3= 5X4= 5X5= 5X6= 5X7= 5X8= 5X9= 5X10=

2 x0 0 12/13/2014 Know Your Facts!. 2 x1 2 12/13/2014 Know Your Facts!

2 x /18/2014 Know Your Facts!. 11 x /18/2014 Know Your Facts!

2 x /10/2015 Know Your Facts!. 8 x /10/2015 Know Your Facts!

2.4 – Factoring Polynomials Tricky Trinomials The Tabletop Method.

Strategies – Multiplication and Division

PERMUTATIONS AND COMBINATIONS

Ken McMillan Microsoft Research

1 Lecture 5 PRAM Algorithm: Parallel Prefix Parallel Computing Fall 2008.

A man-machine human interface for a special device of the pervasive computing world B. Apolloni, S. Bassis, A. Brega, S. Gaito, D. Malchiodi, A.M. Zanaboni.

5 x4. 10 x2 9 x3 10 x9 10 x4 10 x8 9 x2 9 x4.

1 The Restaurant Domain Will they wait, or not?. 2 Decision Trees Patrons? NoYesWaitEst? No Alternate?Hungry?Yes Reservation?Fri/Sat?Alternate?Yes NoYesBar?Yes.

If, we assume that a number of variables observed (latent variables), then what the method does is to extract a group of indicators to characterize a variable.

MS 101: Algorithms Instructor Neelima Gupta

Parallel algorithms for expression evaluation Part1. Simultaneous substitution method (SimSub) Part2. A parallel pebble game.

EMIS 8374 LP Review: The Ratio Test. 1 Main Steps of the Simplex Method 1.Put the problem in row-0 form. 2.Construct the simplex tableau. 3.Obtain an.

DIRECTIONAL ARC-CONSISTENCY ANIMATION Fernando Miranda 5986/M

Linear Programming – Simplex Method: Computational Problems Breaking Ties in Selection of Non-Basic Variable – if tie for non-basic variable with largest.

Production Mix Problem Graphical Solution med lrg Electronics Cabinetry Profit (10,20) (Optimal Product Mix!) Profit.

CS 478 – Tools for Machine Learning and Data Mining Clustering: Distance-based Approaches.

The Problem of K Maximum Sums and its VLSI Implementation Sung Eun Bae, Tadao Takaoka University of Canterbury Christchurch New Zealand.

Optimization of order-picking using a revised minimum spanning table method 盧坤勇國立聯合大學電子工程系.

Multiplication Facts Practice

A Case Study  Some Advice on How to Go about Solving Problems in Prolog  A Program to Play Connect-4 Game.

Spatial Information Systems (SIS) COMP Spatial data structures (1)

Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)

Rewrite each expression using the distributive property (4-2).

Developing Mathematical Thinking In Number : Focus on Multiplication.

Variational Inference Amr Ahmed Nov. 6 th Outline Approximate Inference Variational inference formulation – Mean Field Examples – Structured VI.

Chapter 8: The Solver and Mathematical Programming Spreadsheet-Based Decision Support Systems Prof. Name Position (123) University.

Probabilistic sequence modeling II: Markov chains Haixu Tang School of Informatics.

Computational Facility Layout

Shannon Expansion Given Boolean expression F = w 2 ’ + w 1 ’w 3 ’ + w 1 w 3 Shannon Expansion of F on a variable, say w 2, is to write F as two parts:

Graeme Henchel Multiples Graeme Henchel

Quiz Number 2 Group 1 – North of Newark Thamer AbuDiak Reynald Benoit Jose Lopez Rosele Lynn Dave Neal Deyanira Pena Professor Kenneth D. Lawerence New.

The Project Problem formulation (one page) Literature review –“Related work" section of final paper, –Go to writing center, –Present paper(s) to class.

Susan Van Geest Artwork. Altar I: Centrality of Being Marble 1.5’x1.5’x1.5’

library IEEE; use IEEE.STD_LOGIC_1164.ALL;

0 x x2 0 0 x1 0 0 x3 0 1 x7 7 2 x0 0 9 x0 0.

C2 Part 4: VLSI CAD Tools Problems and Algorithms Marcelo Johann EAMTA 2006.

Adding & Subtracting Mixed Numbers. Objective: To develop fluency in +, –, x, and ÷ of non-negative rational numbers. Essential Question: How.

Constraint Networks (cont.) Emma Rollón Postdoctoral researcher at UCI April 1st, 2009.

22 22 33 33 11 11 X1 X2 X3 X4 X5 X6 X7 X8 X9                    2,1  3,1  3,2 2,1 1,1 3,1 4,2 5,2 6,2 7,3 8,3 9,3.

Dempster-Shafer Theory

Fundamentals of Dempster-Shafer Theory presented by Zbigniew W. Ras University of North Carolina, Charlotte, NC College of Computing and Informatics University.

Presentation transcript:

RSES – reducts and discretization of attributes presented by Zbigniew W. Ras University of North Carolina, Charlotte, NC & Warsaw University of Technology, Poland College of Computing and Informatics University of North Carolina, Charlotte

abcdf x10L0L0 x20R1L1 x30L0L0 x40R1L1 x51R0L2 x61R0L2 x72S2H3 x82S2H3 x1 x2bc x3-bc x4bc- x5abacabac x6abacabac- x7abcd x8abcd - x1x2x3x4x5x6x7x8 Discernibility Matrix Information System Discernibility Function: f(a, b, c, d) = (b + c) (a + b) (a + b + c + d) (a + c) =(b + c) (a + b) (a + c) = (ba + bb + ca + cb) (a + c) = (b + ca) (a + c) ba + bc + ca Possible coverings:{b, a}, {c, a},{c, b} (b=L)  (f=0); (a=0)*(b=R)  (f=1); ……

Discretization of numerical attributes Xabd x x x x x x x p1 p2 p3 p4 q1 q2 q3 Dom(a) = {0.8, 1, 1.3, 1.4, 1.6}, Dom(b) = {0.5, 1, 2, 3} Va = [0, 2), Vb = [0, 4) G(x1,x2)=p1+q1+q2 G(x1,x3)=p1+p2+q3 G(x1,x5)=p1+p2+p3 G(x2,x4)=p2+p3+q1 G(x2,x6)=p2+p3+p4+q1+q2+q3 G(x2,x7)=p2+q1 G(x3,x4)=p3+q2+q3 G(x3,x6)=p3+p4 G(x3,x7)=q2+q3 G(x4,x5)=q2 G(x5,x6)=p4+q3 G(x5,x7)=p3+q2 P1P2P2 P3P3 P4Q1Q2Q3 x1,x311 1 x1,x5111 x2,x4 x2,x7 1 1 x3,x6 11 x5,x6 1 1

p(1, a)p(2, a)p(3, a)p(4, a)p(1, b)p(2, b)p(3, b)d* (x1, x2) (x1, x3) (x1, x5) (x4, x2) (x4, x3) (x4, x5) (x6, x2) (x6, x3) (x6, x5) (x7, x2) (x7, x3) (x7, x5) new Step 1.Choose a column from B with the maximal number of occurrences of 1’s. Step 2. Delete from B the column chosen in Step 2 and all rows marked in this column by 1. Step 3.If B is non-empty go to step 2 else Stop.

Thank You Questions?