# FONDUE: A Framework for Node Disambiguation and Deduplication Using Network Embeddings +
## 4 Experiments
### Node Disambiguation
#### 4.2.1 Data Processing  
Before conducting the experiments, the processing of the data to generate semi-synthetic networks was needed. This was completed by contracting each of the thirteen datasets mentioned in Table 2. More specifically, for each network \(\mathcal{G}=(V,E)\), a graph contraction was performed to create a contracted graph \(\hat{\mathcal{G}}=(\hat{V},\hat{E})\) (ambiguous) by randomly merging a fraction \(r\) of total number of nodes, to create a ground truth to test our proposed method. This is completed by first specifying the fraction of the nodes in the graph to be contracted (\(r\in\{0.001,0.01,0.1\}\)), and then sampling two sets of vertices, \(\hat{V}^{i}\subset\hat{V}\) and \(\hat{V}^{j}\subset\hat{V}\), such that \(|\hat{V}^{i}|=|\hat{V}^{j}|=[r\cdot|\hat{V}|]\) and \(\hat{V}^{i}\cap\hat{V}^{j}=\emptyset\). Then, every vertex \(v_{j}\in\hat{V}^{j}\) is merged with the corresponding vertex \(v_{i}\in\hat{V}^{j}\) by reassigning the links connected to \(v_{j}\) to \(v_{i}\) and removing \(v_{j}\) from the network. The node-pairs \((v_{i},v_{j})\) later serve as ground truths. We have also tested the case where the set of the candidate contracted vertices have no common neighbors (instead of a uniform selection at random). This mimics some types of social networks where two authors that share the same name, often their ego-networks do not intersect. Further analysis of the PubMed dataset Table 1, revealed that none of the ambiguous nodes shared edges with the neighbors of another ambiguous node. We have tested the performance of FONDUE-NDA, as well as that of the competing methods listed in the following section, on fourteen different datasets listed in Table 1, with their properties shown in Table 2. \begin{table}
\begin{tabular}{c c} \hline \hline
**Datasets** & **Description** \\ \hline \multirow{2}{*}{**FB-SC**} & Facebook Social Circles network [29] \\  & Consists of anonymized friends list from Facebook. \\ \hline \multirow{4}{*}{**FB-PP**} & Page-Page graph of verified Facebook pages [29]. \\  & Nodes represent official Facebook pages while the \\  & links are mutual likes between pages. \\ \hline \multirow{4}{*}{**email**} & Anonymized network generated using email data from a large \\  & European research institution modeling the incoming and \\  & outgoing email exchange between its members [29]. \\ \hline \multirow{4}{*}{**STD**} & A database network of the Computer Science department of the \\  & University of Antwerp that represent the connections between students, \\  & professors and courses [30]. \\ \hline \multirow{2}{*}{**PPI**} & A subnetwork of the BioGRID Interaction Database \\  & [31], that uses PPI network for Homo Sapiens. \\ \hline \multirow{2}{*}{**lesmis**} & A network depicting the coappearance of characters in \\  & the novel Les Miserables [32]. \\ \hline \multirow{2}{*}{**netscience**} & A coauthorship network of scientists working on network theory and \\  & experiments [29]. \\ \hline \multirow{4}{*}{**polbooks**} & Network of books about US politics, with edges between books \\  & representing frequent coprunchasing of books by the same buyers. \\  & [[http://www-personal.umich.edu/](http://www-personal.umich.edu/)]([http://www-personal.umich.edu/](http://www-personal.umich.edu/))\textasciitif/~mejn/netdata/, accessed on 20 October 2021 \\ \hline \multirow{2}{*}{**CondMat**} & Collaboration network of Arxiv Condensed Matter Physics [33] \\ \hline \multirow{2}{*}{**GrQc**} & Collaboration network of Arxiv General Relativity [33] \\ \hline \multirow{2}{*}{**HepTh**} & Collaboration network of Arxiv Theoretical High Energy Physics [33] \\ \hline \multirow{2}{*}{**CM03**} & Collaboration network of Arxiv Condensed Matter till 2003 [33] \\ \hline \multirow{2}{*}{**PubMed**} & Collaboration network extracted from the PubMed database (analyzed in \\  & Appendix A), containing 2122 nodes with ground truth of 31 ambiguous nodes (6 of which maps to more than 2 entities) and 1 duplicate node [1] \\ \hline \hline \end{tabular}
\end{table}