Thesis Report Latex

Intro ] Fast Algorithms for Mining Association Rules.tex ] Mining Association Rules between Sets of Items in Large Databases.tex ]
Mining Association Rules from Set Valued Data.tex ] abstract.tex ] algorithmic.sty ]
appendix-log-metrics.tex ] appendix-performance-data.tex ] appendix-performance-metrics.tex ]
appendix-readme.tex ] appendix-sleep-data.tex ] appendix-stock-data.tex ]
asas-1-candidate.tex ] asas-1-support.tex ] asas-2-candidate.tex ]
asas-2-support.tex ] asas-3-candidate.tex ] asas-algorithm.tex ]
asas-confidence.tex ] asas-details.tex ] asas-duplicate-item-sets.tex ]
asas-general.tex ] asas-implementation-filters.tex ] asas-implementation-other-features.tex ]
asas-implementation-rule-generation.tex ] asas-implementation-support-counting-prune.tex ] asas-implementation.tex ]
asas-input.tex ] asas-multiple-events.tex ] asas.bib ]
asas.tex ] background-apriori-sets.tex ] background-apriori.tex ]
background-association-rules.tex ] background-pattern-matching.tex ] background-weka-arff.tex ]
background.tex ] conclusions-future-work.tex ] contribution.tex ]
data-representation.tex ] event-attributes.tex ] experimental-evaluation.tex ]
future-work.tex ] intro-context.tex ] intro-definition.tex ]
intro-motivation.tex ] intro.tex ] itemset-data-structures.tex ]
kap.bib ] perf-experiments-data-collection.tex ] perf-experiments.tex ]
performance-evaluation.tex ] related-work.tex ] sleep-experiments-old.tex ]
sleep-experiments.tex ] stock-experiments.tex ] thesis-2-2column.tex ]
thesis.aux ] thesis.bbl ] thesis.blg ]
thesis.dvi ] [ thesis.lof ] thesis.log ]
thesis.lot ] thesis.pdf ] thesis.ps ]
thesis.tex ] thesis.toc ]

ASAS Thesis ] Solution ] WPI-CSGSO-thesis-template ]
algorithm-example ] figures ] financial-events ]
old ] other-bib-files ] Up: Documents ]

\addvspace {10\p@ } \contentsline {figure}{\numberline {1.1}{\ignorespaces A sample of a data set containing complex instances. Here, sequential values are represented in a graphical manner only for the first row to save space.}}{3} \addvspace {10\p@ } \addvspace {10\p@ } \addvspace {10\p@ } \contentsline {figure}{\numberline {4.1}{\ignorespaces A Sequence Example. Here the top row represents a basic time line without units. The bottom row contains the values of the sequence for the CPU attribute.}}{14} \contentsline {figure}{\numberline {4.2}{\ignorespaces Generating Item Types}}{15} \contentsline {figure}{\numberline {4.3}{\ignorespaces Here is the sample data set with the CPU sequence attribute replaced with the CPU-Increase event attribute.}}{16} \contentsline {figure}{\numberline {4.4}{\ignorespaces Increase Event}}{17} \contentsline {figure}{\numberline {4.5}{\ignorespaces Decrease Event}}{17} \contentsline {figure}{\numberline {4.6}{\ignorespaces Sustain Event}}{18} \addvspace {10\p@ } \contentsline {figure}{\numberline {5.1}{\ignorespaces An item set containing 3 events. Disk Increase [$t_0$, $t_1$], Disk Sustain [$t_2$, $t_3$], Disk Sustain [$t_4$, $t_5$]}}{21} \contentsline {figure}{\numberline {5.2}{\ignorespaces Adding the Increase Event 2 to item set in Figure 5.1\hbox {}}}{22} \contentsline {figure}{\numberline {5.3}{\ignorespaces Relative Time Line Array. DI = Disk Increase, CI = CPU Increase, b = begin, e = end.}}{24} \contentsline {figure}{\numberline {5.4}{\ignorespaces Relative Time Line Array. DI = Disk Increase, CI = CPU, Increase, MS = Memory Sustain, b = begin, e = end.}}{24} \contentsline {figure}{\numberline {5.5}{\ignorespaces Relative Time Line Array. DI = Disk Increase, CI = CPU, Increase, MS = Memory Sustain, b = begin, e = end.}}{25} \addvspace {10\p@ } \contentsline {figure}{\numberline {6.1}{\ignorespaces Level 1 Mapping. DI = Disk Increase, CI = CPU Increase, b = begin, e = end.}}{30} \contentsline {figure}{\numberline {6.2}{\ignorespaces All Possible Temporal Relationships Between Two Events. Each event is depicted by a rectangle (one dark and one light). Numbers in the rectangles denote relative times $t_0$, $t_1$, $t_2$, and $t_3$.}}{31} \contentsline {figure}{\numberline {6.3}{\ignorespaces Level 2 Mapping. DI = Disk Increase, CI = CPU Increase, b = begin, e = end.}}{32} \contentsline {figure}{\numberline {6.4}{\ignorespaces Combine Item Sets}}{34} \contentsline {figure}{\numberline {6.5}{\ignorespaces Selective candidate generation by joining events A and B from Figure 6.4\hbox {}}}{35} \contentsline {figure}{\numberline {6.6}{\ignorespaces Selective Candidate Generation Result}}{35} \contentsline {figure}{\numberline {6.7}{\ignorespaces Candidates from Combining Item Sets 1 and 2}}{37} \contentsline {figure}{\numberline {6.8}{\ignorespaces Candidates from Combining Item Sets 1 and 3}}{38} \contentsline {figure}{\numberline {6.9}{\ignorespaces Candidates from Combining Item Sets 2 and 3}}{39} \contentsline {figure}{\numberline {6.10}{\ignorespaces Prefix Tree}}{40} \contentsline {figure}{\numberline {6.11}{\ignorespaces Apriori Calculate Confidence}}{41} \contentsline {figure}{\numberline {6.12}{\ignorespaces ASAS Calculate Confidence}}{42} \contentsline {figure}{\numberline {6.13}{\ignorespaces Finding Antecedent}}{42} \contentsline {figure}{\numberline {6.14}{\ignorespaces Extending Antecedent to Include Consequent}}{43} \addvspace {10\p@ } \contentsline {figure}{\numberline {7.1}{\ignorespaces Several Time Granularities}}{44} \addvspace {10\p@ } \contentsline {figure}{\numberline {8.1}{\ignorespaces Partial Sample of A Single Performance Data Instance. See Appendix C\hbox {} and Appendix D\hbox {} for a complete listing.}}{51} \contentsline {figure}{\numberline {8.2}{\ignorespaces Idle Process Time Increases [$t_0$, $t_1$] $\Rightarrow $ Total Process Time Decreases [$t_0$, $t_1$]}}{52} \contentsline {figure}{\numberline {8.3}{\ignorespaces Total Memory in Use Decreases [$t_0$, $t_1$] $\Rightarrow $ Total Process Time Decreases [$t_0$, $t_2$]}}{53} \contentsline {figure}{\numberline {8.4}{\ignorespaces Performance Instance. See Appendix C\hbox {} and Appendix D\hbox {} for a complete listing.}}{54} \contentsline {figure}{\numberline {8.5}{\ignorespaces A sample of a company and stock market dataset containing complex instances. Here, sequential values are represented in a graphical manner only for the first row to save space.}}{55} \contentsline {figure}{\numberline {8.6}{\ignorespaces AMD Ascending Triangle [$t_0$,$t_1$] and SUNW Sustain [$t_2$,$t_3$] $\Rightarrow $ CSCO Expand Merge [$t_4$,$t_5$]}}{57} \contentsline {figure}{\numberline {8.7}{\ignorespaces INTC Sustain [$t_0$,$t_1$] $\Rightarrow $ INTC Sustain [$t_2$,$t_3$]}}{59} \contentsline {figure}{\numberline {8.8}{\ignorespaces A sample of a dataset containing complex instances. Here, sequential values are represented in a graphical manner only for the first row to save space. {\bf G} stands for Gender with values M (male) and F (female). S$i$ denotes sleep stage $i$. Medication names have been abbreviated.}}{61} \contentsline {figure}{\numberline {8.9}{\ignorespaces Sleep Stage 1 [$t_0$, $t_2$] and Granule 700-749 [$t_1$, $t_3$] $\Rightarrow $ Mild OSA}}{62} \contentsline {figure}{\numberline {8.10}{\ignorespaces Sleep Stage 2 [$t_1$, $t_3$] and Granule 150-199 [$t_0$, $t_2$] $\Rightarrow $ Moderately Severe OSA}}{62} \contentsline {figure}{\numberline {8.11}{\ignorespaces Sleep Stage 3 [$t_1$, $t_3$] and Granule 300-349 [$t_0$, $t_2$] $\Rightarrow $ No OSA}}{63} \contentsline {figure}{\numberline {8.12}{\ignorespaces Sleep Stage REM [$t_1$, $t_2$] and Granule 750-799 [$t_0$, $t_3$] $\Rightarrow $ No OSA}}{63} \contentsline {figure}{\numberline {8.13}{\ignorespaces Data Set Events and Total Mining Time}}{65} \contentsline {figure}{\numberline {8.14}{\ignorespaces Frequent Item Sets and Total Mining Time}}{66} \contentsline {figure}{\numberline {8.15}{\ignorespaces Data Set Time Line and Mining Time per Frequent Item Set}}{67} \contentsline {figure}{\numberline {8.16}{\ignorespaces Data Set Events and Mining Time per Frequent Item Set}}{68} \contentsline {figure}{\numberline {8.17}{\ignorespaces Diminishing Returns With Higher Number of Same Type Events Allowed In a Rule}}{69} \contentsline {figure}{\numberline {8.18}{\ignorespaces Diminishing Returns With Higher Number of Same Type Events Allowed In a Rule and Lower Support}}{70} \addvspace {10\p@ } \contentsline {figure}{\numberline {9.1}{\ignorespaces Candidates from Combining Item Sets Level 1}}{74} \contentsline {figure}{\numberline {9.2}{\ignorespaces Candidates from Combining Item Sets Level 2}}{75} \contentsline {figure}{\numberline {9.3}{\ignorespaces Candidates from Combining Item Sets Level 1a Improved}}{76} \contentsline {figure}{\numberline {9.4}{\ignorespaces Candidates from Combining Item Sets Level 1b Improved}}{77} \contentsline {figure}{\numberline {9.5}{\ignorespaces Candidates from Combining Item Sets Level 2 Improved}}{78} \addvspace {10\p@ } \addvspace {10\p@ } \addvspace {10\p@ } \addvspace {10\p@ } \addvspace {10\p@ } \contentsline {figure}{\numberline {E.1}{\ignorespaces Rounded Top}}{106} \contentsline {figure}{\numberline {E.2}{\ignorespaces Selling Climax}}{106} \contentsline {figure}{\numberline {E.3}{\ignorespaces Ascending Triangle}}{107} \contentsline {figure}{\numberline {E.4}{\ignorespaces Broadening Top}}{107} \contentsline {figure}{\numberline {E.5}{\ignorespaces Descending Triangle}}{108} \contentsline {figure}{\numberline {E.6}{\ignorespaces Double Bottom}}{108} \contentsline {figure}{\numberline {E.7}{\ignorespaces Double Top}}{109} \contentsline {figure}{\numberline {E.8}{\ignorespaces Head and Shoulders}}{109} \contentsline {figure}{\numberline {E.9}{\ignorespaces Inverse Head and Shoulders}}{109} \contentsline {figure}{\numberline {E.10}{\ignorespaces Panic Reversal}}{110} \contentsline {figure}{\numberline {E.11}{\ignorespaces Rounded Bottom}}{110} \contentsline {figure}{\numberline {E.12}{\ignorespaces Triple Bottom}}{110} \contentsline {figure}{\numberline {E.13}{\ignorespaces Triple Top}}{111} \contentsline {figure}{\numberline {E.14}{\ignorespaces Sustain}}{111} \contentsline {figure}{\numberline {E.15}{\ignorespaces Increase}}{111} \contentsline {figure}{\numberline {E.16}{\ignorespaces Decrease}}{112} \addvspace {10\p@ }
 

by: Keith A. Pray
Last Modified: July 4, 2004 7:39 AM
© 2004 - 1975 Keith A. Pray.
All rights reserved.