Graph attribute aggregation method based on feature Engineering
By: Wang, Hao
.
Contributor(s): Dong, Li-Yan.
Publisher: New York Springer 2022Edition: Vol.103(3), June.Description: 711-719p.Subject(s): Humanities and Applied SciencesOnline resources: Click here
In:
Journal of the institution of engineers (India): Series BSummary: In the fields of social network analysis and knowledge graph, many semi-supervised learning algorithms based on graph convolutional neural network (GCN) have been widely used. Most of these algorithms usually improve the structure of the neural network and the sampling method of each layer of the neural network. However, they don’t pay much attention to the data pre-processing of the algorithm. In the analysis of the input data, the words of different quality in these original data are unevenly distributed. This may obscure some useful data and highlight some irrelevant data. In order to verify the correctness of this hypothesis, the paper proposes a feature matrix compression algorithm (FMC algorithm) for data pre-processing of GCN-based algorithms. The algorithm analyzes and arranges the word columns of the input matrix (the feature of graph) according to the frequency of the word, then merges those words in which the word frequency is smaller, so as to emphasize the role of these words in the graph and optimize the data scale. The present work uses four mainstream datasets in the field and several representative and different algorithms to complete the experiment. The experimental results show that the FMC algorithm achieves better performance.
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Articles Abstract Database
|
School of Engineering & Technology Archieval Section | Not for loan | 2022-1290 |
In the fields of social network analysis and knowledge graph, many semi-supervised learning algorithms based on graph convolutional neural network (GCN) have been widely used. Most of these algorithms usually improve the structure of the neural network and the sampling method of each layer of the neural network. However, they don’t pay much attention to the data pre-processing of the algorithm. In the analysis of the input data, the words of different quality in these original data are unevenly distributed. This may obscure some useful data and highlight some irrelevant data. In order to verify the correctness of this hypothesis, the paper proposes a feature matrix compression algorithm (FMC algorithm) for data pre-processing of GCN-based algorithms. The algorithm analyzes and arranges the word columns of the input matrix (the feature of graph) according to the frequency of the word, then merges those words in which the word frequency is smaller, so as to emphasize the role of these words in the graph and optimize the data scale. The present work uses four mainstream datasets in the field and several representative and different algorithms to complete the experiment. The experimental results show that the FMC algorithm achieves better performance.
Click on an image to view it in the image viewer
There are no comments for this item.