Research topic: Explore the interpersonal relationship network in Harry Potter • Data collection scrap the data from book 1 to book 7 . • Edge: Based on the co-occurrence of the characters. If two characters appear at the same paragraph, we add up an edge between two nodes, such as name1-name2. Besides, its weight equals to 1. After that, if this co-occurrence appear again, the weight will be plus 1. The rest can be done in the same manner until finding out all the interpersonal relationship network. ...