Identifying overlapping communities as well as hubs and outliers via nonnegative matrix factorization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ERRATUM: Identifying overlapping communities as well as hubs and outliers via nonnegative matrix factorization

Community detection is important for understanding networks. Previous studies observed that communities are not necessarily disjoint and might overlap. It is also agreed that some outlier vertices participate in no community, and some hubs in a community might take more important roles than others. Each of these facts has been independently addressed in previous work. But there is no algorithm,...

متن کامل

Supplemental Material for “ Online Nonnegative Matrix Factorization with Outliers ”

In this supplemental material, the indices of all the sections, definitions, lemmas and equations are prepended with an ‘S’ to distinguish those in the main text. The organization of this article is as follows. In section S-1, we drive the ADMM algorithms presented in Section IV-B. In Section S-2, we extend our two solvers (based on PGD and ADMM) in Section IV to the batch NMF problems with out...

متن کامل

Illumination estimation via nonnegative matrix factorization

The problem of illumination estimation for color constancy and automatic white balancing of digital color imagery can be viewed as the separation of the image into illumination and reflectance components. We propose using nonnegative matrix factorization with sparseness constraints to separate these components. Since illumination and reflectance are combinedmultiplicatively, the first step is t...

متن کامل

Approximate Nonnegative Matrix Factorization via Alternating Minimization

In this paper we consider the Nonnegative Matrix Factorization (NMF) problem: given an (elementwise) nonnegative matrix V ∈ R + find, for assigned k, nonnegative matrices W ∈ R + and H ∈ R k×n + such that V = WH . Exact, non trivial, nonnegative factorizations do not always exist, hence it is interesting to pose the approximate NMF problem. The criterion which is commonly employed is I-divergen...

متن کامل

Quantized nonnegative matrix factorization

Even though Nonnegative Matrix Factorization (NMF) in its original form performs rank reduction and signal compaction implicitly, it does not explicitly consider storage or transmission constraints. We propose a Frobenius-norm Quantized Nonnegative Matrix Factorization algorithm that is 1) almost as precise as traditional NMF for decomposition ranks of interest (with in 1-4dB), 2) admits to pra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Reports

سال: 2013

ISSN: 2045-2322

DOI: 10.1038/srep02993