Network Representation Based on the Joint Learning of Three Feature Views
Network representation learning plays an important role in the field of network data mining. By embedding network structures and other features into the representation vector space of low dimensions, network representation learning algorithms can provide high-quality feature input for subsequent tas...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tsinghua University Press
2019-12-01
|
| Series: | Big Data Mining and Analytics |
| Subjects: | |
| Online Access: | https://www.sciopen.com/article/10.26599/BDMA.2019.9020009 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832572789164343296 |
|---|---|
| author | Zhonglin Ye Haixing Zhao Ke Zhang Zhaoyang Wang Yu Zhu |
| author_facet | Zhonglin Ye Haixing Zhao Ke Zhang Zhaoyang Wang Yu Zhu |
| author_sort | Zhonglin Ye |
| collection | DOAJ |
| description | Network representation learning plays an important role in the field of network data mining. By embedding network structures and other features into the representation vector space of low dimensions, network representation learning algorithms can provide high-quality feature input for subsequent tasks, such as network link prediction, network vertex classification, and network visualization. The existing network representation learning algorithms can be trained based on the structural features, vertex texts, vertex tags, community information, etc. However, there exists a lack of algorithm of using the future evolution results of the networks to guide the network representation learning. Therefore, this paper aims at modeling the future network evolution results of the networks based on the link prediction algorithm, introducing the future link probabilities between vertices without edges into the network representation learning tasks. In order to make the network representation vectors contain more feature factors, the text features of the vertices are also embedded into the network representation vectors. Based on the above two optimization approaches, we propose a novel network representation learning algorithm, Network Representation learning algorithm based on the joint optimization of Three Features (TFNR). Based on Inductive Matrix Completion (IMC), TFNR algorithm introduces the future probabilities between vertices without edges and text features into the procedure of modeling network structures, which can avoid the problem of the network structure sparse. Experimental results show that the proposed TFNR algorithm performs well in network vertex classification and visualization tasks on three real citation network datasets. |
| format | Article |
| id | doaj-art-17467e93b7e742eb9d88c196f9151a07 |
| institution | Kabale University |
| issn | 2096-0654 |
| language | English |
| publishDate | 2019-12-01 |
| publisher | Tsinghua University Press |
| record_format | Article |
| series | Big Data Mining and Analytics |
| spelling | doaj-art-17467e93b7e742eb9d88c196f9151a072025-02-02T06:50:16ZengTsinghua University PressBig Data Mining and Analytics2096-06542019-12-012424826010.26599/BDMA.2019.9020009Network Representation Based on the Joint Learning of Three Feature ViewsZhonglin Ye0Haixing Zhao1Ke Zhang2Zhaoyang Wang3Yu Zhu4<institution content-type="dept">Key Laboratory of Tibetan Information Processing, the College of Computer</institution>, <institution>Qinghai Normal University</institution>, <city>Xining</city> <postal-code>810008</postal-code>, <country>China</country>.<institution content-type="dept">Key Laboratory of Tibetan Information Processing, the College of Computer</institution>, <institution>Qinghai Normal University</institution>, <city>Xining</city> <postal-code>810008</postal-code>, <country>China</country>.<institution content-type="dept">Key Laboratory of Tibetan Information Processing, the College of Computer</institution>, <institution>Qinghai Normal University</institution>, <city>Xining</city> <postal-code>810008</postal-code>, <country>China</country>.<institution content-type="dept">College of Mathematics and Statistics</institution>, <institution>Qinghai Normal University</institution>, <city>Xining</city> <postal-code>810008</postal-code>, <country>China</country>.<institution content-type="dept">Key Laboratory of Tibetan Information Processing, the College of Computer</institution>, <institution>Qinghai Normal University</institution>, <city>Xining</city> <postal-code>810008</postal-code>, <country>China</country>.Network representation learning plays an important role in the field of network data mining. By embedding network structures and other features into the representation vector space of low dimensions, network representation learning algorithms can provide high-quality feature input for subsequent tasks, such as network link prediction, network vertex classification, and network visualization. The existing network representation learning algorithms can be trained based on the structural features, vertex texts, vertex tags, community information, etc. However, there exists a lack of algorithm of using the future evolution results of the networks to guide the network representation learning. Therefore, this paper aims at modeling the future network evolution results of the networks based on the link prediction algorithm, introducing the future link probabilities between vertices without edges into the network representation learning tasks. In order to make the network representation vectors contain more feature factors, the text features of the vertices are also embedded into the network representation vectors. Based on the above two optimization approaches, we propose a novel network representation learning algorithm, Network Representation learning algorithm based on the joint optimization of Three Features (TFNR). Based on Inductive Matrix Completion (IMC), TFNR algorithm introduces the future probabilities between vertices without edges and text features into the procedure of modeling network structures, which can avoid the problem of the network structure sparse. Experimental results show that the proposed TFNR algorithm performs well in network vertex classification and visualization tasks on three real citation network datasets.https://www.sciopen.com/article/10.26599/BDMA.2019.9020009network representation learningnetwork feature miningembedding learninglink predictionmatrix factorization |
| spellingShingle | Zhonglin Ye Haixing Zhao Ke Zhang Zhaoyang Wang Yu Zhu Network Representation Based on the Joint Learning of Three Feature Views Big Data Mining and Analytics network representation learning network feature mining embedding learning link prediction matrix factorization |
| title | Network Representation Based on the Joint Learning of Three Feature Views |
| title_full | Network Representation Based on the Joint Learning of Three Feature Views |
| title_fullStr | Network Representation Based on the Joint Learning of Three Feature Views |
| title_full_unstemmed | Network Representation Based on the Joint Learning of Three Feature Views |
| title_short | Network Representation Based on the Joint Learning of Three Feature Views |
| title_sort | network representation based on the joint learning of three feature views |
| topic | network representation learning network feature mining embedding learning link prediction matrix factorization |
| url | https://www.sciopen.com/article/10.26599/BDMA.2019.9020009 |
| work_keys_str_mv | AT zhonglinye networkrepresentationbasedonthejointlearningofthreefeatureviews AT haixingzhao networkrepresentationbasedonthejointlearningofthreefeatureviews AT kezhang networkrepresentationbasedonthejointlearningofthreefeatureviews AT zhaoyangwang networkrepresentationbasedonthejointlearningofthreefeatureviews AT yuzhu networkrepresentationbasedonthejointlearningofthreefeatureviews |