Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
networkx-discuss
Home
+ new post
About this group
Join this group
propagation algorithm
Options
There are currently too many topics in this group that display first. To make this topic appear first, remove this option from another topic.
There was an error processing your request. Please try again.
flag
   1 message - Collapse all  -  Translate all to Translated (View all originals)
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Goog Cheng  
View profile  
 More options Sep 12 2012, 9:24 am
From: Goog Cheng <googch...@gmail.com>
Date: Wed, 12 Sep 2012 21:24:54 +0800
Local: Wed, Sep 12 2012 9:24 am
Subject: propagation algorithm
Print | Individual message | Show original | Report this message | Find messages by this author

Hi,pal! I wanna use networkx to calculate the sentiment strength of a
wordnet by a propagation algorithm(it seems to be belief
propagation),but didnt get a good result. Is there a problem of my
implement?Any guidance would be greatly appreciated.

here is my code :
/#init the strength //
//for n in DG://
//    if DG.in_degree(n)==0://
//        if dictpos.get(n.encode('utf8'))://
//            DG.node[n]['s'] = 1//
//        else://
//            DG.node[n]['s'] = -1//
//    else://
//        DG.node[n]['s']=0//
//#iter 12 times//
//for i in range(12)://
//    maxs=0//
//    for n in DG://
//        if DG.in_degree(n)==0://
//            continue//
//        else://
//            neighbors=DG.predecessors(n)//
//            for nb in neighbors: //
//                w=DG[nb][n]['weight'] /
DG.out_degree(nb,weight='weight')//
//                DG.node[n]['s']+=w*DG.node[nb]['s']//
//            if abs(DG.node[n]['s'])>maxs://
//                maxs=abs(DG.node[n]['s'])//
//    #normalize the strength//
//    for n in DG://
//        DG.node[n]['s']/=maxs/


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
End of messages
« Back to Discussions « Newer topic     Older topic »

Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2013 Google