Topic
Intersection (set theory)
About: Intersection (set theory) is a research topic. Over the lifetime, 2468 publications have been published within this topic receiving 54419 citations. The topic is also known as: set intersection & intersection of sets.
Papers published on a yearly basis
1 / 2
Papers
Posted Content•
TL;DR: This paper introduces a generalized version of IoU ( GIoU) as a loss into the state-of-the art object detection frameworks, and shows a consistent improvement on their performance using both the standard, IoU based, and new, GIo U based, performance measures on popular object detection benchmarks.
Abstract: Intersection over Union (IoU) is the most popular evaluation metric used in the object detection benchmarks. However, there is a gap between optimizing the commonly used distance losses for regressing the parameters of a bounding box and maximizing this metric value. The optimal objective for a metric is the metric itself. In the case of axis-aligned 2D bounding boxes, it can be shown that $IoU$ can be directly used as a regression loss. However, $IoU$ has a plateau making it infeasible to optimize in the case of non-overlapping bounding boxes. In this paper, we address the weaknesses of $IoU$ by introducing a generalized version as both a new loss and a new metric. By incorporating this generalized $IoU$ ($GIoU$) as a loss into the state-of-the art object detection frameworks, we show a consistent improvement on their performance using both the standard, $IoU$ based, and new, $GIoU$ based, performance measures on popular object detection benchmarks such as PASCAL VOC and MS COCO.
2,783 citations
[...]
TL;DR: The authors define equality of two soft sets, subset and super set of a soft set, complement of asoft set, null soft set and absolute soft set with examples and De Morgan's laws and a number of results are verified in soft set theory.
Abstract: In this paper, the authors study the theory of soft sets initiated by Molodtsov. The authors define equality of two soft sets, subset and super set of a soft set, complement of a soft set, null soft set, and absolute soft set with examples. Soft binary operations like AND, OR and also the operations of union, intersection are defined. De Morgan's laws and a number of results are verified in soft set theory.
2,548 citations
TL;DR: In this paper, an alternate method for finding several Pareto optimal points for a general nonlinear multicriteria optimization problem is proposed, which can handle more than two objectives while retaining the computational efficiency of continuation-type algorithms.
Abstract: This paper proposes an alternate method for finding several Pareto optimal points for a general nonlinear multicriteria optimization problem. Such points collectively capture the trade-off among the various conflicting objectives. It is proved that this method is independent of the relative scales of the functions and is successful in producing an evenly distributed set of points in the Pareto set given an evenly distributed set of parameters, a property which the popular method of minimizing weighted combinations of objective functions lacks. Further, this method can handle more than two objectives while retaining the computational efficiency of continuation-type algorithms. This is an improvement over continuation techniques for tracing the trade-off curve since continuation strategies cannot easily be extended to handle more than two objectives.
2,480 citations
TL;DR: This work proposes three methods based on the highest rank, the Borda count, and logistic regression for class set reranking that have been tested in applications of degraded machine-printed characters and works from large lexicons, resulting in substantial improvement in overall correctness.
Abstract: A multiple classifier system is a powerful solution to difficult pattern recognition problems involving large class sets and noisy input because it allows simultaneous use of arbitrary feature descriptors and classification procedures. Decisions by the classifiers can be represented as rankings of classifiers and different instances of a problem. The rankings can be combined by methods that either reduce or rerank a given set of classes. An intersection method and union method are proposed for class set reduction. Three methods based on the highest rank, the Borda count, and logistic regression are proposed for class set reranking. These methods have been tested in applications of degraded machine-printed characters and works from large lexicons, resulting in substantial improvement in overall correctness. >
1,788 citations
TL;DR: This paper points out that several assertions in a previous paper by Maji et al. are not true in general, and gives some new notions such as the restricted intersection, the restricted union, therestricted difference and the extended intersection of two soft sets.
Abstract: Molodtsov introduced the theory of soft sets, which can be seen as a new mathematical approach to vagueness. In this paper, we first point out that several assertions (Proposition 2.3 (iv)-(vi), Proposition 2.4 and Proposition 2.6 (iii), (iv)) in a previous paper by Maji et al. [P.K. Maji, R. Biswas, A.R. Roy, Soft set theory, Comput. Math. Appl. 45 (2003) 555-562] are not true in general, by counterexamples. Furthermore, based on the analysis of several operations on soft sets introduced in the same paper, we give some new notions such as the restricted intersection, the restricted union, the restricted difference and the extended intersection of two soft sets. Moreover, we improve the notion of complement of a soft set, and prove that certain De Morgan's laws hold in soft set theory with respect to these new definitions.
1,543 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2022 | 1 |
| 2021 | 166 |
| 2020 | 170 |
| 2019 | 156 |
| 2018 | 165 |
| 2017 | 164 |