- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: 16th International Conference on Data Mining (ICDM), Barcelona, Spain, 12-15 Dec. 2016
- Event
-
Veröffentlichung
- (where)
-
Mannheim
- (who)
-
Universitätsbibliothek Mannheim
- (when)
-
2016
- Creator
-
Beedkar, Kaustubh
Gemulla, Rainer
- URN
-
urn:nbn:de:bsz:180-madoc-424296
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:28 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Beedkar, Kaustubh
- Gemulla, Rainer
- Universitätsbibliothek Mannheim
Time of origin
- 2016
Other Objects (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
Methods for open information extraction and sense disambiguation on natural language text
Deferred Maintenance of Disk-Based Random Samples
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
Methods for open information extraction and sense disambiguation on natural language text
Deferred Maintenance of Disk-Based Random Samples
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
Methods for open information extraction and sense disambiguation on natural language text
Deferred Maintenance of Disk-Based Random Samples
Sampling time-based sliding windows in bounded space