In this work, we introduce a score fusion scheme to improve the 3D object retrieval performance. The state of the art in 3D object retrieval shows that no single descriptor is capable of providing fine grain discrimination required by prospective 3D search engines. The proposed fusion algorithm linearly combines similarity information originating from multiple shape descriptors and learns their...

Risks exist in many different domains; medical diagnoses, financial markets, fraud detection and insurance policies are some examples. Various risk measures and risk estimation systems have hitherto been proposed and this paper suggests a new risk estimation method. Risk estimation by maximizing the area under a receiver operating characteristics (ROC) curve (REMARC) defines risk estimation as ...

This article reports an extension of the Carnegie Mellon risk-ranking method to incorporate ecological risks and their attributes. On the basis of earlier risk-perception studies, we identified a set of 20 relevant attributes for describing health, safety, and environmental hazards in standardized risk summary sheets. In a series of three ranking sessions, 23 laypeople ranked 10 such hazards in...

Mutual funds are the best tool to mobilize savings and investments in an economy and Pakistan is the pioneer in South Asia, but this industry is not as much mature in comparison to its age in Pakistan. This paper examines the performance of closed ended mutual funds in Pakistan by using five different ranking measures during a period of January 2009 to December 2013 and the sample consists of o...

This paper provides a simple method of ranking mutual funds' probabilities of outperforming a benchmark portfolio. We show that ranking fund performance in this way is identical to ranking each fund's portfolio with a generalized entropy, equivalent to an expected generalized power utility index that uses a risk aversion coe±cient speci ̄c to that fund. When the return di®erential between fund a...

R bounds for position-sensitive max-margin ranking algorithms can be derived straightforwardly from a structural result for Rademacher averages presented by [1]. We apply this result to pairwise and listwise hinge loss that are position-sensitive by virtue of rescaling the margin by a pairwise or listwise position-sensitive prediction loss. Similar bounds have recently been presented for probab...

One can use the Leiden Rankings for grouping research universities by considering universities which are not significantly different as a homogeneous set. Such groupings reduce the complexity of the rankings without losing information. We pursue this classification using both statistical significance and effect sizes of differences among 902 universities in 54 countries; we focus on the UK, Ger...

The exchangeability assumption as defined in this paper on ranking functions seems intuitively natural, and indeed, specific ranking functions previously proposed in the literature are all exchangeable. While pointwise ranking functions are vacuously exchangeable, we now discuss two specifically listwise ranking functions previously proposed by [22] and [26] in light of our representation theor...

This paper is a continuation of the study of surprise as a base for constructing qualitative calculi for representing and reasoning about uncertain knowledge. Here, we further elaborate on κ, a qualitative ranking function which we developed in (Ibrahim, Tawfik, and Ngom 2009b) and which constructs qualitative ranks for events by obtaining the order of magnitude abstraction of the degree of sur...