Update README.md
Browse files
README.md
CHANGED
|
@@ -1,8 +1,31 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
## Generation Logic & Sliding Windows (Important)
|
| 2 |
|
| 3 |
-
The
|
| 4 |
|
| 5 |
-
To generate training data, we use a sliding window approach encompassing exactly **three consecutive boundary timestamps** (**T1**, **T2**, and **T3**) for each input:
|
| 6 |
|
| 7 |
* **T1 (The Anchor):** The known starting timestamp of the current event.
|
| 8 |
* **T2 (The Target):** The actual event boundary the model must predict.
|
|
@@ -10,12 +33,16 @@ To generate training data, we use a sliding window approach encompassing exactly
|
|
| 10 |
|
| 11 |
### Why include the third timestamp (T3)?
|
| 12 |
|
| 13 |
-
Each input
|
|
|
|
|
|
|
| 14 |
|
| 15 |
### Example
|
| 16 |
|
| 17 |
Assume a recording has three sequential boundaries: `0.007194`, `21.987222`, and `37.178971`.
|
| 18 |
-
|
| 19 |
-
|
| 20 |
-
|
| 21 |
-
* **
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: mit
|
| 3 |
+
task_categories:
|
| 4 |
+
- text-generation
|
| 5 |
+
- token-classification
|
| 6 |
+
pretty_name: Terminal Recording Group Boundary Timestamps
|
| 7 |
+
size_categories:
|
| 8 |
+
- n < 1K
|
| 9 |
+
tags:
|
| 10 |
+
- terminal
|
| 11 |
+
- xml
|
| 12 |
+
- boundary-detection
|
| 13 |
+
---
|
| 14 |
+
|
| 15 |
+
# Terminal Recording Group Boundary Dataset
|
| 16 |
+
|
| 17 |
+
This dataset consists of raw terminal recording logs in XML format, paired with ground-truth timestamps for shell prompt boundaries.
|
| 18 |
+
|
| 19 |
+
## Training Approach: Event Chunking
|
| 20 |
+
|
| 21 |
+
Terminal recordings are essentially long, continuous streams of text data. To make this data useful for downstream tasks, we must first break this stream into logical "events" (e.g., a single command execution and its resulting output).
|
| 22 |
+
**Model 0** is specifically designed for this segmentation task. Instead of just looking for text patterns, the model is trained to identify the precise temporal boundary where one event ends and the next begins.
|
| 23 |
+
|
| 24 |
## Generation Logic & Sliding Windows (Important)
|
| 25 |
|
| 26 |
+
The label the model must predict is the **boundary timestamp**—the exact moment the shell prompt returns, signaling the end of an event.
|
| 27 |
|
| 28 |
+
To generate robust training data, we use a sliding window approach encompassing exactly **three consecutive boundary timestamps** (**T1**, **T2**, and **T3**) for each input:
|
| 29 |
|
| 30 |
* **T1 (The Anchor):** The known starting timestamp of the current event.
|
| 31 |
* **T2 (The Target):** The actual event boundary the model must predict.
|
|
|
|
| 33 |
|
| 34 |
### Why include the third timestamp (T3)?
|
| 35 |
|
| 36 |
+
Each training input contains all `<user_input>` and `<system_output>` XML tags from **T1** all the way to **T3**.
|
| 37 |
+
|
| 38 |
+
If the input window stopped at **T2**, the task would be trivial: the model would eventually realize it just needs to extract the very last timestamp present in the provided text. By extending the context to **T3**, we include a "distractor" event. This forces the model to semantically understand the terminal log and identify the **internal** boundary dividing the two separate events, rather than just pointing to the end of the file.
|
| 39 |
|
| 40 |
### Example
|
| 41 |
|
| 42 |
Assume a recording has three sequential boundaries: `0.007194`, `21.987222`, and `37.178971`.
|
| 43 |
+
|
| 44 |
+
1. **The Input Window:** Contains all XML chunks from `0.007194` to `37.178971`.
|
| 45 |
+
2. **The Content:** This window actually covers two distinct events:
|
| 46 |
+
* **Event A:** Context between `0.007194` and `21.987222`.
|
| 47 |
+
* **Event B:** Context between `21.987222` and `37.178971`.
|
| 48 |
+
3. **The Target Output:** `21.987222` (the dividing boundary).
|