Program Explanation Program: DecisionTreeDemo.java: //Adding the package package javafx.swing; //Importing the required header files import java.util.HashMap; import java.util.ArrayList; import javax.swing.JOptionPane; //Defining the class DecisionTreeDemo public class DecisionTreeDemo { private Node root; //Declaring variables private ArrayList<String> criteria; private String objective; private ArrayList<Fact> facts; //Defining the constructor DecisionTreeDemo() public DecisionTreeDemo() { root = null; criteria = new ArrayList<>(); gatherCriteriaAndObjective(); facts = new ArrayList<>(); gatherFacts(); root = buildDecisionTree(criteria, objective, facts); } //Defining the constructor with criteria and objective public DecisionTreeDemo(ArrayList<String> criteria, String objective) { root = null; this.criteria = criteria; this.objective = objective; facts = new ArrayList<>(); gatherFacts(); root = buildDecisionTree(criteria, objective, facts); } //Defining the constructor DecisionTreeDemo() with criteria, objective and facts public DecisionTreeDemo(ArrayList<String> criteria, String objective, String[][] answerList) { root = null; this.criteria = criteria; this.objective = objective; facts = new ArrayList<>(); for (int i = 0; i < answerList.length; i++) { facts.add(makeFact(criteria, objective, answerList[i])); } root = buildDecisionTree(criteria, objective, facts); } //Defining the makeFact() private Fact makeFact(ArrayList<String> criteria, String objective, String[] answerList) { HashMap<String, String> answers = new HashMap<>(); for (int i = 0; i < criteria.size(); i++) { answers.put(criteria.get(i), answerList[i]); } answers.put(objective, answerList[criteria.size()]); return new Fact(this, answers); } //Defining the get method for criteria public ArrayList<String> getCriteria() { return criteria; } //Defining the get method for objective public String getObjective() { return objective; } //Defining the gatherCriteriaAndObjective() private void gatherCriteriaAndObjective() { boolean done = false; // gather criteria while (!done) { String newCriteria = (String) JOptionPane.showInputDialog(null, "Please enter a new criteria, or hit cancel to finish.","Please enter a new criteria, or hit cancel to finish.",JOptionPane.PLAIN_MESSAGE, null, null, ""); if (newCriteria != null) { criteria.add(newCriteria); } else { done = true; } } // gather objective objective = null; while (objective == null) { objective = (String) JOptionPane.showInputDialog(null,"Please enter an objective.", "Please enter an objective.", JOptionPane.PLAIN_MESSAGE, null, null, ""); } } //Defining the gatherFacts() private void gatherFacts() { boolean done = false; while (!done) { int choice = JOptionPane.showConfirmDialog(null, "Hit Ok to add a new fact, or cancel to begin the demo.","Hit Ok to add a new fact, or cancel to begin the demo.", JOptionPane.OK_CANCEL_OPTION); if (choice != JOptionPane.CANCEL_OPTION) { Fact = new Fact(this); facts.add(fact); } else { done = true; } } } //Defining the buildDecisionTree() private static Node buildDecisionTree(ArrayList<String> criteria, String objective, ArrayList<Fact> facts) { if ((criteria.size() > 0) && (facts.size() > 1)) { // Determining the root using U(c, o) String chosenCriteria = findCriterion(criteria, objective, facts); criteria.remove(chosenCriteria); Node = new Node(chosenCriteria); //Splitting the facts by those that meet and don't meet ArrayList<Fact> factsMet = new ArrayList<>(); ArrayList<Fact> factsNotMet = new ArrayList<>(); for (Fact f : facts) { if (f.getAnswer(chosenCriteria).equals("Y")) { factsMet.add(f); } else { factsNotMet.add(f); } } // Recursively building the subtrees node.left = buildDecisionTree(criteria, objective, factsMet); node.right = buildDecisionTree(criteria, objective, factsNotMet); return node; } else { //Determine if facts meet criteria String answer = "?"; for (Fact f : facts) { if (answer.equals("?")) { answer = f.getAnswer(objective); } else if (!answer.equals(f.getAnswer(objective))) { answer = "?"; } } return new Node(objective + " " + answer); } } //Defining the findCriterion() private static String findCriterion(ArrayList<String> criteria, String objective, ArrayList<Fact> facts) { String foundCriterion = ""; double lowestScore = 1.0; for (String criterion : criteria) { double score = U(criterion, objective, facts); if (score <= lowestScore) { foundCriterion = criterion; lowestScore = score; } } return foundCriterion; } //Defining the U() private static double U(String criteria, String objective, ArrayList<Fact> facts) { int metCriteria = 0; int metCriteriaMetObjective = 0; int didntMeetCriteriaMetObjective = 0; for (Fact f : facts) { boolean metObjective = f...

2nd Edition

ISBN: 9781119626220

Author: Horstmann

Publisher: WILEY

See similar textbooks

Expert Solution & Answer

Chapter 17, Problem 7PP

Program Description Answer

This program is used to implement the decision tree for a set of sample facts. The “getCriteria()” and “getObjective()” methods are used to collect the facts in “DecisionTreeDemo” class.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 17, Problem 6PP

Chapter 17, Problem 8PP

Students have asked these similar questions

Using R language. Here is the information link. http://www.cnachtsheim-text.csom.umn.edu/Kutner/Chapter%20%206%20Data%20Sets/CH06PR18.txt

Using R language

How can I type the Java OOP code by using JOptionPane with this following code below: public static void sellCruiseTicket(Cruise[] allCruises) { //Type the code here }

Chapter 17 Solutions

BIG JAVA: LATE OBJECTS

Ch. 17.1 - Prob. 1SC Ch. 17.1 - Prob. 2SC Ch. 17.1 - Prob. 3SC Ch. 17.1 - Prob. 4SC Ch. 17.1 - Prob. 5SC Ch. 17.1 - Prob. 6SC Ch. 17.1 - Prob. 7SC Ch. 17.2 - Prob. 8SC Ch. 17.2 - Prob. 9SC Ch. 17.2 - Prob. 10SC

Ch. 17.2 - Prob. 11SC Ch. 17.2 - Prob. 12SC Ch. 17.3 - Prob. 13SC Ch. 17.3 - Prob. 14SC Ch. 17.3 - Prob. 15SC Ch. 17.3 - Prob. 16SC Ch. 17.3 - Prob. 17SC Ch. 17.3 - Prob. 18SC Ch. 17.4 - Prob. 19SC Ch. 17.4 - Prob. 20SC Ch. 17.4 - Prob. 21SC Ch. 17.4 - Prob. 22SC Ch. 17.4 - Prob. 23SC Ch. 17.4 - Prob. 24SC Ch. 17.5 - Prob. 25SC Ch. 17.5 - Prob. 26SC Ch. 17.5 - Prob. 27SC Ch. 17.5 - Prob. 28SC Ch. 17.5 - Prob. 29SC Ch. 17.5 - Prob. 30SC Ch. 17.6 - Prob. 31SC Ch. 17.6 - Prob. 32SC Ch. 17.6 - Prob. 33SC Ch. 17.6 - Prob. 34SC Ch. 17.6 - Prob. 35SC Ch. 17.7 - Prob. 36SC Ch. 17.7 - Prob. 37SC Ch. 17.7 - Prob. 38SC Ch. 17.7 - Prob. 39SC Ch. 17.7 - Prob. 40SC Ch. 17 - Prob. 1RE Ch. 17 - Prob. 2RE Ch. 17 - Prob. 3RE Ch. 17 - Prob. 4RE Ch. 17 - Prob. 5RE Ch. 17 - Prob. 6RE Ch. 17 - Prob. 7RE Ch. 17 - Prob. 8RE Ch. 17 - Prob. 9RE Ch. 17 - Prob. 10RE Ch. 17 - Prob. 11RE Ch. 17 - Prob. 12RE Ch. 17 - Prob. 13RE Ch. 17 - Prob. 14RE Ch. 17 - Prob. 16RE Ch. 17 - Prob. 18RE Ch. 17 - Prob. 19RE Ch. 17 - Prob. 20RE Ch. 17 - Prob. 21RE Ch. 17 - Prob. 22RE Ch. 17 - Prob. 23RE Ch. 17 - Prob. 24RE Ch. 17 - Prob. 25RE Ch. 17 - Prob. 26RE Ch. 17 - Prob. 27RE Ch. 17 - Prob. 28RE Ch. 17 - Prob. 1PE Ch. 17 - Prob. 2PE Ch. 17 - Prob. 3PE Ch. 17 - Prob. 4PE Ch. 17 - Prob. 5PE Ch. 17 - Prob. 6PE Ch. 17 - Prob. 7PE Ch. 17 - Prob. 8PE Ch. 17 - Prob. 9PE Ch. 17 - Prob. 10PE Ch. 17 - Prob. 11PE Ch. 17 - Prob. 12PE Ch. 17 - Prob. 13PE Ch. 17 - Prob. 1PP Ch. 17 - Prob. 2PP Ch. 17 - Prob. 3PP Ch. 17 - Prob. 4PP Ch. 17 - Prob. 5PP Ch. 17 - Prob. 6PP Ch. 17 - Prob. 7PP Ch. 17 - Prob. 8PP Ch. 17 - Prob. 9PP Ch. 17 - Prob. 10PP Ch. 17 - Prob. 11PP

Knowledge Booster