default search action
Ralph Krieger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [c14]Philipp Kranen, Ralph Krieger, Stefan Denker, Thomas Seidl
:
Bulk Loading Hierarchical Mixture Models for Efficient Stream Classification. PAKDD (2) 2010: 325-334
2000 – 2009
- 2009
- [j4]Ira Assent, Marc Wichterich, Ralph Krieger, Hardy Kremer, Thomas Seidl
Anticipatory DTW for Efficient Similarity Search in Time Series Databases. Proc. VLDB Endow. 2(1): 826-837 (2009) - [c13]Thomas Seidl
Indexing density models for incremental learning and anytime classification on data streams. EDBT 2009: 311-322 - [c12]Emmanuel Müller
Relevant Subspace Clustering: Mining the Most Interesting Non-redundant Concepts in High Dimensional Data. ICDM 2009: 377-386 - [c11]Emmanuel Müller, Ira Assent, Ralph Krieger, Stephan Günnemann, Thomas Seidl:
DensEst: Density Estimation for Data Mining in High Dimensional Spaces. SDM 2009: 175-186 - 2008
- [b1]Ralph Krieger:
Efficient density based methods for knowledge discovery in databases. RWTH Aachen University, Germany, 2008, pp. 1-239 - [j3]David Ruau, Corinna Kolárik, Heinz-Theodor Mevissen, Emmanuel Müller, Ira Assent, Ralph Krieger, Thomas Seidl, Martin Hofmann-Apitius, Martin Zenke:
Public microarray repository semantic annotation with ontologies employing text mining and expression profile correlation. BMC Bioinform. 9(S-10) (2008) - [j2]Ira Assent
Clustering multidimensional sequences in spatial and temporal databases. Knowl. Inf. Syst. 16(1): 29-51 (2008) - [c10]Ira Assent
EDSC: efficient density-based subspace clustering. CIKM 2008: 1093-1102 - [c9]Ira Assent
The TS-tree: efficient time series search and retrieval. EDBT 2008: 252-263 - [c8]Ira Assent
INSCY: Indexing Subspace Clusters with In-Process-Removal of Redundancy. ICDM 2008: 719-724 - [c7]Emmanuel Müller
Morpheus: interactive exploration of subspace clustering. KDD 2008: 1089-1092 - [c6]Ira Assent, Ralph Krieger, Petra Welter, Jörg Herbers, Thomas Seidl
SubClass: Classification of Multidimensional Noisy Data Using Subspace Clusters. PAKDD 2008: 40-52 - [c5]Ira Assent, Emmanuel Müller
Pleiades: Subspace Clustering and Evaluation. ECML/PKDD (2) 2008: 666-671 - 2007
- [j1]Ira Assent, Ralph Krieger, Emmanuel Müller, Thomas Seidl:
VISA: visual subspace clustering analysis. SIGKDD Explor. 9(2): 5-12 (2007) - [c4]Ira Assent, Ralph Krieger, Thomas Seidl
AttentionAttractor: efficient video stream similarity query processing in real time. ICDE 2007: 1509-1510 - [c3]Ira Assent, Ralph Krieger, Emmanuel Müller
DUSC: Dimensionality Unbiased Subspace Clustering. ICDM 2007: 409-414 - [i1]Ira Assent, Ralph Krieger, Emmanuel Müller, Thomas Seidl:
Subspace outlier mining in large multimedia databases. Parallel Universes and Local Patterns 2007 - 2006
- [c2]Ira Assent, Ralph Krieger, Boris Glavic, Thomas Seidl
Spatial Multidimensional Sequence Clustering. ICDM Workshops 2006: 343-348 - 2002
- [c1]Alexander Kuckelberg, Ralph Krieger:
Efficient Structure Oriented Storage of XML Documents Using ORDBMS. EEXTT 2002: 131-143
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: