Trainable monotone combiner
Neurocomputing, ISSN: 0925-2312, Vol: 417, Page: 86-105
2020
- 1Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Captures1
- Readers1
Article Description
We consider a binary classification problem in which the class label is given in the form of a discriminant function that satisfies a monotone constraint. That is, the degree of confidence that an object belongs to a class can not decrease as one of the input features increases. This manuscript examines how such a discriminant function can be trained on the basis of a labeled data set. Two alternative quality measures are considered. One of them is the AUC, which is based on the ROC analysis. The second is encouraged by the Neyman-Pearson lemma, which aims to maximize the ratio of correctly classified to misclassified examples. We propose an approach in which feature space is partitioned into quality layers that can then effectively compute the discriminant function. We prove that the resulting discriminant function is optimal with respect to the two quality measures mentioned, which indicates, among other things, the equivalence of these two quality measures. We also show that the associated optimal partitioning of feature space is unique, and provide a polynomial training algorithm for generating this partitioning.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0925231220311899; http://dx.doi.org/10.1016/j.neucom.2020.07.075; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85089424229&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0925231220311899; https://dx.doi.org/10.1016/j.neucom.2020.07.075
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know