Link Prediction via Matrix Completion
نویسندگان
چکیده
Ratha Pech, Hao Dong1,2,∗, Liming Pan, Hong Cheng, Zhou Tao1,2,∗ 1 CompleX Lab, University of Electronic Science and Technology of China, Chengdu 611731, People’s Republic of China 2 Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 611731, People’s Republic of China and 3 Center for Robotics, University of Electronic Science and Technology of China, Chengdu 611731, People’s Republic of China
منابع مشابه
Log-Normal Matrix Completion for Large Scale Link Prediction
The ubiquitous proliferation of online social networks has led to the widescale emergence of relational graphs expressing unique patterns in link formation and descriptive user node features. Matrix Factorization and Completion have become popular methods for Link Prediction due to the low rank nature of mutual node friendship information, and the availability of parallel computer architectures...
متن کاملJoint Schatten p - norm and p - norm robust matrix completion for missing value recovery
The low-rank matrix completion problem is a fundamental machine learning and data mining problem with many important applications. The standard low-rank matrix completion methods relax the rank minimization problem by the trace norm minimization. However, this relaxation may make the solution seriously deviate from the original solution. Meanwhile, most completion methods minimize the squared p...
متن کاملپیشگویی پیوند در شبکه های اجتماعی با استفاده از ترکیب دسته بندی کننده ها
Abstract Link prediction in social networks is one of the most important activities in analysis of such networks. The importance of link prediction in social networks is due to its dynamic nature. While members and their relationships (links) in such networks are continuously increasing, links may be missed due to various reasons. By predicting such links, the possibility of extension, compl...
متن کاملA perturbation-based framework for link prediction via non-negative matrix factorization
Many link prediction methods have been developed to infer unobserved links or predict latent links based on the observed network structure. However, due to network noises and irregular links in real network, the performances of existed methods are usually limited. Considering random noises and irregular links, we propose a perturbation-based framework based on Non-negative Matrix Factorization ...
متن کاملClimate Prediction via Matrix Completion
Recently, machine learning has been applied to the problem of predicting future climates, informed by the multi-model ensemble of physics-based climate models that inform the Intergovernmental Panel on Climate Change (IPCC). Past work (Monteleoni et al., 2011, McQuade and Monteleoni, 2012) demonstrated the promise of online learning algorithms applied to this problem. Here we propose a novel ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1606.06812 شماره
صفحات -
تاریخ انتشار 2016