Mario Boley

Orcid: 0000-0002-0704-4968

Affiliations:
  • University of Bonn, Germany


According to our database1, Mario Boley authored at least 49 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Orthogonal Gradient Boosting for Simpler Additive Rule Ensembles.
CoRR, 2024

2023
Interpretable Machine Learning Models for Phase Prediction in Polymerization-Induced Self-Assembly.
J. Chem. Inf. Model., June, 2023

Improved Neurophysiological Process Imaging Through Optimization of Kalman Filter Initial Conditions.
Int. J. Neural Syst., 2023

From Prediction to Action: The Critical Role of Proper Performance Estimation for Machine-Learning-Driven Materials Discovery.
CoRR, 2023

Bayes beats Cross Validation: Efficient and Accurate Ridge Regression via Expectation Maximization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Inference-based time-resolved stability analysis of nonlinear whole-cortex modeling: application to Xenon anaesthesia.
Proceedings of the 45th Annual International Conference of the IEEE Engineering in Medicine & Biology Society, 2023

2022
Space-time resolved inference-based neurophysiological process imaging: Application to resting-state alpha rhythm.
NeuroImage, 2022

Enhanced Extra Trees Classifier for Epileptic Seizure Prediction.
Proceedings of the 5th International Conference on Signal Processing and Information Security, 2022

2021
Discovering Reliable Causal Rules.
Proceedings of the 2021 SIAM International Conference on Data Mining, 2021

Better Short than Greedy: Interpretable Models through Optimal Rule Boosting.
Proceedings of the 2021 SIAM International Conference on Data Mining, 2021

Relative Flatness and Generalization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Discovering dependencies with reliable mutual information.
Knowl. Inf. Syst., 2020

Discovering Functional Dependencies from Mixed-Type Data.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

2019
Adaptive Communication Bounds for Distributed Online Learning.
CoRR, 2019

Discovering Reliable Correlations in Categorical Data.
Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

Discovering Robustly Connected Subgraphs with Simple Descriptions.
Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2018
Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms.
Proceedings of the IEEE International Conference on Data Mining, 2018

2017
Identifying consistent statements about numerical data with dispersion-corrected subgroup discovery.
Data Min. Knowl. Discov., 2017

Effective Parallelisation for Machine Learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Discovering Reliable Approximate Functional Dependencies.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Efficiently Discovering Locally Exceptional Yet Globally Representative Subgroups.
Proceedings of the 2017 IEEE International Conference on Data Mining, 2017

2016
Communication-Efficient Distributed Online Learning with Kernels.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016

2015
In-Stream Frequent Itemset Mining With Output Proportional Memory Footprint.
Proceedings of the LWA 2015 Workshops: KDML, 2015

2014
Interesting pattern mining in multi-relational data.
Data Min. Knowl. Discov., 2014

Communication-Efficient Distributed Online Prediction by Dynamic Model Synchronization.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2014

Instant Exceptional Model Mining Using Weighted Controlled Pattern Sampling.
Proceedings of the Advances in Intelligent Data Analysis XIII, 2014

Providing Concise Database Covers Instantly by Recursive Tile Sampling.
Proceedings of the Discovery Science - 17th International Conference, 2014

2013
Communication-Efficient Distributed Online Prediction using Dynamic Model Synchronizations.
Proceedings of the First International Workshop on Big Dynamic Distributed Data, 2013

Privacy-Preserving Mobility Monitoring Using Sketches of Stationary Sensor Readings.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

One click mining: interactive local pattern discovery through implicit preference and performance learning.
Proceedings of the ACM SIGKDD Workshop on Interactive Data Exploration and Analytics, 2013

Beating Human Analysts in Nowcasting Corporate Earnings by Using Publicly Available Stock Price and Correlation Features.
Proceedings of the 13th IEEE International Conference on Data Mining Workshops, 2013

Mining Interesting Patterns in Multi-relational Data with N-ary Relationships.
Proceedings of the Discovery Science - 16th International Conference, 2013

2012
Linear space direct pattern sampling using coupling from the past.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

2011
Direct Pattern Sampling with Respect to Pattern Frequency.
Proceedings of the Report of the symposium "Lernen, 2011

Direct local pattern sampling by efficient two-step random procedures.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

2010
The Efficient Discovery of Interesting Closed Pattern Collections.
PhD thesis, 2010

Listing closed sets of strongly accessible set systems with applications to data mining.
Theor. Comput. Sci., 2010

Formal Concept Sampling for Counting and Threshold-Free Local Pattern Mining.
Proceedings of the SIAM International Conference on Data Mining, 2010

Listing closed sets of strongly accessible set systems with applications to data.
Proceedings of the LWA 2010, 2010

Subgroup Discovery for Election Analysis: A Case Study in Descriptive Data Mining.
Proceedings of the Discovery Science - 13th International Conference, 2010

2009
Efficient discovery of interesting patterns based on strong closedness.
Stat. Anal. Data Min., 2009

Approximating the number of frequent sets in dense data.
Knowl. Inf. Syst., 2009

Probabilistic Structured Predictors.
Proceedings of the UAI 2009, 2009

Non-redundant Subgroup Discovery Using a Closure System.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2009

On the Complexity of Constraint-Based Theory Extraction.
Proceedings of the Discovery Science, 12th International Conference, 2009

2008
A Randomized Approach for Approximating the Number of Frequent Sets.
Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

2007
Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract).
Proceedings of the Knowledge Discovery in Databases: PKDD 2007, 2007

Efficient Closed Pattern Mining in Strongly Accessible Set Systems.
Proceedings of the Mining and Learning with Graphs, 2007

On Approximating Minimum Infrequent and Maximum Frequent Sets.
Proceedings of the Discovery Science, 10th International Conference, 2007


  Loading...