Skip to main content

Data objects & its attribute

Data sets are made up of data objects. A data object represents an entity such as info on customers, products etc. Data objects are typically described by attributes. The data objects stored in database are called data tuples. The row in database refers data objects and column refers its attributes.

A feature of a data object is called an attribute. The type of attributes are Nominal, Binary, Ordinal and Numeric.

A nominal attribute represents some kind of category, code, or state etc., which are also referred to as categorical. Though a nominal attribute may have integers as values, it is not considered a numeric attribute because the integers are not meant to be used quantitatively.

A binary attribute is a nominal one with only two states: 0 or 1. It is also called as Boolean when the states refer true or false. A binary attribute is symmetric if both of its states are equally valuable.

An ordinal attribute is an attribute with possible values that have a meaningful order or ranking among them.

The nominal, binary, and ordinal attributes describe a feature of an object without giving an actual size or quantity, called as qualitative.

A numeric attribute is a measurable quantity, represented in integer or real values, called as quantitative.

Numeric attributes can be interval-scaled or ratio-scaled. Interval-scaled attributes are measured on a scale of equal-size units. A ratio-scaled attribute is a numeric attribute with an inherent zero-point.

A discrete attribute has a finite or countably infinite set of values, which may or may not be represented as integers. If an attribute is not discrete, it is continuous.

Popular posts from this blog

Exercise 2 - Amdahl's Law

A programmer has parallelized 99% of a program, but there is no value in increasing the problem size, i.e., the program will always be run with the same problem size regardless of the number of processors or cores used. What is the expected speedup on 20 processors? Solution As per Amdahl's law, the speedup,  N - No of processors = 20 f - % of parallel operation = 99% = 1 / (1 - 0.99) + (0.99 / 20) = 1 / 0.01 + (0.99 / 20) = 16.807 The expected speedup on 20 processors is 16.807

Exercise 1 - Amdahl's Law

A programmer is given the job to write a program on a computer with processor having speedup factor 3.8 on 4 processors. He makes it 95% parallel and goes home dreaming of a big pay raise. Using Amdahl’s law, and assuming the problem size is the same as the serial version, and ignoring communication costs, what is the speedup factor that the programmer will get? Solution Speedup formula as per Amdahl's Law, N - no of processor = 4 f - % of parallel operation = 95% Speedup = 1 / (1 - 0.95) + (0.95/4) = 1 / 0.5 + (0.95/4) Speedup = 3.478 The programmer gets  3.478 as t he speedup factor.

Minor, Cofactor, Determinant, Adjoint & Inverse of a Matrix

Consider a matrix Minor of a Matrix I n the above matrix A, the minor of first element a 11  shall be Cofactor The Cofactor C ij  of an element a ij shall be When the sum of row number and column number is even, then Cofactor shall be positive, and for odd, Cofactor shall be negative. The determinant of an n x n matrix can be defined as the sum of multiplication of the first row element and their respective cofactors. Example, For a 2 x 2 matrix Cofactor C 11 = m 11 = | a 22 | = a 22  = 2 Determinant The determinant of A is  |A| = (3 x 2) - (1 x 1) = 5 Adjoint or Adjucate The Adjoint matrix of A , adjA is the transpose of its cofactor matrix. Inverse Matrix A matrix should be square matrix to have an inverse matrix and also its determinant should not be zero. The multiplication of matrix and its inverse shall be Identity matrix. The square matrix has no inverse is called Singular. Inv A = adjA / |A|           [ adjoint A / determ...