{"action":"created","issue":{"url":"https://api.github.com/repos/godai0519/BayesianNetwork/issues/17","labels_url":"https://api.github.com/repos/godai0519/BayesianNetwork/issues/17/labels{/name}","comments_url":"https://api.github.com/repos/godai0519/BayesianNetwork/issues/17/comments","events_url":"https://api.github.com/repos/godai0519/BayesianNetwork/issues/17/events","html_url":"https://github.com/godai0519/BayesianNetwork/issues/17","id":74233674,"number":17,"title":"確率的枝刈り・階層的クラスタリングについてのBugfix","user":{"login":"godai0519","id":927025,"avatar_url":"https://avatars.githubusercontent.com/u/927025?v=3","gravatar_id":"","url":"https://api.github.com/users/godai0519","html_url":"https://github.com/godai0519","followers_url":"https://api.github.com/users/godai0519/followers","following_url":"https://api.github.com/users/godai0519/following{/other_user}","gists_url":"https://api.github.com/users/godai0519/gists{/gist_id}","starred_url":"https://api.github.com/users/godai0519/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/godai0519/subscriptions","organizations_url":"https://api.github.com/users/godai0519/orgs","repos_url":"https://api.github.com/users/godai0519/repos","events_url":"https://api.github.com/users/godai0519/events{/privacy}","received_events_url":"https://api.github.com/users/godai0519/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":3,"created_at":"2015-05-08T05:12:00Z","updated_at":"2015-05-08T05:57:49Z","closed_at":null,"body":"・枝刈り確率p1の計算式Iは，全てのノード間についての平均．\r\n・1つ繋がっている場合の枝刈り確率p2の計算式について，他ノードと繋がっている側の類似度を使用する．\r\n・群平均法について，ノード数で割っていない可能性\r\n"},"comment":{"url":"https://api.github.com/repos/godai0519/BayesianNetwork/issues/comments/100109357","html_url":"https://github.com/godai0519/BayesianNetwork/issues/17#issuecomment-100109357","issue_url":"https://api.github.com/repos/godai0519/BayesianNetwork/issues/17","id":100109357,"user":{"login":"godai0519","id":927025,"avatar_url":"https://avatars.githubusercontent.com/u/927025?v=3","gravatar_id":"","url":"https://api.github.com/users/godai0519","html_url":"https://github.com/godai0519","followers_url":"https://api.github.com/users/godai0519/followers","following_url":"https://api.github.com/users/godai0519/following{/other_user}","gists_url":"https://api.github.com/users/godai0519/gists{/gist_id}","starred_url":"https://api.github.com/users/godai0519/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/godai0519/subscriptions","organizations_url":"https://api.github.com/users/godai0519/orgs","repos_url":"https://api.github.com/users/godai0519/repos","events_url":"https://api.github.com/users/godai0519/events{/privacy}","received_events_url":"https://api.github.com/users/godai0519/received_events","type":"User","site_admin":false},"created_at":"2015-05-08T05:57:49Z","updated_at":"2015-05-08T05:57:49Z","body":">・1つ繋がっている場合の枝刈り確率p2の計算式について，他ノードと繋がっている側の類似度を使用する．\r\n\r\n繋がっていた類似度をconnectionに突っ込んで，\r\nそのsizeが1の時に入るp2の中で，\r\nconnection[0]を見てるんだから解消してるな？"}}