Editing
When to Update Sequential Patterns in Stream Data?
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
Title: When to Update Sequential Patterns in Stream Data? Abstract: This research investigates the optimal time to update sequential patterns in stream data. It proposes a method called TPD (Tradeoff between Performance and Difference) to determine when to update sequential patterns by making a tradeoff between the performance of increasingly updating algorithms and the difference of sequential patterns. The study uses experimental data from GSM alarm data sets to verify the proposed method. Main Research Question: How can we determine the optimal time to update sequential patterns in stream data while balancing the performance of increasingly updating algorithms and the difference of sequential patterns? Methodology: The study first defines a distance measure between old and new sequential patterns, which is proven to be a distance. It then proposes the TPD method to decide when to update sequential patterns by making a tradeoff between the performance of increasingly updating algorithms and the difference of sequential patterns. Results: Experiments on two GSM alarm data sets show that, as the size of incremental windows grows, the values of the speedup (performance) and the values of the difference (between old and new sequential patterns) decrease and increase respectively. The study also finds that the incremental ratio determined by the TPD method does not monotonically increase or decrease but changes in a range between 20 and 30 percentage for the IUS algorithm. Implications: The TPD method provides a practical solution to the problem of determining when to update sequential patterns in stream data. It helps balance the performance of increasingly updating algorithms and the difference of sequential patterns, ensuring that updates are made when necessary without overburdening resources. This can lead to more efficient data mining processes in real-time applications. Link to Article: https://arxiv.org/abs/0203028v3 Authors: arXiv ID: 0203028v3 [[Category:Computer Science]] [[Category:Sequential]] [[Category:Patterns]] [[Category:Data]] [[Category:Update]] [[Category:Between]]
Summary:
Please note that all contributions to Simple Sci Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Simple Sci Wiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
Edit source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information