Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabian Mörchen
Person information
- affiliation: Amazon, Seattle, WA, USA
- affiliation (former): Siemens Corporate Research, Princeton, NJ, USA
- affiliation (former): University of Marburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2006
[b1]Fabian Mörchen:
Time series knowlegde mining. University of Marburg, 2006, ISBN 3-89703-670-3, pp. 1-174
Journal Articles
- 2016
- [j16]Iyad Batal, Gregory F. Cooper, Dmitriy Fradkin, James H. Harrison Jr., Fabian Moerchen, Milos Hauskrecht:
An efficient pattern mining approach for event detection in multivariate temporal data. Knowl. Inf. Syst. 46(1): 115-150 (2016) - 2015
- [j15]Dmitriy Fradkin, Fabian Mörchen:
Mining sequential patterns for classification. Knowl. Inf. Syst. 45(3): 731-749 (2015) - 2014
- [j14]Hoang Thanh Lam, Fabian Mörchen, Dmitriy Fradkin, Toon Calders:
Mining Compressing Sequential Patterns. Stat. Anal. Data Min. 7(1): 34-52 (2014) - [j13]Nikolaj Tatti
, Fabian Moerchen, Toon Calders:
Finding Robust Itemsets under Subsampling. ACM Trans. Database Syst. 39(3): 20:1-20:27 (2014) - 2013
- [j12]Bibudh Lahiri, Ioannis Akrotirianakis, Fabian Moerchen:
Finding Critical Thresholds for Defining Bursts in Event Logs. Trans. Large Scale Data Knowl. Centered Syst. 8: 89-112 (2013) - 2011
- [j11]Hassan H. Malik, Dmitriy Fradkin, Fabian Mörchen:
Single pass text classification by direct feature weighting. Knowl. Inf. Syst. 28(1): 79-98 (2011) - [j10]Fabian Moerchen, Michael Thies, Alfred Ultsch:
Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression. Knowl. Inf. Syst. 29(1): 55-80 (2011) - 2010
- [j9]Hassan H. Malik, John R. Kender, Dmitriy Fradkin, Fabian Mörchen:
Hierarchical document clustering using local patterns. Data Min. Knowl. Discov. 21(1): 153-185 (2010) - 2009
- [j8]Yi Yu, Kazuki Joe, Vincent Oria, Fabian Mörchen, J. Stephen Downie, Lei Chen:
Multi-Version Music Search Using Acoustic Feature Union and Exact Soft Mapping. Int. J. Semantic Comput. 3(2): 209-234 (2009) - 2008
- [j7]Steffen Renner, Swetlana Derksen, Sebastian Radestock, Fabian Mörchen:
Maximum Common Binding Modes (MCBM): Consensus Docking Scoring Using Multiple Ligand Information and Interaction Fingerprints. J. Chem. Inf. Model. 48(2): 319-332 (2008) - 2007
- [j6]Claus Weihs, Uwe Ligges, Fabian Mörchen, Daniel Müllensiefen:
Classification in music research. Adv. Data Anal. Classif. 1(3): 255-291 (2007) - [j5]Fabian Mörchen, Alfred Ultsch:
Efficient mining of understandable patterns from multivariate interval time series. Data Min. Knowl. Discov. 15(2): 181-215 (2007) - [j4]Fabian Mörchen:
Unsupervised pattern mining from symbolic temporal data. SIGKDD Explor. 9(1): 41-55 (2007) - 2006
- [j3]Fabian Mörchen, Alfred Ultsch, Michael Thies, Ingo Lohken:
Modeling timbre distance with temporal statistics from polyphonic music. IEEE Trans. Speech Audio Process. 14(1): 81-90 (2006) - 2005
- [j2]Fabian Mörchen, Alfred Ultsch, Olaf Hoos:
Extracting interpretable muscle activation patterns with time series knowledge mining. Int. J. Knowl. Based Intell. Eng. Syst. 9(3): 197-208 (2005) - 2004
- [j1]Fabian Mörchen:
Analysis of speedup as function of block size and cluster size for parallel feed-forward neural networks on a Beowulf cluster. IEEE Trans. Neural Networks 15(2): 515-527 (2004)
Conference and Workshop Papers
- 2022
- [c27]Alexander Buchholz, Vito Bellini, Giuseppe Di Benedetto, Yannik Stein, Matteo Ruffini, Fabian Moerchen:
Fair Effect Attribution in Parallel Online Experiments. WWW (Companion Volume) 2022: 77-83 - 2020
- [c26]Fabian Moerchen, Patrick Ernst, Giovanni Zappella:
Personalizing Natural Language Understanding using Multi-armed Bandits and Implicit Feedback. CIKM 2020: 2661-2668 - 2014
- [c25]Ruben Sipos, Dmitriy Fradkin, Fabian Mörchen, Zhuang Wang:
Log-based predictive maintenance. KDD 2014: 1867-1876 - 2013
- [c24]Hoang Thanh Lam, Toon Calders, Jie Yang, Fabian Mörchen, Dmitriy Fradkin:
Zips: mining compressing sequential patterns in streams. IDEA@KDD 2013: 54-62 - 2012
- [c23]Iyad Batal, Dmitriy Fradkin, James H. Harrison Jr., Fabian Moerchen, Milos Hauskrecht:
Mining recent temporal patterns for event detection in multivariate time series data. KDD 2012: 280-288 - [c22]Qiaojun Wang, Kai Zhang, Ivan Marsic, John K.-J. Li, Fabian Moerchen:
Patient-friendly detection of early peripheral arterial diseases (PAD) by budgeted sensor selection. PervasiveHealth 2012: 89-96 - [c21]Hoang Thanh Lam, Fabian Moerchen, Dmitriy Fradkin, Toon Calders:
Mining Compressing Sequential Patterns. SDM 2012: 319-330 - [c20]Kai Zhang, Liang Lan, Zhuang Wang, Fabian Moerchen:
Scaling up Kernel SVM on Limited Resources: A Low-rank Linearization Approach. AISTATS 2012: 1425-1434 - 2011
- [c19]Bibudh Lahiri, Ioannis Akrotirianakis, Fabian Moerchen:
Finding Critical Thresholds for Defining Bursts. DaWaK 2011: 484-495 - [c18]Nikolaj Tatti, Fabian Moerchen:
Finding Robust Itemsets under Subsampling. ICDM 2011: 705-714 - 2010
- [c17]Fabian Mörchen, Dmitriy Fradkin:
Robust Mining of Time Intervals with Semi-interval Partial Order Patterns. SDM 2010: 315-326 - 2009
- [c16]Fabian Mörchen:
Tutorial CIDM-T Temporal pattern mining in symbolic time point and time interval data. CIDM 2009 - 2008
- [c15]Fabian Mörchen, Dmitriy Fradkin, Mathäus Dejori, Bernd Wachmann:
Emerging Trend Prediction in Biomedical Literature. AMIA 2008 - [c14]Fabian Mörchen:
Organic Pie Charts. ICDM 2008: 947-952 - [c13]Yi Yu, J. Stephen Downie, Fabian Mörchen, Lei Chen, Kazuki Joe:
Using Exact Locality Sensitive Mapping to Group and Detect Audio-Based Cover Songs. ISM 2008: 302-309 - [c12]Fabian Mörchen, Mathäus Dejori, Dmitriy Fradkin, Julien Etienne, Bernd Wachmann, Markus Bundschus:
Anticipating annotations and emerging trends in biomedical literature. KDD 2008: 954-962 - [c11]Yi Yu, J. Stephen Downie, Fabian Mörchen, Lei Chen, Kazuki Joe, Vincent Oria:
COSIN: content-based retrieval system for cover songs. ACM Multimedia 2008: 987-988 - 2006
- [c10]Mario Nöcker, Fabian Mörchen, Alfred Ultsch:
An algorithm for fast and reliable ESOM learning. ESANN 2006: 131-136 - [c9]Fabian Mörchen:
Algorithms for time series knowledge mining. KDD 2006: 668-673 - [c8]Fabian Mörchen, Ingo Mierswa, Alfred Ultsch:
Understandable models Of music collections based on exhaustive feature generation with temporal statistics. KDD 2006: 882-891 - 2005
- [c7]Fabian Mörchen, Alfred Ultsch:
Finding Persisting States for Knowledge Discovery in Time Series. GfKl 2005: 278-285 - [c6]Fabian Mörchen, Alfred Ultsch, Mario Nöcker, Christian Stamm:
Visual Mining in Music Collections. GfKl 2005: 724-731 - [c5]Fabian Mörchen, Alfred Ultsch, Mario Nöcker, Christian Stamm:
Databionic Visualization of Music Collections According to Perceptual Distance. ISMIR 2005: 396-403 - [c4]Fabian Mörchen, Alfred Ultsch:
Optimizing time series discretization for knowledge discovery. KDD 2005: 660-665 - 2004
- [c3]Fabian Mörchen, Alfred Ultsch:
Discovering Temporal Knowledge in Multivariate Time Series. GfKl 2004: 272-279 - [c2]Fabian Mörchen, Alfred Ultsch:
Mining Hierarchical Temporal Patterns in Multivariate Time Series. KI 2004: 127-140 - [c1]Fabian Mörchen, Alfred Ultsch, Olaf Hoos:
Discovering Interpretable Muscle Activation Patterns with the Temporal Data Mining Method. PKDD 2004: 512-514
Informal and Other Publications
- 2022
- [i3]Alexander Buchholz, Vito Bellini, Giuseppe Di Benedetto, Yannik Stein, Matteo Ruffini, Fabian Moerchen:
Fair Effect Attribution in Parallel Online Experiments. CoRR abs/2210.08338 (2022) - 2019
- [i2]Nikolaj Tatti, Fabian Moerchen:
Finding Robust Itemsets Under Subsampling. CoRR abs/1902.06743 (2019) - 2012
- [i1]Kai Zhang, Liang Lan, Jun Liu, Andreas Rauber, Fabian Moerchen:
Inductive Kernel Low-rank Decomposition with Priors: A Generalized Nystrom Method. CoRR abs/1206.4619 (2012)
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-25 02:43 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:
