default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael G. Schimek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Michael G. Schimek
, Luca Vitale, Bastian Pfeifer, Michele La Rocca:
Effective signal reconstruction from multiple ranked lists via convex optimization. Data Min. Knowl. Discov. 38(3): 1125-1169 (2024)- [j9]Michael G. Schimek, Luca Vitale, Bastian Pfeifer, Michele La Rocca:
Correction to: Effective signal reconstruction from multiple ranked lists via convex optimization. Data Min. Knowl. Discov. 38(3): 1170 (2024) - 2023
- [j8]Bastian Pfeifer, Marcus D. Bloice, Michael G. Schimek:
Parea: Multi-view ensemble clustering for cancer subtype discovery. J. Biomed. Informatics 143: 104406 (2023) - 2022
- [c5]Bastian Pfeifer, Andreas Holzinger, Michael G. Schimek:
Robust Random Forest-Based All-Relevant Feature Ranks for Trustworthy AI. MIE 2022: 137-138 - [i1]Bastian Pfeifer, Marcus D. Bloice, Michael G. Schimek:
Parea: multi-view ensemble clustering for cancer subtype discovery. CoRR abs/2209.15399 (2022) - 2021
- [j7]Bastian Pfeifer, Michael G. Schimek:
A hierarchical clustering and data fusion approach for disease subtype discovery. J. Biomed. Informatics 113: 103636 (2021) - [c4]Bastian Pfeifer, Andrei Voicu-Spineanu, Michael G. Schimek, Nikolaos Alachiotis:
Integrative hierarchical ensemble clustering for improved disease subtype discovery. BIBM 2021: 720-725 - 2020
- [j6]Florian Frommlet, Michael G. Schimek:
Comments on: Hierarchical inference for genome-wide association studies: a view on methodology with software by F. Frommlet and M. G. Schimek. Comput. Stat. 35(1): 47-49 (2020)
2010 – 2019
- 2017
- [j5]Vendula Svendová, Michael G. Schimek:
A novel method for estimating the common signals for consensus across multiple ranked lists. Comput. Stat. Data Anal. 115: 122-135 (2017) - 2012
- [j4]Michael G. Schimek, Alena Mysicková, Eva Budinska:
An Inference and Integration Approach for the Consolidation of Ranked Lists. Commun. Stat. Simul. Comput. 41(7): 1152-1166 (2012) - 2011
- [r1]Michael G. Schimek:
Statistics on Ranked Lists. International Encyclopedia of Statistical Science 2011: 1487-1491
2000 – 2009
- 2009
- [j3]Eva Budinska, Eva Gelnarova, Michael G. Schimek:
MSMAD: a computationally efficient method for the analysis of noisy array CGH data. Bioinform. 25(6): 703-713 (2009) - 2007
- [j2]Rand R. Wilcox, Simon Sheather, Edgar Brunner, Michael G. Schimek:
Nonparametric and Robust Methods. Comput. Stat. Data Anal. 51(10): 5010-5012 (2007) - 2002
- [c3]Michael G. Schimek:
Unbiased Partial Spline Fitting under Autoregressive Errors. COMPSTAT 2002: 605-610 - 2001
- [j1]Michael G. Schimek:
Guest editorial: Semiparametric function estimation and testing. Stat. Comput. 11(4): 291-292 (2001)
1990 – 1999
- 1998
- [c2]Michael G. Schimek:
Partially Linear Models: A New Algorithm and some Simulation Results. COMPSTAT 1998: 443-448 - 1991
- [c1]Michael G. Schimek:
Non-parametric regression techniques for biometric problems: Concepts and software. MIE 1991: 562-566
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-10-07 22:11 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:
