can this model work for graphs without lables?
marasilence opened this issue · 4 comments
marasilence commented
can this model work for graphs without lables?
benedekrozemberczki commented
You can use structural properties of nodes (log binned degree, clustering
coefficient etc.).
…On Mon, 11 Mar 2019 at 12:22, marasilence ***@***.***> wrote:
—
You are receiving this because you are subscribed to this thread.
Reply to this email directly, view it on GitHub
<#2>, or mute the
thread
<https://github.com/notifications/unsubscribe-auth/AQk2F2Af1aaN1jlMEVLc_jM70M5w4ov1ks5vVkqUgaJpZM4boeSh>
.
marasilence commented
Thanks For your work and your help. How about graphs without node features and labels?I have just adjacency matrix ,can I set all node features as 1?
benedekrozemberczki commented
No. You can calculate the above mentioned node properties based on the
adjacency matrix.
…On Mon, 11 Mar 2019 at 12:29, marasilence ***@***.***> wrote:
Thanks For your work and your help. How about graphs without node features
and labels?I have just adjacency matrix ,can I set all node features as 1?
—
You are receiving this because you commented.
Reply to this email directly, view it on GitHub
<#2 (comment)>,
or mute the thread
<https://github.com/notifications/unsubscribe-auth/AQk2F7TKgwofoblMymB8DT-ZWnhgSk21ks5vVkwkgaJpZM4boeSh>
.
marasilence commented
Thanks! @benedekrozemberczki