(b) Suppose that a machine prints a status message every minute. Each status message consists of one of the letters A,B,C,D,E or F depending on the machine's internal diagnostics. You suspect that there is a pattern that could predict the occurrence of the next status message being D based on the sequence the previous four (4) messages. You have available a large sequential stream of historical status messages produced by the machine over several days. How would you arrange or transform this data stream, creating appropriate attribute names where required, such that a decision tree learning task could be used to investigate this hypothesis. Further demonstrate this with the first 35 minutes of this status stream included below. B,D,E,A,D,E,E,B,C,B,A,E,E,B,D,B,D,B,F,A,A,B,B,D,D,B,E,E,A,D,E,C,E,E,F,...

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Please written by computer source 

 

(b) Suppose that a machine prints a status message every minute. Each status message consists
of one of the letters A,B,C,D,E or F depending on the machine's internal diagnostics. You suspect
that there is a pattern that could predict the occurrence of the next status message being D based
on the sequence the previous four (4) messages.
You have available a large sequential stream of historical status messages produced by the
machine over several days. How would you arrange or transform this data stream, creating
appropriate attribute names where required, such that a decision tree learning task could be used
to investigate this hypothesis. Further demonstrate this with the first 35 minutes of this status
stream included below.
B,D,E,A,D,E,E,B,C,B,A,E,E,B,D,B,D,B,F,A,A,B,B,D,D,B,E,E,A,D,E,C,E,E,F,...
Transcribed Image Text:(b) Suppose that a machine prints a status message every minute. Each status message consists of one of the letters A,B,C,D,E or F depending on the machine's internal diagnostics. You suspect that there is a pattern that could predict the occurrence of the next status message being D based on the sequence the previous four (4) messages. You have available a large sequential stream of historical status messages produced by the machine over several days. How would you arrange or transform this data stream, creating appropriate attribute names where required, such that a decision tree learning task could be used to investigate this hypothesis. Further demonstrate this with the first 35 minutes of this status stream included below. B,D,E,A,D,E,E,B,C,B,A,E,E,B,D,B,D,B,F,A,A,B,B,D,D,B,E,E,A,D,E,C,E,E,F,...
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Fundamentals of Memory
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education