Future Plans

1.

Finding a faster implementation of the min-cut algorithm (for example [7]).

2.

Improving the algorithm by attempting to find maximal highly connected subgraphs (for example [9]) with a minimal complexity damage.

3.

Trying a different similarity scoring.

4.

Trying different objective functions.

5.

Finding ways for measuring solution quality when the true clustering is unknown.

6.

Using cluster fingerprint to find database matches.

7.

Use the HCC clustering in other contexts.