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

Lars Asker

dblp:50/4588 · DBLP profile ↗
← Back
21ranked-venue papers
7as 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 · 13 · 6 first-authorApplied, interdisciplinary, general and emerging computing · 7 · 1 first-authorDatabases, data management, data science and information retrieval · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 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
3 papers
Knowledge representation and reasoning · 40% Information extraction and text analysis · 30% Kernel, tree and ensemble methods · 30%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Environmental and earth informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Kernel, tree and ensemble methods
ensemble learning
0.011997
Ensembles as a Sequence of Classifiers · IJCAI (2) 1997
Natural language and speech › Information extraction and text analysis
feature engineering
0.011997
Feature Engineering and Classifier Selection: A Case Study in Venusian Volcano Detection · ICML 1997
Knowledge, reasoning and agents › Knowledge representation and reasoning › domain knowledge
domain theory
0.011994
Improving Accuracy of Incorrect Domain Theories · ICML 1994
Knowledge, reasoning and agents › Knowledge representation and reasoning › belief revision
theory revision
0.011994
Improving Accuracy of Incorrect Domain Theories · ICML 1994
Environmental and earth informatics
planetary science
0.011997
Feature Engineering and Classifier Selection: A Case Study in Venusian Volcano Detection · ICML 1997

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

feature engineering · 0.0classifier selection · 0.0
YearPublicationVenuePosition
2020 Corrigendum to 'Learning from heterogeneous temporal data in electronic health records'. [J. Biomed. Inform. 65 (2017) 105-119]
Jing Zhao 0017, Panagiotis Papapetrou, Lars Asker, Henrik Boström
J. Biomed. Informatics3
2017 Conformal Prediction Using Random Survival Forests
abstract
Random survival forests constitute a robust approach to survival modeling, i.e., predicting the probability that an event will occur before or on a given point in time. Similar to most standard predictive models, no guarantee for the prediction error is provided for this model, which instead typically is empirically evaluated. Conformal prediction is a rather recent framework, which allows the error of a model to be determined by a user specified confidence level, something which is achieved by considering set rather than point predictions. The framework, which has been applied to some of the most popular classification and regression techniques, is here for the first time applied to survival modeling, through random survival forests. An empirical investigation is presented where the technique is evaluated on datasets from two real-world applications; predicting component failure in trucks using operational data and predicting survival and treatment of heart failure patients from administrative healthcare data. The experimental results show that the error levels indeed are very close to the provided confidence levels, as guaranteed by the conformal prediction framework, and that the error for predicting each outcome, i.e., event or no-event, can be controlled separately. The latter may, however, lead to less informative predictions, i.e., larger prediction sets, in case the class distribution is heavily imbalanced.
Henrik Boström, Lars Asker, Ram B. Gurung, Isak Karlsson, Tony Lindgren, Panagiotis Papapetrou
ICMLA2
2017 KAPMiner: Mining Ordered Association Rules with Constraints
Isak Karlsson, Panagiotis Papapetrou, Lars Asker
IDA3
2017 Learning from heterogeneous temporal data in electronic health records
abstract
Electronic health records contain large amounts of longitudinal data that are valuable for biomedical informatics research. The application of machine learning is a promising alternative to manual analysis of such data. However, the complex structure of the data, which includes clinical events that are unevenly distributed over time, poses a challenge for standard learning algorithms. Some approaches to modeling temporal data rely on extracting single values from time series; however, this leads to the loss of potentially valuable sequential information. How to better account for the temporality of clinical data, hence, remains an important research question. In this study, novel representations of temporal data in electronic health records are explored. These representations retain the sequential information, and are directly compatible with standard machine learning algorithms. The explored methods are based on symbolic sequence representations of time series data, which are utilized in a number of different ways. An empirical investigation, using 19 datasets comprising clinical measurements observed over time from a real database of electronic health records, shows that using a distance measure to random subsequences leads to substantial improvements in predictive performance compared to using the original sequences or clustering the sequences. Evidence is moreover provided on the quality of the symbolic sequence representation by comparing it to sequences that are generated using domain knowledge by clinical experts. The proposed method creates representations that better account for the temporality of clinical events, which is often key to prediction tasks in the biomedical domain.
Jing Zhao 0017, Panagiotis Papapetrou, Lars Asker, Henrik Boström
J. Biomed. Informatics3
2016 Identifying Factors for the Effectiveness of Treatment of Heart Failure: A Registry Study
abstract
An administrative health register containing health care data for over 2 million patients will be used to search for factors that can affect the treatment of heart failure. In the study, we will measure the effects of employed treatment for various groups of heart failure patients, using different measures of effectiveness. Significant deviations in effectiveness of treatments of the various patient groups will be reported and factors that may help explaining the effect of treatment will be analyzed. Identification of the most important factors that may help explain the observed deviations between the different groups will be derived through generation of predictive models, for which variable importance can be calculated. The findings may affect recommended treatments as well as highlighting deviations from national guidelines.
Lars Asker, Henrik Boström, Panagiotis Papapetrou, Hans E. Persson
CBMS1
2015 Handling Temporality of Clinical Events for Drug Safety Surveillance
Jing Zhao 0017, Aron Henriksson, Maria Kvist, Lars Asker, Henrik Boström
AMIA4
2014 Detecting adverse drug events with multiple representations of clinical measurements
abstract
Adverse drug events (ADEs) are grossly under-reported in electronic health records (EHRs). This could be mitigated by methods that are able to detect ADEs in EHRs, thereby allowing for missing ADE-specific diagnosis codes to be identified and added. A crucial aspect of constructing such systems is to find proper representations of the data in order to allow the predictive modeling to be as accurate as possible. One category of EHR data that can be used as indicators of ADEs are clinical measurements. However, using clinical measurements as features is not unproblematic due to the high rate of missing values and they can be repeated a variable number of times in each patient health record. In this study, five basic representations of clinical measurements are proposed and evaluated to handle these two problems. An empirical investigation using random forest on 27 datasets from a real EHR database with different ADE targets is presented, demonstrating that the predictive performance, in terms of accuracy and area under ROC curve, is higher when representing clinical measurements crudely as whether they were taken or how many times they were taken by a patient. Furthermore, a sixth alternative, combining all five basic representations, significantly outperforms using any of the basic representation except for one. A subsequent analysis of variable importance is also conducted with this fused feature set, showing that when clinical measurements have a high missing rate, the number of times they were taken by one patient is ranked as more informative than looking at their actual values. The observation from random forest is also confirmed empirically using other commonly employed classifiers. This study demonstrates that the way in which clinical measurements from EHRs are presented has a high impact for ADE detection, and that using multiple representations outperforms using a basic representation.
Jing Zhao 0017, Aron Henriksson, Lars Asker, Henrik Boström
BIBM3
2014 A peek into the black box: exploring classifiers by randomization
Andreas Henelius, Kai Puolamäki, Henrik Boström, Lars Asker, Panagiotis Papapetrou
Data Min. Knowl. Discov.4
2013 Predicting Adverse Drug Events by Analyzing Electronic Patient Records
Isak Karlsson, Jing Zhao 0017, Lars Asker, Henrik Boström
AIME3
2009 Classifying Amharic webnews
Lars Asker, Atelach Alemu Argaw, Björn Gambäck, Samuel Eyassu Asfeha, Lemma Nigussie Habte
Inf. Retr.1
2005 Web Mining for an Amharic - English Bilingual Corpus
Atelach Alemu Argaw, Lars Asker
WEBIST2
2002 Notions of Correctness when Evaluating Protein Name Taggers
Fredrik Olsson, Gunnar Eriksson, Kristofer Franzén, Lars Asker, Per Lidén
COLING4
2002 Rule Induction for Classification of Gene Expression Array Data
Per Lidén, Lars Asker, Henrik Boström
PKDD2
2001 Automatic Keyword Extraction Using Domain Knowledge
Anette Hulth, Jussi Karlgren, Henrik Boström, Lars Asker
CICLing5
2000 Similarity-based Approach to Relevance Learning
Rickard Cöster, Lars Asker
ECAI2
2000 Committees of Learning Agents
abstract
We describe how machine learning and decision theory is combined in an application that supports control room operators of a combined heating and power plant to cope with the overwhelming complexity of situations when severe plant disturbances occur. The application is designed as an assistant, rather than as an automatic system that intervenes directly in the operator/plant loop. The application is required to handle vague and numerically imprecise background information in the construction of classifier committees. A classifier committee (or ensemble) is a classifier created by combining the predictions of multiple sub-classifiers. The presented method combines classifiers into a committee by using computational methods for decision analysis that are designed to work when the information at hand is imprecise. The application evaluates and make priorities between classified alarms according to credibilities that depend on the current context. Machine learning techniques are used to construct classifiers that recognize various malfunctions in a process, determine whether a situation is normal or not, and make priorities among alarms.
Lars Asker, Mats Danielson, Love Ekenberg
Int. J. Uncertain. Fuzziness Knowl. Based Syst.1
1998 Learning to Recognize Volcanoes on Venus
Michael C. Burl, Lars Asker, Padhraic Smyth, Usama M. Fayyad, Pietro Perona, Larry Crumpler, Jayne Aubele
Mach. Learn.2
1997 Feature Engineering and Classifier Selection: A Case Study in Venusian Volcano Detection
Lars Asker, Richard Maclin
ICML1
1997 Ensembles as a Sequence of Classifiers
Lars Asker, Richard Maclin
IJCAI (2)1
1994 Improving Accuracy of Incorrect Domain Theories
Lars Asker
ICML1
1992 EBL2: An Approach To Automatic Lexical Acquisition
Lars Asker, Björn Gambäck, Christer Samuelsson
COLING1