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

Ruth Janning

dblp:47/7963 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
0since 2021 · last 2015
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 4 · 3 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 50% Database system architecture and tuning · 50%
Human-computer interaction and pervasive computing
1 paper
Learning and educational technologies · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems › collaborative filtering
matrix factorization
0.212015
Integration and Evaluation of a Matrix Factorization Sequencer in Large Commercial ITS · AAAI 2015
Database system architecture and tuning › database performance management
performance prediction
0.212015
Integration and Evaluation of a Matrix Factorization Sequencer in Large Commercial ITS · AAAI 2015
Learning and educational technologies
intelligent tutoring systems
0.212015
Integration and Evaluation of a Matrix Factorization Sequencer in Large Commercial ITS · AAAI 2015
Learning and educational technologies › instructional design
task sequencing
0.212015
Integration and Evaluation of a Matrix Factorization Sequencer in Large Commercial ITS · AAAI 2015

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

score-based policy · 0.4matrix factorization · 0.4
YearPublicationVenuePosition
2015 Integration and Evaluation of a Matrix Factorization Sequencer in Large Commercial ITS
abstract
Correct evaluation of Machine Learning based sequencers require large data availability, large scale experiments and consideration of different evaluation measures. Such constraints make the construction of ad-hoc Intelligent Tutoring Systems (ITS) unfeasible and impose early integration in already existing ITS, which possesses a large amount of tasks to be sequenced. However, such systems were not designed to be combined with Machine Learning methods and require several adjustments. As a consequence more than a half of the components based on recommender technology are never evaluated with an online experiment. In this paper we show how we adapted a Matrix Factorization based performance predictor and a score based policy for task sequencing to be integrated in a commercial ITS with over 2000 tasks on 20 topics. We evaluated the experiment under different perspectives in comparison with the ITS sequencer designed by experts over the years. As a result we achieve same post-test results and outperform the current sequencer in the perceived experience questionnaire with almost no curriculum authoring effort. We also showed that the sequencer possess a better user modeling, better adapting to the knowledge acquisition rate of the students.
Carlotta Schatten, Ruth Janning, Lars Schmidt-Thieme
AAAI2
2015 Improving Automatic Affect Recognition on Low-Level Speech Features in Intelligent Tutoring Systems
abstract
Currently, a lot of research in the field of intelligent tutoring systems is concerned with recognising student’s emotions and affects. The recognition is done by extracting features from information sources like speech, typing and mouse clicking behaviour or physiological sensors. According to the state-of-the-art support vector machines are the best performing classification models for those kinds of features. However, single classification models often do not deliver the best possible performance. Hence, we propose an approach for further improving the affect recognition performance, which is based on ideas from ensemble approaches and feature selection methods. The approach is proven by experiments on low-level speech features extracted from data which was collected in a study with German students solving mathematical tasks. In these experiments the proposed approach reached on average an affect recognition performance improvement of about 59 % in comparison to a single SVM.
Ruth Janning, Carlotta Schatten, Lars Schmidt-Thieme
EC-TEL1
2015 How to Aggregate Multimodal Features for Perceived Task Difficulty Recognition in Intelligent Tutoring Systems
Ruth Janning, Carlotta Schatten, Lars Schmidt-Thieme
EDM1
2014 Feature Analysis for Affect Recognition Supporting Task Sequencing in Adaptive Intelligent Tutoring Systems
Ruth Janning, Carlotta Schatten, Lars Schmidt-Thieme
EC-TEL1
2014 Matrix Factorization Feasibility for Sequencing and Adaptive Support in Intelligent Tutoring Systems
Carlotta Schatten, Ruth Janning, Manolis Mavrikis, Lars Schmidt-Thieme
EDM2
2014 An SVM Plait for Improving Affect Recognition in Intelligent Tutoring Systems
abstract
Usually, in intelligent tutoring systems the task sequencing is done by means of expert and domain knowledge. In a former work we presented a new efficient task sequencer without using the expensive expert and domain knowledge. This task sequencer only uses former performances and decides about the next task according to Vygotsky's Zone of Proximal Development, that is to neither bore nor frustrate the student. We aim to support this task sequencer by a further automatically to gain information, namely students affect recognized from his speech input. However, the collection of the data from children needed for training an affect recognizer in this field is challenging as it is costly and complex and one has to consider privacy issues carefully. These problems lead to small data sets and limited performances of classification methods. Hence, in this work we propose an approach for improving the affect recognition in intelligent tutoring systems, which uses a special structure of several support vector machines with different input feature vectors. Furthermore, we propose a new kind of features for this problem. Different experiments with two real data sets show, that our approach is able to improve the classification performance on average by 49% in comparison to using a single classifier.
Ruth Janning, Carlotta Schatten, Lars Schmidt-Thieme, Gerhard Backfried, Norbert Pfannerer
ICTAI1
2014 Automatic Subclasses Estimation for a Better Classification with HNNP
Ruth Janning, Carlotta Schatten, Lars Schmidt-Thieme
ISMIS1
2013 HNNP - A Hybrid Neural Network Plait for Improving Image Classification with Additional Side Information
abstract
Most of the artificial intelligence and machine learning researches deal with big data today. However, there are still a lot of real world problems for which only small and noisy data sets exist. Hence, in this paper we focus on those small data sets of noisy images. Applying learning models to such data may not lead to the best possible results because of few and noisy training examples. We propose a hybrid neural network plait for improving the classification performance of state-of-the-art learning models applied to the images of such data sets. The improvement is reached by (1) using additionally to the images different further side information delivering different feature sets and requiring different learning models, (2) retraining all different learning models interactively within one common structure. The proposed hybrid neural network plait architecture reached in the experiments with 2 different data sets on average a classification performance improvement of 40% and 52% compared to a single convolutional neural network and 13% and 17% compared to a stacking ensemble method.
Ruth Janning, Carlotta Schatten, Lars Schmidt-Thieme
ICTAI1