Chance-Constrained Programs for Link Prediction
نویسندگان
چکیده
In this paper, we consider the link prediction problem, where we are given a partial snapshot of a network at some time and the goal is to predict additional links at a later time. The accuracy of the current prediction methods is quite low due to the extreme class skew and the large number of potential links. In this paper, we describe learning algorithms based on chance constrained programs and show that they exhibit all the properties needed for a good link predictor, namely, allow preferential bias to positive or negative class; handle skewness in the data; and scale to large networks. Our experimental results on three real-world coauthorship networks show significant improvement in prediction accuracy over baseline algorithms.
منابع مشابه
Learning Algorithms for Link Prediction Based on Chance Constraints
In this paper, we consider the link prediction problem, where we are given a partial snapshot of a network at some time and the goal is to predict the additional links formed at a later time. The accuracy of current prediction methods is quite low due to the extreme class skew and the large number of potential links. Here, we describe learning algorithms based on chance constrained programs and...
متن کاملSOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING
Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...
متن کاملA Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality
In this paper, we study the link between a Chance-Constrained optimization Problem (CCP) and its sample counterpart (SP). SP has a finite number, say N , of sampled constraints. Further, some of these sampled constraints, say k, are discarded, and the final solution is indicated by x∗N,k. Extending previous results on the feasibility of sample convex optimization programs, we establish the feas...
متن کاملA chance-constrained multi-objective model for final assembly scheduling in ATO systems with uncertain sub-assembly availability
A chance-constraint multi-objective model under uncertainty in the availability of subassemblies is proposed for scheduling in ATO systems. The on-time delivery of customer orders as well as reducing the company's cost is crucial; therefore, a three-objective model is proposed including the minimization of1) overtime, idletime, change-over, and setup costs, 2) total dispersion of items’ deliver...
متن کاملA Chance Constrained Multiple Objective Goal Programming Model of Fuzzy QFD and FMEA: Model Development
There are varieties of QFD combination forms available that can help management to choose the right model for his/her types of problem. The proposed MOCC-QFD-FMEA model is a right model to include variety of objectives as well as the risk factors into the model of the problem. Due to the fact that the model also takes into consideration the concept of Fuzzy set, it further allows management...
متن کامل