scispace - formally typeset
Search or ask a question
Topic

Class (philosophy)

About: Class (philosophy) is a research topic. Over the lifetime, 821 publications have been published within this topic receiving 28000 citations.


Papers
More filters
Journal ArticleDOI
01 Jan 2023
TL;DR: In this paper , a discriminative maximum mean discrepancy (MMD) with two parallel strategies is proposed to restrain the degradation of feature discriminability or the expansion of intra-class distance.
Abstract: Existing domain adaptation approaches often try to reduce distribution difference between source and target domains and respect domain-specific discriminative structures by some distribution [e.g., maximum mean discrepancy (MMD)] and discriminative distances (e.g., intra-class and inter-class distances). However, they usually consider these losses together and trade off their relative importance by estimating parameters empirically. It is still under insufficient exploration so far to deeply study their relationships to each other so that we cannot manipulate them correctly and the model’s performance degrades. To this end, this article theoretically proves two essential facts: 1) minimizing MMD equals to jointly minimizing their data variance with some implicit weights but, respectively, maximizing the source and target intra-class distances so that feature discriminability degrades and 2) the relationship between intra-class and inter-class distances is as one falls and another rises. Based on this, we propose a novel discriminative MMD with two parallel strategies to correctly restrain the degradation of feature discriminability or the expansion of intra-class distance; specifically: 1) we directly impose a tradeoff parameter on the intra-class distance that is implicit in the MMD according to 1) and 2) we reformulate the inter-class distance with special weights that are analogical to those implicit ones in the MMD and maximizing it can also lead to the intra-class distance falling according to 2). Notably, we do not consider the two strategies in one model due to 2). The experiments on several benchmark datasets not only prove the validity of our revealed theoretical results but also demonstrate that the proposed approach could perform better than some compared state-of-art methods substantially. Our preliminary MATLAB code will be available at https://github.com/WWLoveTransfer/ .

16 citations

Journal ArticleDOI
TL;DR: Wang et al. as mentioned in this paper proposed a weight assignment strategy based on densities and the distances to the SVDD class boundary, which facilitates simultaneously combating between-class and within-class imbalance issues caused by complicated distribution.

16 citations

Journal ArticleDOI
TL;DR: In this paper, the standard definition of a close-to-convex function involves a complex numerical factor eiβ which is on occasion erroneously replaced by 1, and explicit reasons for this fact seem to be lacking in the literature.
Abstract: The standard definition of a close-to-convex function involves a complex numerical factor eiβ which is on occasion erroneously replaced by 1. While it is known to experts in the field that this replacement cannot be made without essentially changing the class, explicit reasons for this fact seem to be lacking in the literature. Our purpose is to fill this gap, and in so doing we are lead to a new coefficient problem which is solved for n=2, but is open for n>2.

15 citations

Patent
30 Jun 2005
TL;DR: In this article, a technique for introspection support for anonymous and local classes is described, where the compiler determines whether a particular class is a local or anonymous class, and the compiler emits, into the particular class' binary class file, information that indicates which class encloses the particular classes.
Abstract: A technique in accordance with one embodiment of the present invention provides introspection support for anonymous and local classes. As a result of the technique, an enclosing class that defines a generic type variable that is not defined within a local or anonymous class that refers to the generic type variable can be determined. According to one embodiment of the invention, when a compiler determines that a particular class is a local or anonymous class, the compiler emits, into the particular class' binary class file, information that indicates which class encloses the particular class. In response to the invocation of a method (described herein) relative to a reflective proxy that corresponds to an enclosed class, information that identifies an enclosing class that encloses the enclosed class is returned. This is so even if the enclosed class is a local or anonymous class.

15 citations

Posted Content
01 May 2020
TL;DR: In this paper, a class of decisive collective choice rules that rely on an exogenous linear ordering to partition the majority relation into two acyclic relations is proposed, where the first relation is used to obtain a shortlist of the feasible alternatives while the second is used for making a final choice.
Abstract: We propose a class of decisive collective choice rules that rely on an exogenous linear ordering to partition the majority relation into two acyclic relations. The first relation is used to obtain a shortlist of the feasible alternatives while the second is used to make a final choice. In combination with faithfulness to the underlying majority relation, rules in this class are characterized by two desirable rationality properties: Sen’s expansion consistency and a version of Manzini and Mariotti’s weak WARP. The rules also satisfy natural adaptations of Arrow’s independence of irrelevant alternatives and May’s positive responsiveness.

15 citations


Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20241
202311,771
202223,753
2021380
2020186
201962