direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments


Scalable Frequent Sequence Mining With Flexible Subsequence Constraints
Zitatschlüssel Renz-WielandBG19
Autor Alexander Renz-Wieland, Matthias Bertsch, Rainer Gemulla,
Jahr 2019
Journal 35th IEEE International Conference on Data Engineering (ICDE 2019)
Jahrgang 2019
Zusammenfassung We study scalable algorithms for frequent sequencemining under flexible subsequence constraints. Such constraints enable applications to specify concisely which patterns are ofinterest and which are not. We focus on the bulk synchronous parallel model with one round of communication; this model is suitable for platforms such as MapReduce or Spark. We derive a general framework for frequent sequence mining under this model and propose the D-SEQ and D-CAND algorithms within this framework. The algorithms differ in what data are communicated and how computation is split up among workers.To the best of our knowledge, D-SEQ and D-CAND are the first scalable algorithms for frequent sequence mining with flexible constraints. We conducted an experimental study on multiple real-world datasets that suggests that our algorithms scale nearly linearly, outperform common baselines, and offer acceptable generalization overhead over existing, less general mining algorithms.
Link zur Publikation [1] Link zur Originalpublikation [2] Download Bibtex Eintrag [3]

------ Links: ------

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008