default search action
Mathieu Guillame-Bert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Mathieu Guillame-Bert, Richard Nock:
Boosting gets full Attention for Relational Learning. CoRR abs/2402.14926 (2024) - 2023
- [c7]Mathieu Guillame-Bert, Sebastian Bruch, Richard Stotz, Jan Pfeifer:
Yggdrasil Decision Forests: A Fast and Extensible Decision Forests Library. KDD 2023: 4068-4077 - [i8]Richard Nock, Mathieu Guillame-Bert:
Generative Forests. CoRR abs/2308.03648 (2023) - 2022
- [c6]Richard Nock, Mathieu Guillame-Bert:
Generative Trees: Adversarial and Copycat. ICML 2022: 16906-16951 - [i7]Richard Nock, Mathieu Guillame-Bert:
Generative Trees: Adversarial and Copycat. CoRR abs/2201.11205 (2022) - [i6]Mathieu Guillame-Bert, Sebastian Bruch, Richard Stotz, Jan Pfeifer:
Yggdrasil Decision Forests: A Fast and Extensible Decision Forests Library. CoRR abs/2212.02934 (2022) - 2020
- [i5]Sebastian Bruch, Jan Pfeifer, Mathieu Guillame-Bert:
Learning Representations for Axis-Aligned Decision Forests through Input Perturbation. CoRR abs/2007.14761 (2020) - [i4]Mathieu Guillame-Bert, Sebastian Bruch, Petr Mitrichev, Petr Mikheev, Jan Pfeifer:
Modeling Text with Decision Forests using Categorical-Set Splits. CoRR abs/2009.09991 (2020)
2010 – 2019
- 2018
- [i3]Mathieu Guillame-Bert, Olivier Teytaud:
Exact Distributed Training: Random Forest with Billions of Examples. CoRR abs/1804.06755 (2018) - 2017
- [j2]Mathieu Guillame-Bert, Artur Dubrawski, Donghan Wang, Marilyn Hravnak, Gilles Clermont, Michael R. Pinsky:
Learning temporal rules to forecast instability in continuously monitored patients. J. Am. Medical Informatics Assoc. 24(1): 47-53 (2017) - [j1]Mathieu Guillame-Bert, Artur Dubrawski:
Classification of Time Sequences using Graphs of Temporal Constraints. J. Mach. Learn. Res. 18: 121:1-121:34 (2017) - 2016
- [c5]Reuben M. Aronson, Ankit Bhatia, Zhenzhong Jia, Mathieu Guillame-Bert, David A. Bourne, Artur Dubrawski, Matthew T. Mason:
Data-Driven Classification of Screwdriving Operations. ISER 2016: 244-253 - [i2]Mathieu Guillame-Bert, Artur Dubrawski:
Batched Lazy Decision Trees. CoRR abs/1603.02578 (2016) - [i1]Mathieu Guillame-Bert:
Honey: A dataflow programming language for the processing, featurization and analysis of multivariate, asynchronous and non-uniformly sampled scalar symbolic time sequences. CoRR abs/1609.03146 (2016) - 2012
- [b1]Mathieu Guillame-Bert:
Apprentissage de règles associatives temporelles pour les séquences temporelles de symboles. (Learning temporal association rules on Symbolic time sequences). Grenoble Alpes University, France, 2012 - [c4]Mathieu Guillame-Bert, James L. Crowley:
Planning with Inaccurate Temporal Rules. ICTAI 2012: 492-499 - [c3]Mathieu Guillame-Bert, James L. Crowley:
Learning Temporal Association Rules on Symbolic Time Sequences. ACML 2012: 159-174 - 2011
- [c2]Mathieu Guillame-Bert, James L. Crowley:
New Approach on Temporal Data Mining for Symbolic Time Sequences: Temporal Tree Associate Rules. ICTAI 2011: 748-752 - 2010
- [c1]Mathieu Guillame-Bert, Krysia Broda, Artur S. d'Avila Garcez:
First-order logic learning in Artificial Neural Networks. IJCNN 2010: 1-8
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-09-13 01:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint