Automatic Metapath Generating In Heterogeneous Graphs for Representation Learning

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Beiranvand Azadeh; Nadali Maryam; Takhtkesh Arefeh; Vahidipour Mehdi

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2024 | Issue:10

Download Full-Text

View:

Download:

Information Seminar Paper

Title

Automatic Metapath Generating In Heterogeneous Graphs for Representation Learning

Author(s)

Beiranvand Azadeh | Nadali Maryam | Takhtkesh Arefeh | Vahidipour Mehdi

Keywords

Network embedding

Heterogeneous Representation learning

Latent Representations

random walk

metapath scheme

Abstract

In this article, the problem of learning representation in heterogeneous graphs is investigated. Due to the presence of different types of nodes and edges in this type of graphs, there are unique challenges that limit the possibility of using conventional graph representation techniques. The way of random walk in this type of graphs is different and they need a walking scheme or metapath to find the path. Specifying this scheme is one of the challenges of learning representation in heterogeneous graphs. In this article, an algorithm has been introduced that finds all possible metapath schema by taking an heterogeneous graph and finds the best metapath scheme by specifying the correct schema and checking them. Various experiments show that with a small sampling of the network in the form of short length, the most suitable scheme can be found automatically and it is shown that by changing the sampling size, the selected scheme is the best scheme and in terms of time only Runs in 0. 007% of the time using long random walks.

Cites

No record.

References

No record.

Cite

APA: Copy

Beiranvand, Azadeh, Nadali, Maryam, Takhtkesh, Arefeh, & Vahidipour, Mehdi. (2024). Automatic Metapath Generating In Heterogeneous Graphs for Representation Learning. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/1147644/en

Vancouver: Copy

Beiranvand Azadeh, Nadali Maryam, Takhtkesh Arefeh, Vahidipour Mehdi. Automatic Metapath Generating In Heterogeneous Graphs for Representation Learning. 2024. Available from: https://sid.ir/paper/1147644/en

IEEE: Copy

Azadeh Beiranvand, Maryam Nadali, Arefeh Takhtkesh, and Mehdi Vahidipour, “Automatic Metapath Generating In Heterogeneous Graphs for Representation Learning,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2024, [Online]. Available: https://sid.ir/paper/1147644/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops