Skip to main content

Dwdm 2.f

 F.)Load each dataset and observe the following:

1. List the attribute names and they type.

2. Number of records in each dataset

3. Identify the class attribute (if any)

4. Plot Histogram

5. Determine the number of records for each class.

6. Visualize the data in various dimensions

Procedure:

1) Open the WEKA tool and Select the Explorer option.

2) A new window will be opened which consists of six tabs – Preprocess, Classify, 

Cluster, Associate, Select Attributes and Visualize.

3) In the Preprocess tab, Click the “Open file” option.

4) Go to C:\Program Files\Weka-3-8-6\data for finding different existing .arff

datasets.

5) Click on any of the dataset for loading the data and then the data will be

displayed as shown.

6) Here Weather.arff dataset is chosen as sample for all the observations.

1. List the attribute names and their type.

There are 5 attributes and its data type presented in the loaded dataset Weather.arff.

S.NO. ATTRIBUTE NAME DATA TYPE

1              Outlook                Nominal

2            Temperature.         Nominal

3               Humidity.            Nominal

4               Windy.                 Nominal

5                  Play                   Nominal

2. Number of records in each dataset

There is total 14 records (Instances) in the loaded dataset Weather.arff.

3. Identify the class attribute (if any)

Play is the class attribute in the loaded dataset Weather.arff.

4. Plot Histogram

//////Draw the histogram displayed in your weka weather dataset/////////

5. Determine the number of records for each class.

S.NO. ATTRIBUTE NAME RECORDS (INSTANCES)

1                Outlook                  14

2          Temperature              14

3.            Humidity.                14

4                Windy                    14

5                Play                        14

6. Visualize the data in various dimensions

Plot Matrix for the loaded dataset Weather.arff.

///////Draw the plot by clicking on visualize button //////

Comments

Popular posts from this blog

Data structures: Introduction to Trees

Tree: The data in a tree are not stored in a sequential manner i.e., they are not stored linearly. Instead, they are arranged on multiple levels or we can say it is a hierarchical structure. For this reason, the tree is considered to be a non-linear data structure. KeyConcepts : Nodes : Individual units within the tree, each storing data and potentially linking to other nodes. Edges : Connections between nodes, representing relationships (parent-child, sibling, etc.). Root : The topmost node in the tree, from which all other nodes originate. Parent : A node that has one or more child nodes. Child : A node connected to a parent node. Leaf : A node with no children. Subtree : A portion of a tree that is itself a tree. Representation of tree: Binary search tree :

Hashing and hash functions

Types of hash functions

Data structures dequeues