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

Efficiently mining sequential generator patterns using prefix trees

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

DOI10.3233/FI-2015-1217zbMATH Open1334.68196OpenAlexW1949834100MaRDI QIDQ2804197FDOQ2804197


Authors: Thi-Thiet Pham Edit this on Wikidata


Publication date: 28 April 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1217




Recommendations

  • scientific article; zbMATH DE number 2222605
  • On sequential pattern mining algorithms
  • A mining algorithm for fast maximal sequential patterns
  • Mining sequential patterns across time sequences
  • SPADE: An efficient algorithm for mining frequent sequences


zbMATH Keywords

prefix treesequence databasesequential generator patternsequential pattern


Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Searching and sorting (68P10) Database theory (68P15)



Cited In (1)

  • Title not available (Why is that?)





This page was built for publication: Efficiently mining sequential generator patterns using prefix trees

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

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