|
Scalable frequent sequence mining with flexible subsequence constraints
Renz-Wieland, Alexander
;
Bertsch, Mattias
;
Gemulla, Rainer
![[img]](https://madoc.bib.uni-mannheim.de/48219/1.hassmallThumbnailVersion/Scalable%20Frequent%20Sequence%20Mining%20With%20Flexible%20Subsequence%20Constraints.pdf)  Vorschau |
|
PDF
Scalable Frequent Sequence Mining With Flexible Subsequence Constraints.pdf
- Veröffentlichte Version
Download (305kB)
|
|
DOI:
|
https://doi.org/10.1109/ICDE.2019.00134
|
|
URL:
|
https://madoc.bib.uni-mannheim.de/48219
|
|
Weitere URL:
|
https://ieeexplore.ieee.org/document/8731375
|
|
URN:
|
urn:nbn:de:bsz:180-madoc-482199
|
|
Dokumenttyp:
|
Konferenzveröffentlichung
|
|
Erscheinungsjahr:
|
2019
|
|
Buchtitel:
|
IEEE 35th International Conference on Data Engineering : ICDE 2019 : Macau SAR, China, 8-11 April 2019 : proceedings
|
|
Seitenbereich:
|
1490-1501
|
|
Veranstaltungstitel:
|
2019 IEEE International Conference on Data Engineering (ICDE)
|
|
Veranstaltungsort:
|
Macao, Macao, China
|
|
Veranstaltungsdatum:
|
8-11 April 2019
|
|
Ort der Veröffentlichung:
|
Piscataway, NJ
|
|
Verlag:
|
IEEE
|
|
ISBN:
|
978-1-5386-7474-1 , 978-1-5386-7475-8
|
|
ISSN:
|
1063-6382 , 2375-026X
|
|
Sprache der Veröffentlichung:
|
Englisch
|
|
Einrichtung:
|
Fakultät für Wirtschaftsinformatik und Wirtschaftsmathematik > Practical Computer Science I: Data Analytics (Gemulla 2014-)
|
|
Fachgebiet:
|
004 Informatik
|
|
Abstract:
|
We study scalable algorithms for frequent sequence mining under flexible subsequence constraints. Such constraints enable applications to specify concisely which patterns are of interest 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.
|
 | Dieser Eintrag ist Teil der Universitätsbibliographie. |
 | Das Dokument wird vom Publikationsserver der Universitätsbibliothek Mannheim bereitgestellt. |
 Suche Autoren in
Sie haben einen Fehler gefunden? Teilen Sie uns Ihren Korrekturwunsch bitte hier mit: E-Mail
Actions (login required)
 |
Eintrag anzeigen |
|
|
