This is a comprehensive introduction to the basic concepts, models, and applications of network representation learning (NRL) and the background and rise of network embeddings (NE) .
It introduces the development of NE techniques by presenting several representative methods on general graphs, as well as a unified NE framework based on matrix factorization.
Afterward, it presents the variants of NE with additional information: NE for graphs with node attributes/contents/labels; and the variants with different characteristics: NE for community-structured/large-scale/heterogeneous graphs.
Further, the book introduces different applications of NE such as recommendation and information diffusion prediction.
Finally, the book concludes the methods and applications and looks forward to the future directions.
Many machine learning algorithms require real-valued feature vectors of data instances as inputs.
By projecting data into vector spaces, representation learning techniques have achieved promising performance in many areas such as computer vision and natural language processing.
There is also a need to learn representations for discrete relational data, namely networks or graphs.
Network Embedding (NE) aims at learning vector representations for each node or vertex in a network to encode the topologic structure.
Due to its convincing performance and efficiency, NE has been widely applied in many network applications such as node classification and link prediction.
| Information | Ne for graphs with node attributescontentslabels |
|---|---|
| And the variants with different characteristics | Ne for communitystructuredlargescaleheterogeneous graphs |
Morgan & Claypool Network embedding: theories, methods, and applications, hardcover/cheng yang
