Skip to main content

Dwdm exp 4

 Exp 4

Steps involved in experiment:

Step 1:create Employee.arff file

@relation employee

@attribute age {25,27,28,29,30,35,48}

@attribute salary {10k,15k,17k,20k,25k,30k,32k}

@attribute performance {poor,average,good}

@data

25,10k,poor

27,15k,poor

27,17k,poor

28,17k,poor

29,20k,average

30,25k,average

29,25k,average

30,20k,average

35,32k,good

35,30k,good

48,32k,good

Strep 2:we  begin experiment by loading the data step3: next to you select classifier tab and click choose button to select j48 classifier.


Step 4: now we specify the various parameters this can done by right click on the text box on right of the choose button.

Step 5: Now wake also let us view of graphical version of the classification tree. this can be done by right clicking the last result set and selecting visualized tree from popup menu.


Output:

//// note down from your system////😀

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