Robust Graph Factorization for Multivariate Electricity Consumption Series Clustering

Multivariate electricity consumption series clustering can reflect trends of power consumption changes in the past time period, which can provide reliable guidance for electricity production. However, there are some abnormal series in the past multivariate electricity consumption series data, while outliers will affect the discovery of electricity consumption trends in different time periods. To address this problem, we propose a robust graph factorization model for multivariate electricity consumption clustering (RGF-MEC), which performs graph factorization and outlier discovery simultaneously. RGF-MEC first obtains a similarity graph by calculating distance among multivariate electricity consumption series data and then performs robust matrix factorization on the similarity graph. Meanwhile, the similarity graph is decomposed into a class-related embedding and a spectral embedding, where the class-related embedding directly reveals the final clustering results. Experimental results on realistic multivariate time-series datasets and multivariate electricity consumption series datasets demonstrate effectiveness of the proposed RGF-MEC model.

Improved queue-size scaling for input-queued switches via graph factorization

This paper studies the scaling of the expected total queue size in an $n\times n$ input-queued switch, as a function of both the load $\rho$ and the system scale n. We provide a new class of scheduling policies under which the expected total queue size scales as $O\big( n(1-\rho)^{-4/3} \log \big(\!\max\big\{\frac{1}{1-\rho}, n\big\}\big)\big)$, over all n and $\rho<1$, when the arrival rates are uniform. This improves on the best previously known scalings in two regimes: $O\big(n^{1.5}(1-\rho)^{-1} \log \frac{1}{1-\rho}\big)$ when $\Omega\big(n^{-1.5}\big) \le 1-\rho \le O\big(n^{-1}\big)$ and $O\big(\frac{n\log n}{(1-\rho)^2}\big)$ when $1-\rho \geq \Omega(n^{-1})$. A key ingredient in our method is a tight characterization of the largest k-factor of a random bipartite multigraph, which may be of independent interest.

A learning based framework for diverse biomolecule relationship prediction in molecular association network

Abundant life activities are maintained by various biomolecule relationships in human cells. However, many previous computational models only focus on isolated objects, without considering that cell is a complete entity with ample functions. Inspired by holism, we constructed a Molecular Associations Network (MAN) including 9 kinds of relationships among 5 types of biomolecules, and a prediction model called MAN-GF. More specifically, biomolecules can be represented as vectors by the algorithm called biomarker2vec which combines 2 kinds of information involved the attribute learned by k-mer, etc and the behavior learned by Graph Factorization (GF). Then, Random Forest classifier is applied for training, validation and test. MAN-GF obtained a substantial performance with AUC of 0.9647 and AUPR of 0.9521 under 5-fold Cross-validation. The results imply that MAN-GF with an overall perspective can act as ancillary for practice. Besides, it holds great hope to provide a new insight to elucidate the regulatory mechanisms.