rdmpage / weighted-clique

Feitelson's weighted clique algorithm

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

weighted-clique

C++ program that implements Feitelson's weighted clique algorithm.

Overview

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.

Dependencies

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

Building

If you are building from this repository you will need to do the standard things:

  • aclocal
  • autoconf
  • automake
  • ./configure
  • make

Example

The examples folder contains a example graph:

Example

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" ]]
}

About

Feitelson's weighted clique algorithm

License:Other


Languages

Language:C++ 51.7%Language:HTML 33.9%Language:C 10.5%Language:CSS 1.8%Language:Perl 1.4%Language:Makefile 0.4%Language:M4 0.3%