EDBT 2026 Demo / reviewers in the wild / expert
Jörg Kindermann
dblp:76/4419
· DBLP profile ↗
16ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 10 · 2 first-authorDatabases, data management, data science and information retrieval · 5 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3Systems, architecture and hardware · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1
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.
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 67% Efficient and distributed learning · 33% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › visual analytics
anomaly detection visualization |
0.4 | 1 | 2020 | LDA Ensembles for Interactive Exploration and Categorization of Behaviors · IEEE Trans. Vis. Comput. Graph. 2020 |
Machine learning › Efficient and distributed learning › active learning
active sampling |
0.0 | 1 | 1994 | Bayesian Query Construction for Neural Network Models · NIPS 1994 |
Machine learning › Probabilistic and Bayesian machine learning › experimental design
bayesian experimental design |
0.0 | 1 | 1994 | Bayesian Query Construction for Neural Network Models · NIPS 1994 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian model selection |
0.0 | 1 | 1994 | Bayesian Query Construction for Neural Network Models · NIPS 1994 |
Methods — techniques the papers use, named apart from their topics
topic modeling · 0.4ensemble topic modeling · 0.4LDA · 0.4markov chain monte carlo · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | LDA Ensembles for Interactive Exploration and Categorization of BehaviorsabstractWe define behavior as a set of actions performed by some actor during a period of time. We consider the problem of analyzing a large collection of behaviors by multiple actors, more specifically, identifying typical behaviors and spotting anomalous behaviors. We propose an approach leveraging topic modeling techniques - LDA (Latent Dirichlet Allocation) Ensembles - to represent categories of typical behaviors by topics that are obtained through topic modeling a behavior collection. When such methods are applied to text in natural languages, the quality of the extracted topics are usually judged based on the semantic relatedness of the terms pertinent to the topics. This criterion, however, is not necessarily applicable to topics extracted from non-textual data, such as action sets, since relationships between actions may not be obvious. We have developed a suite of visual and interactive techniques supporting the construction of an appropriate combination of topics based on other criteria, such as distinctiveness and coverage of the behavior set. Two case studies on analyzing operation behaviors in the security management system and visiting behaviors in an amusement park, and the expert evaluation of the first case study demonstrate the effectiveness of our approach. Siming Chen 0001, Natalia V. Andrienko, Gennady L. Andrienko, Linara Adilova, Jérémie Barlet, Jörg Kindermann, Phong H. Nguyen, Olivier Thonnard, Cagatay Turkay |
IEEE Trans. Vis. Comput. Graph. | 6 |
| 2011 | Towards Automatic Behavior Analysis of Learners in a Technology-enhanced Learning EnvironmentabstractIn the context of the European SCY project, a collaborative, learner-centric TEL environment is described. Reference workflows and workflow executions are analyzed to extract meaningful behavioural attributes automatically. The extracted patterns provide insights into learner behaviour. Noury Khayat, Michael Mock, Jörg Kindermann |
CSEDU (1) | 3 |
| 2008 | Grid-enabling data mining applications with DataMiningGrid: An architectural perspective
Vlado Stankovski, Martin T. Swain, Valentin Kravtsov, Thomas Niessen, Dennis Wegener, Jörg Kindermann, Werner Dubitzky |
Future Gener. Comput. Syst. | 6 |
| 2004 | Revealing the connoted visual code: a new approach to video classification
René Cavet, Stephan Volmer, Edda Leopold, Jörg Kindermann, Gerhard Paass |
Comput. Graph. | 4 |
| 2003 | Authorship Attribution with Support Vector Machines
Joachim Diederich, Jörg Kindermann, Edda Leopold, Gerhard Paass |
Appl. Intell. | 2 |
| 2003 | Bayesian regression mixtures of experts for geo-referenced data
Gerhard Paass, Jörg Kindermann |
Intell. Data Anal. | 2 |
| 2002 | Exploring sub-word features and linear support vector machines for German spoken document classification
Martha A. Larson, Stefan Eickeler, Gerhard Paass, Edda Leopold, Jörg Kindermann |
INTERSPEECH | 5 |
| 2002 | SVM Classification Using Sequences of Phonemes and Syllables
Gerhard Paass, Edda Leopold, Martha A. Larson, Jörg Kindermann, Stefan Eickeler |
PKDD | 4 |
| 2002 | Text Categorization with Support Vector Machines. How to Represent Texts in Input Space?
Edda Leopold, Jörg Kindermann |
Mach. Learn. | 2 |
| 2001 | Error Correcting Codes with Optimized Kullback-Leibler Distances for Text Categorization
Jörg Kindermann, Gerhard Paass, Edda Leopold |
PKDD | 1 |
| 2000 | Multistep Sequential Exploration of Growing Bayesian Classification ModelsabstractIf the collection of training data is costly, one can gain by actively selecting particular informative data points in a sequential way. In a Bayesian decision theoretic framework we develop a query selection criterion for classification models which explicitly takes into account the utility of decisions. We determine the overall utility and its derivative with respect to changes of the queries. An optimal query now may be obtained by stochastic hill climbing. Simultaneously, the model structure can be adapted by reversible jump Markov chain Monte Carlo. Gerhard Paass, Jörg Kindermann |
IJCNN (3) | 2 |
| 2000 | Transparency and Predicive Power: Explaining Complex Classification Models
Gerhard Paass, Jörg Kindermann |
PKDD | 2 |
| 1998 | Bayesian Classification Trees with Overlapping Leaves Applied to Credit-Scoring
Gerhard Paass, Jörg Kindermann |
PAKDD | 2 |
| 1998 | Model Switching for Bayesian Classification Trees with Soft Splits
Jörg Kindermann, Gerhard Paass |
PKDD | 1 |
| 1994 | Bayesian Query Construction for Neural Network ModelsabstractIf data collection is costly, there is much to be gained by actively se(cid:173) lecting particularly informative data points in a sequential way. In a Bayesian decision-theoretic framework we develop a query selec(cid:173) tion criterion which explicitly takes into account the intended use of the model predictions. By Markov Chain Monte Carlo methods the necessary quantities can be approximated to a desired preci(cid:173) sion. As the number of data points grows, the model complexity is modified by a Bayesian model selection strategy. The proper(cid:173) ties of two versions of the criterion ate demonstrated in numerical experiments. Gerhard Paass, Jörg Kindermann |
NIPS | 2 |
| 1990 | Inversion of neural networks by gradient descent
Jörg Kindermann, Alexander Linden 0002 |
Parallel Comput. | 1 |