C++ program that implements Feitelson's weighted clique algorithm.
This is a C++ program to implement Dror G. Feitelson's weighted clique algorithm described in On identifying name equivalences in digital libraries Information Research, 9(4) paper 192. For more details see Equivalent author names.
The program uses the Graph Template Library (GTL) which is available from http://www.fim.uni-passau.de/fileadmin/files/lehrstuhl/brandenburg/projekte/gtl/GTL-1.2.4-lgpl.tar.gz
If you are building from this repository you will need to do the standard things:
- aclocal
- autoconf
- automake
- ./configure
- make
The examples folder contains a example graph:
Running the program on this graph
- equivalent examples/abc.gml
outputs the clusters in JSON. Each cluster contains the names of the nodes in that cluster.
{
"clusters":[
[ "A B C", "Abe Bob C", "Abe B" ],
[ "Ace D E", "A D" ],
[ "Abe F G" ],[ "A" ]]
}