◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Fabian Moerchen

2 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author1
  • last author1

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DB1
  • cs.LG1

identity via Semantic Scholar / OpenAlex

most citedFinding Robust Itemsets Under Subsampling

16 citations · 21 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DB2019★ 16 cited

Finding Robust Itemsets Under Subsampling

Nikolaj Tatti, Fabian Moerchen, Toon Calders

Mining frequent patterns is plagued by the problem of pattern explosion making pattern reduction techniques a key challenge in pattern mining. In this paper we propose a novel theo…

cs.LG2012★ 5 cited

Inductive Kernel Low-rank Decomposition with Priors: A Generalized Nystrom Method

Kai Zhang, Liang Lan, Jun Liu +2

Low-rank matrix decomposition has gained great popularity recently in scaling up kernel methods to large amounts of data. However, some limitations could prevent them from working…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.