{"action":"closed","issue":{"url":"https://api.github.com/repos/adolenc/topotext/issues/1","repository_url":"https://api.github.com/repos/adolenc/topotext","labels_url":"https://api.github.com/repos/adolenc/topotext/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/adolenc/topotext/issues/1/comments","events_url":"https://api.github.com/repos/adolenc/topotext/issues/1/events","html_url":"https://github.com/adolenc/topotext/issues/1","id":156978233,"number":1,"title":"tf-idf code","user":{"login":"RokIvansek","id":7573391,"avatar_url":"https://avatars.githubusercontent.com/u/7573391?v=3","gravatar_id":"","url":"https://api.github.com/users/RokIvansek","html_url":"https://github.com/RokIvansek","followers_url":"https://api.github.com/users/RokIvansek/followers","following_url":"https://api.github.com/users/RokIvansek/following{/other_user}","gists_url":"https://api.github.com/users/RokIvansek/gists{/gist_id}","starred_url":"https://api.github.com/users/RokIvansek/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/RokIvansek/subscriptions","organizations_url":"https://api.github.com/users/RokIvansek/orgs","repos_url":"https://api.github.com/users/RokIvansek/repos","events_url":"https://api.github.com/users/RokIvansek/events{/privacy}","received_events_url":"https://api.github.com/users/RokIvansek/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2016-05-26T13:01:28Z","updated_at":"2016-05-31T12:05:15Z","closed_at":"2016-05-31T12:05:15Z","body":"Change and upload the code for calculating the tf-idf matrix.\r\n\r\nIt should accept an array of string arrays, where one row represents one text. Obviously rows will be of different lenghts.\r\n\r\nIt will return an tf-idf matrix (mxn) where m is the number of samples and n is the number of words selected as features."}}
{"actor":{"display_login":"RokIvansek"}}