Results 31 to 40 of about 1,935,881 (268)
Load distribution in weighted complex networks
, 2006 We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depend on the cost distribution function $p_c(c ...
B. Kahng +8 more
core +1 more source
Effects of sampling skewness of the importance-weighted risk estimator on model selection
, 2018 Importance-weighting is a popular and well-researched technique for dealing with sample selection bias and covariate shift. It has desirable characteristics such as unbiasedness, consistency and low computational complexity. However, weighting can have a
Kouw, Wouter M., Loog, Marco
core +1 more source
Learning with the Weighted Trace-norm under Arbitrary Sampling Distributions [PDF]
, 2011 We provide rigorous guarantees on learning with the weighted trace-norm under arbitrary sampling distributions. We show that the standard weighted trace-norm might fail when the sampling distribution is not a product distribution (i.e.
E Qt Qt +6 more
core +3 more sources
Pitman’s Measure of Closeness for Weighted Random Variables
Revstat Statistical JournalStatistical inference based on weighted random variables is developed in the sense of Pitman’s measure of closeness. Some general formulas are presented to compute the Pitman closeness of two weighted random variables to the parameter of interest. A new
Mosayeb Ahmadi +2 more
doaj +1 more source
On weighted exponential-Gompertz distribution: properties and application
Journal of Taibah University for Science, 2019 In this paper, we introduce a new distribution generated by an integral transform of the probability density function of the weighted exponential distribution. This distribution is called the weighted exponential-Gompertz (WE-G). Its hazard rate function
Ahmed M. T. Abd El-Bar, I. E. Ragab
doaj +1 more source
Distributed Weighted Matching [PDF]
, 2004 In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximation ratio of the tree algorithm is constant. In particular, the approximation ratio is 4. For the general graph algorithm we prove a constant ratio bound of 5 and a polylogarithmic time
Mirjam Wattenhofer, Roger Wattenhofer
openaire +1 more source
The new Poisson mixed weighted Lindley distribution with applications to insurance claims data [PDF]
Songklanakarin Journal of Science and Technology (SJST), 2020 Mixed Poisson distributions have been applied for overdispersed count data analysis. In this paper, an alternative mixed Poisson distribution is proposed.
Yupapin Atikankul +2 more
doaj +1 more source
On the average uncertainty for systems with nonlinear coupling [PDF]
, 2016 The increased uncertainty and complexity of nonlinear systems have motivated investigators to consider generalized approaches to defining an entropy function.
Kon, Mark A. +2 more
core +1 more source
Weighted spectral clustering for water distribution network partitioning
Applied Network Science, 2017 In order to improve the management and to better locate water losses, Water Distribution Networks can be physically divided into District Meter Areas (DMAs), inserting hydraulic devices on proper pipes and thus simplifying the control of water budget and
Armando Di Nardo +4 more
doaj +1 more source
Comparison between Modified Weighted Pareto Distribution and Many other Distributions
مجلة بغداد للعلوم, 2023 In 2020 one of the researchers in this paper, in his first research, tried to find out the Modified Weighted Pareto Distribution of Type I by using the Azzalini method for weighted distributions, which contain three parameters, two of them for scale
Mahmood A. Shamran +2 more
doaj +1 more source