6,813 research outputs found
Embedding Representation of Academic Heterogeneous Information Networks Based on Federated Learning
Academic networks in the real world can usually be portrayed as heterogeneous
information networks (HINs) with multi-type, universally connected nodes and
multi-relationships. Some existing studies for the representation learning of
homogeneous information networks cannot be applicable to heterogeneous
information networks because of the lack of ability to issue heterogeneity. At
the same time, data has become a factor of production, playing an increasingly
important role. Due to the closeness and blocking of businesses among different
enterprises, there is a serious phenomenon of data islands. To solve the above
challenges, aiming at the data information of scientific research teams closely
related to science and technology, we proposed an academic heterogeneous
information network embedding representation learning method based on federated
learning (FedAHE), which utilizes node attention and meta path attention
mechanism to learn low-dimensional, dense and real-valued vector
representations while preserving the rich topological information and
meta-path-based semantic information of nodes in network. Moreover, we combined
federated learning with the representation learning of HINs composed of
scientific research teams and put forward a federal training mechanism based on
dynamic weighted aggregation of parameters (FedDWA) to optimize the node
embeddings of HINs. Through sufficient experiments, the efficiency, accuracy
and feasibility of our proposed framework are demonstrated
Optimization flow control -- I: Basic algorithm and convergence
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algorithm. In this system, sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial, and time varying, and links and sources to update at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly time-varying environment. We discuss its fairness property
- …