Method for analyzing data utilizing weighted suffix tree
A method for analyzing data utilizing a weighted suffix tree includes the following steps: at least one raw data sequence is received. The raw data sequence includes a raw data sequence identification (ID) code, and the raw data sequence includes several raw datums. A weighted suffix tree is constru...
Gespeichert in:
Hauptverfasser: | , , , , , , |
---|---|
Format: | Patent |
Sprache: | chi ; eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A method for analyzing data utilizing a weighted suffix tree includes the following steps: at least one raw data sequence is received. The raw data sequence includes a raw data sequence identification (ID) code, and the raw data sequence includes several raw datums. A weighted suffix tree is constructed according to the raw datums of the raw data sequence. The weighted suffix tree includes several nodes, and each of the nodes includes a weight set, which is formed by at least one code selected from the raw data sequence ID code. Group information to divide the raw datums into several groups is received. The nodes of the weighted suffix tree, which belong to the same group, are merged according to the group information. Data analysis is made according to the weighted suffix tree after merged. |
---|