Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A high-speed heuristic algorithm for mining frequent patterns in data stream

From MaRDI portal
Publication:3365677
Jump to:navigation, search

zbMATH Open1108.68438MaRDI QIDQ3365677FDOQ3365677


Authors: Xin Zhang, Xiaoguang Li, Daling Wang, Ge Yu Edit this on Wikidata


Publication date: 23 January 2006





Recommendations

  • Algorithm of frequent-patterns mining in data stream
  • Mining frequent closed patterns over data stream
  • Fast mining frequent patterns in semi-structured data stream
  • An efficient algorithm for mining approximate frequent item over data streams
  • MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Data structures (68P05) Nonnumerical algorithms (68W05)



Cited In (4)

  • Fast mining frequent patterns in semi-structured data stream
  • Algorithm of frequent-patterns mining in data stream
  • Mining top-\(k\) high utility patterns over data streams
  • Mining frequent closed itemsets from a landmark window over online data streams





This page was built for publication: A high-speed heuristic algorithm for mining frequent patterns in data stream

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3365677)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3365677&oldid=16629228"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 15:30. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki