{"action":"closed","issue":{"url":"https://api.github.com/repos/greenelab/hetmech/issues/74","repository_url":"https://api.github.com/repos/greenelab/hetmech","labels_url":"https://api.github.com/repos/greenelab/hetmech/issues/74/labels{/name}","comments_url":"https://api.github.com/repos/greenelab/hetmech/issues/74/comments","events_url":"https://api.github.com/repos/greenelab/hetmech/issues/74/events","html_url":"https://github.com/greenelab/hetmech/issues/74","id":297249985,"number":74,"title":"Next Steps","user":{"login":"zietzm","id":7230303,"avatar_url":"https://avatars1.githubusercontent.com/u/7230303?v=4","gravatar_id":"","url":"https://api.github.com/users/zietzm","html_url":"https://github.com/zietzm","followers_url":"https://api.github.com/users/zietzm/followers","following_url":"https://api.github.com/users/zietzm/following{/other_user}","gists_url":"https://api.github.com/users/zietzm/gists{/gist_id}","starred_url":"https://api.github.com/users/zietzm/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/zietzm/subscriptions","organizations_url":"https://api.github.com/users/zietzm/orgs","repos_url":"https://api.github.com/users/zietzm/repos","events_url":"https://api.github.com/users/zietzm/events{/privacy}","received_events_url":"https://api.github.com/users/zietzm/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":1,"created_at":"2018-02-14T21:23:21Z","updated_at":"2018-05-17T18:25:43Z","closed_at":"2018-05-17T18:25:43Z","author_association":"COLLABORATOR","body":"@dhimmel I have been thinking about what we discussed regarding the unsupervised approaches we could use in the future. If I understand roughly correctly, what we want to do is implement a system which determines the metapaths showing significant differences from random (permuted) networks, but doing this for all metapaths (of a certain length) in the graph. \r\n\r\nIt seems like this should be a two-step process, starting with computing DWPC matrices for all the metapaths of a certain length, and doing this a certain number of times, on various permuted networks. All this information would need to be stored for the next step.\r\n\r\nThis is where I reach the edge of my current knowledge. We will have several matrices for each metapath, with one as the actual values and the others as \"controls\". I'm not sure how we would go about comparing these matrices with one another. We want to do this without having the actual data, as was done with Rephetio.\r\n\r\nWhere should I start? Do you think that hetmech is the best place for this work, or should we make a new repository for the implementation part of this project? Should the matrices be stored on GitHub? "}}
{"actor":{"display_login":"dhimmel"}}