<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Comparing Humans and Algorithms in Feature Ranking: A Case-Study in the Medical Domain</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Jonas</forename><surname>Hanselle</surname></persName>
							<email>jonas.hanselle@ifi.lmu.de</email>
							<affiliation key="aff0">
								<orgName type="institution">LMU Munich</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department">Munich Center for Machine Learning</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Jaroslaw</forename><surname>Kornowicz</surname></persName>
							<email>jaroslaw.kornowicz@upb.de</email>
							<affiliation key="aff2">
								<orgName type="institution">Paderborn University</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Stefan</forename><surname>Heid</surname></persName>
							<email>stefan.heid@upb.de</email>
							<affiliation key="aff2">
								<orgName type="institution">Paderborn University</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Kirsten</forename><surname>Thommes</surname></persName>
							<email>kirsten.thommes@upb.de</email>
							<affiliation key="aff2">
								<orgName type="institution">Paderborn University</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Eyke</forename><surname>Hüllermeier</surname></persName>
							<affiliation key="aff0">
								<orgName type="institution">LMU Munich</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
							<affiliation key="aff1">
								<orgName type="department">Munich Center for Machine Learning</orgName>
								<address>
									<country key="DE">Germany</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Comparing Humans and Algorithms in Feature Ranking: A Case-Study in the Medical Domain</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">FC70E25501AD69D16E8470643D0CFA87</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T16:19+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Feature Ranking, Feature Selection, Scoring System, Machine Learning, Decision Support Orcid 0000-0002-1231-4985 (J. Hanselle)</term>
					<term>0000-0002-5654-9911 (J. Kornowicz)</term>
					<term>0000-0002-9461-7372 (S. Heid)</term>
					<term>0000-0002-8057-7162 (K. Thommes)</term>
					<term>0000-0002-9944-4108 (E. Hüllermeier)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>The selection of useful, informative, and meaningful features is a key prerequisite for the successful application of machine learning in practice, especially in knowledge-intense domains like decision support. Here, the task of feature selection, or ranking features by importance, can, in principle, be solved automatically in a data-driven way but also supported by expert knowledge. Besides, one may of course, conceive a combined approach, in which a learning algorithm closely interacts with a human expert. In any case, finding an optimal approach requires a basic understanding of human capabilities in judging the importance of features compared to those of a learning algorithm. Hereto, we conducted a case study in the medical domain, comparing feature rankings based on human judgment to rankings automatically derived from data. The quality of a ranking is determined by the performance of a decision list processing features in the order specified by the ranking, more specifically by so-called probabilistic scoring systems.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>With the increasing access to technology, computational resources, and massive amounts of data, the idea of taking advantage of machine learning (ML) methodology to optimize decision support is becoming more and more feasible. Automated or partially automated decision-making with data-driven models is appealing for various reasons, especially as it is potentially more rational, objective, and accurate than decision-making by humans alone, which may be subjective or error-prone. For example, think of decisions in the context of employee recruitment, such as hiring or placement decisions <ref type="bibr" target="#b0">[1]</ref>, or the construction of individualized treatment rules in personalized medicine <ref type="bibr" target="#b1">[2]</ref>.</p><p>That said, decision models constructed in a data-driven way will not be accepted by human experts <ref type="bibr" target="#b2">[3]</ref> -and hence not be used in practice -unless these models are comprehensible, meaningful, and interpretable. In this regard, the selection and prioritization of decision criteria, or features in machine learning jargon, appears to be of major importance: The features on which a decision is based need to be semantically meaningful; features deemed relevant by the expert should be included in the model, while irrelevant features should be omitted.</p><p>Needless to say, these properties are not necessarily guaranteed when selecting features in a purely data-driven way. As another extreme, one may think of letting the human expert preselect the features by hand. For various reasons, however, this might be suboptimal either, for example, because the expert might be subjectively biased, or her knowledge might not be perfect. Presumably, the best approach is somewhere in-between, namely, hybrid in the sense that the human expert and the machine learning algorithm select features jointly in the course of an interactive process. Either way, these considerations beg an essential question: How capable are human experts in selecting the most important features or in ranking features in descending order of importance, and how do human experts compare to ML algorithms selecting features in a data-driven manner <ref type="bibr" target="#b3">[4,</ref><ref type="bibr" target="#b4">5,</ref><ref type="bibr" target="#b5">6]</ref>? This is the question addressed by the current paper. We conducted a case study in the medical domain, comparing feature (importance) rankings based on human judgment to feature rankings derived from data. The quality of a ranking is determined by the performance of a decision list processing features in the order specified by the ranking. In a decision list, features are considered incrementally, one by one. In each stage of the process, there are two options: either a final decision is made based on the feature values seen so far, or the process is continued by observing the next feature. Features should be ranked in decreasing order of importance to make well-informed decisions as quickly as possible. We implement this approach with so-called scoring systems, specifically appealing from an interpretability perspective and commonly used in the medical domain <ref type="bibr" target="#b6">[7,</ref><ref type="bibr" target="#b7">8]</ref>.</p><p>Previous research suggests that data-driven methods generally surpass knowledge-driven methods in performance, though these findings are not entirely unambiguous. Our study contributes to resolving this continuing debate and extends the current literature by assessing these methods within the context of interpretable machine learning models. In high-stakes environments such as in the medical domain, the constructor of the decision model can be a significant factor for decision-makers, influencing their trust and reliance on the system. Consequently, evaluating the quality of various feature selection methods on such models is vital.</p><p>Our study shows that while data-driven feature ranking exhibits superior performance in identifying patterns unseen by human actors, the risk of overfitting, especially in small or biased datasets, necessitates the incorporation of human judgment for optimal results. We suggest an interactive, co-constructive approach, merging human expertise with algorithmic analytics, as a potential solution to offset overfitting effects while enhancing user acceptance of decision models. We encourage future research to leverage our findings, specifically targeting the inclusion of more domain professionals in the dataset, to further enrich and generalize these insights across various fields.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Data-and Knowledge-Driven Feature Selection</head><p>In the realm of supervised machine learning, most algorithms assume a representation of data objects (instances) in terms of feature vectors, which means that each object is specified by its values on a predefined number of features, also known as independent variables, dimensions, or inputs. The latter are supposed to carry important information for predicting the outcome or target variable <ref type="bibr" target="#b8">[9]</ref>. Careful feature selection is a crucial step in the modeling process and a key prerequisite for learning accurate predictors <ref type="bibr" target="#b9">[10]</ref>. Selecting a manageable number of meaningful features also facilitates interpretability and explainability <ref type="bibr" target="#b5">[6]</ref>.</p><p>Feature selection has been researched intensively in the past, with a specific focus on datadriven approaches. Here, an algorithm autonomously ranks or selects features based on the properties of the data. In contrast, knowledge-driven approaches determine a feature subset through literature review <ref type="bibr" target="#b10">[11,</ref><ref type="bibr" target="#b11">12,</ref><ref type="bibr" target="#b12">13]</ref> or by consulting domain experts <ref type="bibr" target="#b3">[4,</ref><ref type="bibr" target="#b13">14]</ref>. Interactive machine learning fosters a combination of these approaches <ref type="bibr" target="#b14">[15]</ref>. For instance, experts might underscore highly relevant observations and features that a data-driven algorithm can subsequently focus on <ref type="bibr" target="#b15">[16]</ref>. Alternatively, experts might vote on different feature subsets, indirectly revealing their subjective preferences <ref type="bibr" target="#b16">[17]</ref>. It is also possible to aggregate multiple selection and ranking methods into a single approach <ref type="bibr" target="#b17">[18,</ref><ref type="bibr" target="#b3">4,</ref><ref type="bibr" target="#b18">19,</ref><ref type="bibr" target="#b19">20]</ref>.</p><p>Choosing the optimal method for a specific dataset and problem domain is inherently challenging. Guyon and Elisseeff <ref type="bibr" target="#b20">[21]</ref> and Li et al. <ref type="bibr" target="#b5">[6]</ref> advocate for including domain knowledge in the selection process. Conversely, Filippova et al. <ref type="bibr" target="#b4">[5]</ref> find human intervention to be less beneficial than expected, while McKay <ref type="bibr" target="#b21">[22]</ref> demonstrate that, for the same classification problem, a model with merely four features based on social science knowledge can rival models involving 10,000 features. On the other side, Cheng et al. <ref type="bibr" target="#b3">[4]</ref> find that the features chosen by individual cardiologists, or an aggregation of their selections, can enhance accuracy compared to a baseline of all features, although they are still outperformed by data-driven methods. In their experimental study, Corrales et al. <ref type="bibr" target="#b10">[11]</ref> observe that, in certain combinations of datasets and learning algorithms, expert knowledge can outperform data-driven methods. They conclude that expert knowledge can be especially beneficial under limited computational resources, for example, when working with high-dimensional datasets.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Probabilistic Scoring Lists</head><p>A so-called scoring system is a simple decision model that checks a set of features, adds (or subtracts) a certain number of points to a total score for each feature that is satisfied, and finally makes a decision by comparing the total score to a threshold. Scoring systems have a long history of active use in safety-critical domains such as healthcare <ref type="bibr" target="#b22">[23]</ref> and justice <ref type="bibr" target="#b23">[24]</ref>, where they provide guidance for making objective and accurate decisions.</p><p>Hanselle et al. <ref type="bibr" target="#b24">[25]</ref> propose an extension of scoring systems, called probabilistic scoring list (PSL). First, to increase uncertainty-awareness, a PSL produces predictions in the form of probability distributions (instead of making deterministic decisions). Second, to increase cost-efficiency, a PSL is conceptualized as a decision list: At prediction time, features are being evaluated one by one. The procedure may be stopped as soon as the practitioner decides that the confidence in the predictions is high enough for the application context at hand. In the example in Table <ref type="table" target="#tab_0">1</ref>, the relevant information for an evaluation at stage 3 is highlighted in boldface. All features with their accompanying scores up to that stage need to be evaluated. The probabilities for the positive class are obtained by looking up the value corresponding to the total sum of the selected scores 𝑇. Here, the task is to diagnose a patient as COVID-19 positive or negative, given information about various features. In the concrete case, "Fatigue" would be determined as a first feature, and if present, contributes a score of 2. Fever would then be determined as the next feature, contributing a score of 1 if present, and this process continues with the remaining features. At stage 2, the probability of the positive class is predicted as 0 if the total score is 0, 0.1 if the total score is 1, etc. Note that adding a feature with a corresponding score of 0 is practically equivalent with ignoring said feature. Thus, we only consider score sets excluding 0. The learning algorithm introduced in Hanselle et al. <ref type="bibr" target="#b24">[25]</ref> constructs PSLs incrementally in a greedy manner. Starting with the empty list, one additional feature with a corresponding score (taken from a predefined set of scores) is added to the list in each stage. To this end, each feature/score pair is tentatively added as a candidate, and the resulting model is evaluated in terms of the expected entropy as performance measure:</p><formula xml:id="formula_0">𝐸 = ∑ 𝑇 ∈Σ 𝑁 𝑇 𝑁 ⋅ 𝐻( q (𝑇 )) ,<label>(1)</label></formula><p>where Σ is the set of total scores that can be produced The feature/score combination leading to the highest performance is eventually added to the list, and the algorithm proceeds to the next stage (unless all features are used or the gain in terms of expected entropy is negative). The probabilities q (𝑇 ) are estimated in terms of relative frequencies, rectified by isotonic regression to guarantee monotonicity (the probability of the positive class increases with an increasing total score). Note that the expected entropy (1) is a meaningful measure of informedness at every stage of the decision process: The information provided by the prediction of a probability distribution q is quantified in terms of Shannon entropy, which is an established measure of information, and weighted by the (estimated) probability that this prediction is delivered.</p><p>The PSL produced by the above algorithm also suggests a ranking of features in the sense that features appearing earlier in the list seem to be more important in terms of performance than features queried only later on (or possibly not at all, if a decision is made before). With a straightforward modification, the algorithm can also be used to learn scoring systems for a predefined ranking of features: In each stage, it then adopts the corresponding feature and only optimizes over the set of possible scores, instead of optimizing over all features/score pairs.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Evaluation</head><p>In the following, we compare PSLs constructed solely in a data-driven fashion to PSLs in which the evaluated features are ordered according to human choices.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.1.">COVID-19 Dataset</head><p>We employed a non-public medical dataset, based on the work of Hüfner et al. <ref type="bibr" target="#b25">[26]</ref>. A minor deviation from the original dataset in our study pertains to the exclusion of a single observation that contained a missing value. Consequently, our dataset has a total of 696 patient observations.</p><p>According to the medical tests conducted in the original study, 633 patients (90.95%), tested negative for COVID-19. This dataset is comprised of 11 binary features, which, apart from information regarding patient contact with an infected individual, include all patient symptoms. Figure <ref type="figure" target="#fig_2">1</ref> shows all features, their respective distributions across the entire dataset, and the distributions for both positive and negative cases. While our dataset does not include additional demographic information, Hüfner et al. <ref type="bibr" target="#b25">[26]</ref> state in their study that 51.1% of the patients were female and the average age was 55.2 years.</p><p>Figure <ref type="figure" target="#fig_3">2</ref> shows the correlation between all features. Quite remarkably, the feature "Contact with an infected person" is negatively correlated to the target variable. Intuitively, contact with an infected person and the associated risk of exposure to the virus should have a positive correlation with an infection. One possible explanation for this peculiarity might be, that people who know that they had contact with an infected person may have higher awareness   and hence be tempted to ask for a medical examination more quickly, even when showing no clear symptoms. This trend is further observable in the first column of the heatmap, where the correlations with symptoms such as respiratory issues and fever also exhibit a negative association.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.2.">Experimental Setup</head><p>In our experimental evaluation, we use PSLs constructed in five different manners. First, we consider PSLs derived from training data using the algorithm described in Section 3. These are called PSL. Second, we compare them against PSLs built from expert input, specifically the original Covid Score system proposed by Hüfner et al. <ref type="bibr" target="#b25">[26]</ref> (Expert-PSL). The Covid Score was compiled as a consensus of medical experts. It was evaluated on the proposed dataset, however, it has not been used in the process of deriving the score. Note that Expert-PSL is a probabilistic scoring list and thus conceptually different from the original scoring system, which always evaluates the entire feature set and uses a constant threshold of 5 as a decision rule.</p><p>Two further approaches are derived based on a recent incentivized behavioral experiment conducted by Kornowicz and Thommes <ref type="bibr" target="#b26">[27]</ref>. In this study, 234 subjects, recruited from the Prolific.co<ref type="foot" target="#foot_0">1</ref> platform, were requested to rank features based on their perceived importance for the classification task. Despite these subjects lacking specific medical field expertise, it remains plausible that the aggregate of their rankings might approximate the quality of expert opinions, as suggested by research in the field of expert elicitation <ref type="bibr" target="#b27">[28,</ref><ref type="bibr" target="#b28">29,</ref><ref type="bibr" target="#b29">30]</ref>. We primarily utilized the rankings generated individually by subjects (Subject-PSL), along with a method of consensus ranking referred to as Behavioral Aggregation (SubjectBA-PSL). For this method, 90 subjects were grouped into sets of three to agree upon a collective ranking. As there are no specified scores attached to the latter, we chose the scores associated with the features in the same greedy, data-driven manner as the first approach to allow for a fair comparison. Lastly, as a baseline, we consider PSLs constructed from random feature permutations, for which the scores have been chosen in the same manner (Random-PSL). We chose 𝒮 = {±1, ±2, ±3} as the set of possible scores for all methods except the expert method. The expert method's scores are taken from the scoring system by Hüfner et al. <ref type="bibr" target="#b25">[26]</ref> and hence constrained to 𝒮 = {+1, +2, +3}. An overview of the considered constructions is depicted in Table <ref type="table" target="#tab_1">2</ref>.</p><p>We evaluated the individual PSLs in terms of a Monte Carlo cross-validation (MCCV) with 10 repetitions. In each repetition, we use a fraction of two-thirds of the available data as training data and one-third as test data. We report the expected entropy as a neutral measure of informativeness at each stage of the decision model in order to compare the approaches. Additionally, we evaluate the decision models in terms of expected loss minimization. In the domain of medical decision-making, it is common that a false negative prediction, i.e., not isolating and treating a COVID-19-infected patient, has far more severe consequences than a false positive. To capture this, we employ an asymmetric loss function that assigns a loss of 1 to false positives and a loss of 𝑀 ≫ 1 to false negatives. Given the PSLs probabilistic prediction p for the positive class, the risk-minimizing decision is</p><formula xml:id="formula_1">ŷ = { 1 if 1 − p &lt; 𝑀 ⋅ p 0 otherwise ,</formula><p>and the (estimated) expected loss itself by 𝔼( ŷ ) = min{1 − p , 𝑀 ⋅ p }. For the experiments, we chose 𝑀 ≔ 10, i.e., penalizing false negatives ten times as much as false positives.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.3.">Results</head><p>In the following, we compare the five different PSL constructions against each other. Figure <ref type="figure" target="#fig_4">3</ref> shows the mean expected entropy and expected loss of the PSLs for each stage, i.e., after evaluating the stated number of features. We observe that PSL achieves the best mean expected entropy throughout all stages. The Subject-PSL and SubjectBA-PSL constructions perform very similar. Up until stage 3, they exhibit a higher mean expected entropy than the Random-PSL baseline before consistently outperforming it as off stage 5. The Expert-PSL construction also performs worse than the random baseline within the first stages, even deteriorating when evaluating the first two features, both in terms of expected entropy as well as expected loss. This is due to the fact that the first two features selected by Expert-PSL are "Contact w/ inf. person" and "Respiratory symptom". As already discussed in Section 4.1, the "Contact w/ inf. person" is negatively correlated with the target "SARS-CoV-2 positive" and the respiratory symptom is only weakly positively correlated to it. These two features both receive a score of +3 in the Expert-PSL construction, yielding poor performances early on and even deteriorating over the performance at stage 0 in which no feature is considered. The fact that these two features, which seem quite indicative for the human eye, do not have a strong positive influence on the outcome remains undiscovered for the experts. Here, the data-driven approach PSL takes advantage of having access to training data, placing it on average at a rank of 9. Figure <ref type="figure" target="#fig_5">4</ref> shows an overview of the average ranks and scores of all features across the considered methods. For many features, the average ranks of the different approaches are quite similar, with the exception of the "Fatigue" and the "Contact w/ inf. person". Since the scores are optimized to the data in all approaches except for the Expert-PSL, the scores are really similar. This holds true regardless of the average rank of the feature. Note that the expert scores are selected according to Hüfner et al. <ref type="bibr" target="#b25">[26]</ref>, constraining them to only positive scores.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Reducing available training data</head><p>As discussed in the previous section, the data-driven approach PSL manages to unveil specifics from the data that are not taken into account by human actors. To make this feasible, it makes use of training data whose availability is a necessary condition for applying such methods. To investigate how much the data-driven approaches are dependent on the availability of data, we restricted them to 20% of the original training data by drawing subsamples from the original data without replacement and repeated the experiments 10 times. Figure <ref type="figure" target="#fig_6">5</ref> shows the expected entropy of the different PSLs when training them on these reduced training datasets. We observe that the PSL is outperformed from stage 7 on by the Expert-PSL and also by the Subject-PSL and SubjectBA-PSL as of stage 9 in terms of expected entropy. When it comes to the expected loss, PSL is already beaten by Expert-PSL at stage 3 and the Subject-PSL and SubjectBA-PSL methods at stage 7. In the end, even the Random-PSL baseline exhibits a slightly lower mean expected error than the PSL. As expected, data-driven approaches become less reliable once access to data is restricted. In such scenarios, human expertise and common sense achieve better results than automated methods.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Conclusion</head><p>This paper has explored the comparative effectiveness of humans and algorithms in feature ranking for decision support. A case study in the medical domain was conducted, in which we compared feature rankings based on human judgment to rankings automatically derived from data. It was observed that the data-driven approach can identify patterns and specifics that remained hidden from human actors, leading to better performances in our experimental evaluation. On the other hand, feature rankings solely derived in an algorithmic manner bear the risk of being overfitted to the available training data, resulting in poor generalization performance. This becomes especially important when training datasets are small or significantly biased. In this case, human knowledge and common sense may be a good countermeasure to compensate for such effects.</p><p>An interactive feature ranking procedure that combines the strengths of human and datadriven approaches constitutes an interesting direction for future work. Harnessing the benefits of human expertise and computational analytics in a co-constructive approach potentially leads to more accurate decision models while mitigating the risk of overfitting. Additionally, including humans in the learning procedure may also increase the practitioner's acceptance of the obtained decision model, as purely algorithmically constructed models are often faced with distrust <ref type="bibr" target="#b30">[31]</ref>.</p><p>As machine learning-based decision support systems continue to gain traction, our findings offer valuable insights to researchers in this emerging field. Future research efforts could potentially build upon and generalize our findings by employing different datasets and extending the scope to various domains. One of the key strengths of our dataset is the high volume of human rankings; however, these subjects notably lack significant domain experience, with the exception of the utilization of the Covid Score system of Hüfner et al. <ref type="bibr" target="#b25">[26]</ref>. While the recruitment of a larger number of domain professionals presents a challenge, pursuing this could undoubtedly yield more insightful findings in future research.</p></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head></head><label></label><figDesc>by the decision list, 𝑁 = |𝒟 | is the total number of training examples, and 𝑁 𝑇 the number of training examples with total score 𝑇. Moreover, q (𝑇 ) is the estimated probability of the positive class given total score 𝑇, and 𝐻 is the Shannon entropy 𝐻 (𝑞) = −𝑞 ⋅ log(𝑞) − (1 − 𝑞) log(1 − 𝑞) .</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>C o n ta</head><label></label><figDesc>ct w it h in fe ct ed p er so n C o u g h D ig es ti ve p ro b le m s F at ig u e F ev er H ea d ac h e L im b p ai n L o ss o f sm el l R es p ir at or y sy m p to m S n iffl es S or e th ro at 0</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Feature prevalence overall and split between positive and negative class.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>CFigure 2 :</head><label>2</label><figDesc>Figure 2: Heatmap showing features Pearson correlation. The last row shows the correlation with the target variable.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Mean expected entropy and expected loss of all considered PSL variants trained on the full training data. Error bands indicate the 95% confidence interval.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: Average rank and average score of each feature across the methods.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Mean expected entropy and expected loss of all considered PSL variants trained on a reduced set of 20% of the original training data. Error bands indicate the 95% confidence interval. Scales have been chosen in accordance with Figure 3</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>Example of a probabilistic scoring list for the COVID-19 use case</figDesc><table><row><cell>Stage</cell><cell>Feature</cell><cell cols="9">Score T=-1 T=0 T=1 T=2 T=3 T=4 T=5 T=6</cell></row><row><cell>0</cell><cell>-</cell><cell>-</cell><cell>-</cell><cell>0.1</cell><cell>-</cell><cell>-</cell><cell>-</cell><cell>-</cell><cell>-</cell><cell>-</cell></row><row><cell>1</cell><cell>Fatigue</cell><cell>+2</cell><cell>-</cell><cell>0.1</cell><cell>-</cell><cell>0.3</cell><cell>-</cell><cell>-</cell><cell>-</cell><cell>-</cell></row><row><cell>2</cell><cell>Fever</cell><cell>+1</cell><cell>-</cell><cell>0.0</cell><cell>0.1</cell><cell>0.2</cell><cell>0.4</cell><cell>-</cell><cell>-</cell><cell>-</cell></row><row><cell>3</cell><cell>Cough</cell><cell>+2</cell><cell>-</cell><cell cols="6">0.0 0.1 0.1 0.2 0.2 0.5</cell><cell>-</cell></row><row><cell>4</cell><cell>Loss of smell</cell><cell>+1</cell><cell>-</cell><cell>0.0</cell><cell>0.1</cell><cell>0.1</cell><cell>0.2</cell><cell>0.2</cell><cell>0.4</cell><cell>1.0</cell></row><row><cell>5</cell><cell>Contact w/ inf. person</cell><cell>-1</cell><cell>0.0</cell><cell>0.0</cell><cell>0.1</cell><cell>0.1</cell><cell>0.2</cell><cell>0.4</cell><cell>0.4</cell><cell>1.0</cell></row></table></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_1"><head>Table 2</head><label>2</label><figDesc>All considered PSLs in the experimental evaluation</figDesc><table><row><cell>Approach</cell><cell>Feature sequence chosen algorithmically Scores chosen algorithmically</cell></row><row><cell>PSL</cell><cell></cell></row><row><cell>Expert-PSL</cell><cell></cell></row><row><cell>Subject-PSL</cell><cell></cell></row><row><cell>SubjectBA-PSL</cell><cell></cell></row><row><cell>Random-PSL</cell><cell></cell></row></table></figure>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">https://www.prolific.co/</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>We gratefully acknowledge funding by the German Research Foundation (Deutsche Forschungsgemeinschaft, DFG): TRR 318/1 2021 -438445824.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Employees recruitment: A prescriptive analytics approach via machine learning and mathematical programming</title>
		<author>
			<persName><forename type="first">D</forename><surname>Pessach</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Singer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Avrahamia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><forename type="middle">C</forename><surname>Ben-Gal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Shmueli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Ben-Gala</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Decision Support Systems</title>
		<imprint>
			<biblScope unit="volume">134</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Estimating individualized treatment rules using outcome weighted learning</title>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Zeng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Rush</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Kosorok</surname></persName>
		</author>
		<idno type="DOI">10.1080/01621459.2012.695674</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of the American Statistical Association</title>
		<imprint>
			<biblScope unit="volume">107</biblScope>
			<biblScope unit="page" from="1106" to="1118" />
			<date type="published" when="2012">2012</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<monogr>
		<author>
			<persName><forename type="first">M</forename><surname>Ashoori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">D</forename><surname>Weisz</surname></persName>
		</author>
		<idno type="arXiv">arXiv:1912.02675</idno>
		<idno>arXiv:</idno>
		<ptr target="1912.02675" />
		<title level="m">In ai we trust? factors that influence trustworthiness of ai-infused decision-making processes</title>
				<imprint>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Feature selection for medical data mining: Comparisons of expert judgment and automatic approaches</title>
		<author>
			<persName><forename type="first">T.-H</forename><surname>Cheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C.-P</forename><surname>Wei</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Tseng</surname></persName>
		</author>
		<idno type="DOI">10.1109/CBMS.2006.87</idno>
	</analytic>
	<monogr>
		<title level="m">19th IEEE Symposium on Computer-Based Medical Systems (CBMS&apos;06)</title>
				<imprint>
			<date type="published" when="2006">2006</date>
			<biblScope unit="page" from="165" to="170" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Humans in the loop: Incorporating expert and crowd-sourced knowledge for predictions using survey data</title>
		<author>
			<persName><forename type="first">A</forename><surname>Filippova</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Gilroy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Kashyap</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kirchner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">C</forename><surname>Morgan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Polimis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Usmani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Wang</surname></persName>
		</author>
		<idno type="DOI">10.1177/2378023118820157</idno>
	</analytic>
	<monogr>
		<title level="j">Socius</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page">2378023118820157</biblScope>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Feature selection: A data perspective</title>
		<author>
			<persName><forename type="first">J</forename><surname>Li</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Cheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Morstatter</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><forename type="middle">P</forename><surname>Trevino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Tang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Liu</surname></persName>
		</author>
		<idno type="DOI">10.1145/3136625</idno>
	</analytic>
	<monogr>
		<title level="j">ACM Computing Surveys</title>
		<imprint>
			<biblScope unit="volume">50</biblScope>
			<biblScope unit="page">45</biblScope>
			<date type="published" when="2017">2017</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Scoring systems in the intensive care unit: A compendium, Indian Journal of Critical Care Medicine : Peer-reviewed</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">G</forename><surname>Rapsang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">C</forename><surname>Shyam</surname></persName>
		</author>
		<idno type="DOI">10.4103/0972-5229.130573</idno>
	</analytic>
	<monogr>
		<title level="j">Official Publication of Indian Society of Critical Care Medicine</title>
		<imprint>
			<biblScope unit="volume">18</biblScope>
			<biblScope unit="page" from="220" to="228" />
			<date type="published" when="2014">2014</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Supersparse linear integer models for optimized medical scoring systems</title>
		<author>
			<persName><forename type="first">B</forename><surname>Ustun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Rudin</surname></persName>
		</author>
		<idno type="DOI">10.1007/s10994-015-5528-6</idno>
	</analytic>
	<monogr>
		<title level="j">Machine Learning</title>
		<imprint>
			<biblScope unit="volume">102</biblScope>
			<biblScope unit="page" from="349" to="391" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">An introduction to statistical learning</title>
		<author>
			<persName><forename type="first">G</forename><surname>James</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Witten</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Hastie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Tibshirani</surname></persName>
		</author>
		<imprint>
			<date type="published" when="2013">2013</date>
			<publisher>Springer</publisher>
			<biblScope unit="volume">112</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Towards crisp-ml(q): A machine learning process model with quality assurance methodology</title>
		<author>
			<persName><forename type="first">S</forename><surname>Studer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">B</forename><surname>Bui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Drescher</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Hanuschkin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Winkler</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Peters</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K.-R</forename><surname>Müller</surname></persName>
		</author>
		<idno type="DOI">10.3390/make3020020</idno>
	</analytic>
	<monogr>
		<title level="j">Machine Learning and Knowledge Extraction</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="392" to="413" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Feature selection for classification tasks: Expert knowledge or traditional methods?</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">C</forename><surname>Corrales</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Lasso</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Ledezma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">C</forename><surname>Corrales</surname></persName>
		</author>
		<idno type="DOI">10.3233/JIFS-169470</idno>
	</analytic>
	<monogr>
		<title level="j">Journal of Intelligent &amp; Fuzzy Systems</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="page" from="2825" to="2835" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Computational intelligence for heart disease diagnosis: A medical knowledge driven approach</title>
		<author>
			<persName><forename type="first">J</forename><surname>Nahar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Imam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">S</forename><surname>Tickle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y.-P</forename><forename type="middle">P</forename><surname>Chen</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.eswa.2012.07.032</idno>
	</analytic>
	<monogr>
		<title level="j">Expert Systems with Applications</title>
		<imprint>
			<biblScope unit="volume">40</biblScope>
			<biblScope unit="page" from="96" to="104" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Learning credible models</title>
		<author>
			<persName><forename type="first">J</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Oh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Wiens</surname></persName>
		</author>
		<idno type="DOI">10.1145/3219819.3220070</idno>
		<idno>doi:10.1145/3219819.3220070</idno>
		<ptr target="https://doi.org/10.1145/3219819.3220070" />
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining, KDD &apos;18</title>
				<meeting>the 24th ACM SIGKDD International Conference on Knowledge Discovery &amp; Data Mining, KDD &apos;18<address><addrLine>New York, NY, USA</addrLine></address></meeting>
		<imprint>
			<publisher>Association for Computing Machinery</publisher>
			<date type="published" when="2018">2018</date>
			<biblScope unit="page" from="2417" to="2426" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">A divide-and-conquer strategy using feature relevance and expert knowledge for enhancing a data mining approach to bank telemarketing</title>
		<author>
			<persName><forename type="first">S</forename><surname>Moro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Cortez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Rita</surname></persName>
		</author>
		<idno type="DOI">10.1111/exsy.12253</idno>
	</analytic>
	<monogr>
		<title level="j">Expert Systems</title>
		<imprint>
			<biblScope unit="volume">35</biblScope>
			<biblScope unit="page">e12253</biblScope>
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Interactive machine learning for health informatics: when do we need the human-in-the-loop?</title>
		<author>
			<persName><forename type="first">A</forename><surname>Holzinger</surname></persName>
		</author>
		<idno type="DOI">10.1007/s40708-016-0042-6</idno>
	</analytic>
	<monogr>
		<title level="j">Brain Informatics</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="119" to="131" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Human-in-the-loop feature selection</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">H C</forename><surname>Correia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Lecue</surname></persName>
		</author>
		<idno type="DOI">10.1609/aaai.v33i01.33012438</idno>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the AAAI Conference on Artificial Intelligence</title>
				<meeting>the AAAI Conference on Artificial Intelligence</meeting>
		<imprint>
			<date type="published" when="2019">2019</date>
			<biblScope unit="volume">33</biblScope>
			<biblScope unit="page" from="2438" to="2445" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Active preference-based optimization for human-in-the-loop feature selection</title>
		<author>
			<persName><forename type="first">F</forename><surname>Bianchi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Piroddi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Bemporad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Halasz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Villani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Piga</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.ejcon.2022.100647</idno>
	</analytic>
	<monogr>
		<title level="j">European Journal of Control</title>
		<imprint>
			<biblScope unit="volume">66</biblScope>
			<biblScope unit="page">100647</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">Ensembles for feature selection: A review and future trends</title>
		<author>
			<persName><forename type="first">V</forename><surname>Bolón-Canedo</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Alonso-Betanzos</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.inffus.2018.11.008</idno>
	</analytic>
	<monogr>
		<title level="j">Information Fusion</title>
		<imprint>
			<biblScope unit="volume">52</biblScope>
			<biblScope unit="page" from="1" to="12" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Classification performance of rank aggregation techniques for ensemble gene selection</title>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">J</forename><surname>Dittman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">M</forename><surname>Khoshgoftaar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Wald</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Napolitano</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">The twenty-sixth international FLAIRS conference</title>
				<imprint>
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">An extensive comparison of feature ranking aggregation techniques in bioinformatics</title>
		<author>
			<persName><forename type="first">R</forename><surname>Wald</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><forename type="middle">M</forename><surname>Khoshgoftaar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Dittman</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Awada</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Napolitano</surname></persName>
		</author>
		<idno type="DOI">10.1109/IRI.2012.6303034</idno>
	</analytic>
	<monogr>
		<title level="m">IEEE 13th International Conference on Information Reuse &amp; Integration (IRI)</title>
				<imprint>
			<date type="published" when="2012">2012. 2012</date>
			<biblScope unit="page" from="377" to="384" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">An introduction to variable and feature selection</title>
		<author>
			<persName><forename type="first">I</forename><surname>Guyon</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Elisseeff</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of machine learning research</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="1157" to="1182" />
			<date type="published" when="2003">2003</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">When 4≈ 10,000: The power of social science knowledge in predictive performance</title>
		<author>
			<persName><forename type="first">S</forename><surname>Mckay</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Socius</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page">2378023118811774</biblScope>
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Chest pain in the emergency room: value of the heart score</title>
		<author>
			<persName><forename type="first">A</forename><surname>Six</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Backus</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Kelder</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Netherlands Heart Journal</title>
		<imprint>
			<biblScope unit="volume">16</biblScope>
			<biblScope unit="page" from="191" to="196" />
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">In pursuit of interpretable, fair and accurate machine learning for criminal recidivism prediction</title>
		<author>
			<persName><forename type="first">C</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Han</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Patel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Rudin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Quantitative Criminology</title>
		<imprint>
			<biblScope unit="page" from="1" to="63" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Probabilistic scoring lists for interpretable machine learning</title>
		<author>
			<persName><forename type="first">J</forename><surname>Hanselle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Fürnkranz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Hüllermeier</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. DS, 23rd Int. Conference on Discovery Science</title>
				<meeting>DS, 23rd Int. Conference on Discovery Science<address><addrLine>Porto, Portugal</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Risikostratifizierung durch implementierung und evaluation eines covid-19-scores</title>
		<author>
			<persName><forename type="first">A</forename><surname>Hüfner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Kiefl</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Baacke</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Zöllner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Loza Mencía</surname></persName>
		</author>
		<author>
			<persName><forename type="first">O</forename><surname>Schellein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Avan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Pemmerl</surname></persName>
		</author>
		<idno type="DOI">10.1007/s00063-020-00754-4</idno>
	</analytic>
	<monogr>
		<title level="j">Medizinische Klinik -Intensivmedizin und Notfallmedizin</title>
		<imprint>
			<biblScope unit="volume">115</biblScope>
			<biblScope unit="page" from="132" to="138" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">Aggregating human domain knowledge for feature ranking</title>
		<author>
			<persName><forename type="first">J</forename><surname>Kornowicz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Thommes</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-031-35891-3_7</idno>
	</analytic>
	<monogr>
		<title level="m">Artificial Intelligence in HCI</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<editor>
			<persName><forename type="first">H</forename><surname>Degen</surname></persName>
		</editor>
		<editor>
			<persName><forename type="first">S</forename><surname>Ntoa</surname></persName>
		</editor>
		<meeting><address><addrLine>Nature Switzerland; Cham</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="98" to="114" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Professional vs. amateur judgment accuracy: The case of foreign exchange rates</title>
		<author>
			<persName><forename type="first">D</forename><surname>Önkal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">F</forename><surname>Yates</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Simga-Mugan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Ş</forename><surname>Öztin</surname></persName>
		</author>
		<idno type="DOI">10.1016/S0749-5978(03)00058-X</idno>
	</analytic>
	<monogr>
		<title level="j">Organizational Behavior and Human Decision Processes</title>
		<imprint>
			<biblScope unit="volume">91</biblScope>
			<biblScope unit="page" from="169" to="185" />
			<date type="published" when="2003">2003</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<monogr>
		<title level="m" type="main">Are Crowds on the Internet Wiser than Experts? -The Case of a Stock Prediction Community</title>
		<author>
			<persName><forename type="first">M</forename><surname>Nofer</surname></persName>
		</author>
		<idno type="DOI">10.1007/978-3-658-09508-6_3</idno>
		<idno>doi:</idno>
		<ptr target="10.1007/978-3-658-09508-6_3" />
		<imprint>
			<date type="published" when="2015">2015</date>
			<publisher>Springer Fachmedien</publisher>
			<biblScope unit="page" from="27" to="61" />
			<pubPlace>Wiesbaden</pubPlace>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b29">
	<analytic>
		<title level="a" type="main">Measuring the crowd within: Probabilistic representations within individuals</title>
		<author>
			<persName><forename type="first">E</forename><surname>Vul</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Pashler</surname></persName>
		</author>
		<idno type="DOI">10.1111/j.1467-9280.2008.02136.x</idno>
	</analytic>
	<monogr>
		<title level="j">Psychological Science</title>
		<imprint>
			<biblScope unit="volume">19</biblScope>
			<biblScope unit="page" from="645" to="647" />
			<date type="published" when="2008">2008</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b30">
	<analytic>
		<title level="a" type="main">What influences algorithmic decision-making? a systematic literature review on algorithm aversion</title>
		<author>
			<persName><forename type="first">H</forename><surname>Mahmud</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">K M N</forename><surname>Islam</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">I</forename><surname>Ahmed</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Smolander</surname></persName>
		</author>
		<idno type="DOI">10.1016/j.techfore.2021.121390</idno>
	</analytic>
	<monogr>
		<title level="j">Technological Forecasting and Social Change</title>
		<imprint>
			<biblScope unit="volume">175</biblScope>
			<biblScope unit="page">121390</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
