Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Márton Danóczy

dblp:09/2172 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Transfer learning and domain adaptation · 64% Probabilistic and Bayesian machine learning · 36%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Human-computer interaction and pervasive computing
1 paper
Wearable and physiological sensing · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wearable and physiological sensing
brain-computer interface
0.112009
Subject independent EEG-based BCI decoding · NIPS 2009
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model
0.112005
Efficient estimation of hidden state dynamics from spike trains · NIPS 2005
Bioinformatics and computational biology
computational neuroscience
0.112005
Efficient estimation of hidden state dynamics from spike trains · NIPS 2005
Bioinformatics and computational biology › neuroscience › neuroinformatics › neural data analysis
spike train analysis
0.112005
Efficient estimation of hidden state dynamics from spike trains · NIPS 2005

Methods — techniques the papers use, named apart from their topics

subject-specific filter library · 0.2spatiotemporal filtering · 0.2mixed-state markov model · 0.1maximum likelihood estimation · 0.1
YearPublicationVenuePosition
2011 ℓ1-Penalized Linear Mixed-Effects Models for BCI
Siamac Fazli, Márton Danóczy, Jürg Schelldorfer, Klaus-Robert Müller
ICANN (1)2
2009 Subject independent EEG-based BCI decoding
abstract
In the quest to make Brain Computer Interfacing (BCI) more usable, dry electrodes have emerged that get rid of the initial 30 minutes required for placing an electrode cap. Another time consuming step is the required individualized adaptation to the BCI user, which involves another 30 minutes calibration for assessing a subjects brain signature. In this paper we aim to also remove this calibration proceedure from BCI setup time by means of machine learning. In particular, we harvest a large database of EEG BCI motor imagination recordings (83 subjects) for constructing a library of subject-specific spatio-temporal filters and derive a subject independent BCI classifier. Our offline results indicate that BCI-na{i}ve users could start real-time BCI use with no prior calibration at only a very moderate performance loss."
Siamac Fazli, Cristian Grozea, Márton Danóczy, Benjamin Blankertz, Florin Popescu, Klaus-Robert Müller
NIPS3
2009 Subject-independent mental state classification in single trials
Siamac Fazli, Florin Popescu, Márton Danóczy, Benjamin Blankertz, Klaus-Robert Müller, Cristian Grozea
Neural Networks3
2005 Efficient estimation of hidden state dynamics from spike trains
abstract
Neurons can have rapidly changing spike train statistics dictated by the underlying network excitability or behavioural state of an animal. To estimate the time course of such state dynamics from single- or multi- ple neuron recordings, we have developed an algorithm that maximizes the likelihood of observed spike trains by optimizing the state lifetimes and the state-conditional interspike-interval (ISI) distributions. Our non- parametric algorithm is free of time-binning and spike-counting prob- lems and has the computational complexity of a Mixed-state Markov Model operating on a state sequence of length equal to the total num- ber of recorded spikes. As an example, we fit a two-state model to paired recordings of premotor neurons in the sleeping songbird. We find that the two state-conditional ISI functions are highly similar to the ones mea- sured during waking and singing, respectively.
Márton Danóczy, Richard H. R. Hahnloser
NIPS1