- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 16th International Conference on Data Mining (ICDM), Barcelona, Spain, 12-15 Dec. 2016
- Ereignis
-
Veröffentlichung
- (wo)
-
Mannheim
- (wer)
-
Universitätsbibliothek Mannheim
- (wann)
-
2016
- Urheber
-
Beedkar, Kaustubh
Gemulla, Rainer
- URN
-
urn:nbn:de:bsz:180-madoc-424296
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:28 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Beedkar, Kaustubh
- Gemulla, Rainer
- Universitätsbibliothek Mannheim
Entstanden
- 2016
Ähnliche Objekte (12)
Scalable frequent sequence mining with flexible subsequence constraints
A unified framework for frequent sequence mining with subsequence constraints
The DESQ framework for declarative and scalable frequent sequence mining
LASH: Large-scale sequence mining with hierarchies
Memory-Efficient Frequent-Itemset Mining
Closing the gap: Sequence mining at scale
Algorithms for shared-memory matrix completion and maximum inner product search
Exact and approximate maximum inner product search with LEMP
Deferred Maintenance of Disk-Based Random Samples
Methods for open information extraction and sense disambiguation on natural language text
Sampling time-based sliding windows in bounded space
Methods for Frequent Sequence Mining with Subsequence Constraints
Scalable frequent sequence mining with flexible subsequence constraints
A unified framework for frequent sequence mining with subsequence constraints
The DESQ framework for declarative and scalable frequent sequence mining
LASH: Large-scale sequence mining with hierarchies
Memory-Efficient Frequent-Itemset Mining
Closing the gap: Sequence mining at scale
Algorithms for shared-memory matrix completion and maximum inner product search
Exact and approximate maximum inner product search with LEMP
Deferred Maintenance of Disk-Based Random Samples
Methods for open information extraction and sense disambiguation on natural language text
Sampling time-based sliding windows in bounded space
Methods for Frequent Sequence Mining with Subsequence Constraints
Scalable frequent sequence mining with flexible subsequence constraints
A unified framework for frequent sequence mining with subsequence constraints
The DESQ framework for declarative and scalable frequent sequence mining
LASH: Large-scale sequence mining with hierarchies
Memory-Efficient Frequent-Itemset Mining
Closing the gap: Sequence mining at scale
Algorithms for shared-memory matrix completion and maximum inner product search
Exact and approximate maximum inner product search with LEMP
Deferred Maintenance of Disk-Based Random Samples
Methods for open information extraction and sense disambiguation on natural language text
Sampling time-based sliding windows in bounded space