Giter VIP home page Giter VIP logo

partial-optimality-in-cubic-correlation-clustering's Introduction

Code for the Paper "Partial Optimality in Cubic Correlation Clustering"

This is the code for Partial Optimality in Cubic Correlation Clustering, accepted at ICML'23.

Requirements

You need to have the BOOST Graph Library (BGL) installed. See here: https://www.boost.org/doc/libs/1_81_0/libs/graph/doc/index.html

How to build?

mkdir build
cd build
cmake -DCMAKE_BUILD_TYPE=RELEASE ..
make equilateral-triangles-persistency
make predefined-partition-persistency

./equilateral-triangles-persistency
./predefined-partition-persistency

How to run?

Depending on what problem instances you want to run, execute one of the following commands. Note, that we run the computation 30 times with different random seeds for each experiment.

Equilateral Triangle Instances / Geometric Instances

Joint Application

The default is to apply all our persistency conditions jointly to the instance of equilateral triangles with 45 nodes. For this default, run:

./equilateral-triangles-persistency -a

or

./equilateral-triangles-persistency --all

Alternatively, specify the number of elements of the geometric instance in the following way. Run

./equilateral-triangles-persistency -a <n>

where <n> should be replaced by a natural number greater or equal to 3. Here, <n> is a design parameter and leads to a geometric instance with a total of N= 9n - 9 elements, i.e. by default <n>=6.

Separate Application

The default is to apply all our persistency conditions separately to the instance of equilateral triangles with 45 nodes. Run:

./equilateral-triangles-persistency -i

or

./equilateral-triangles-persistency --individual

Alternatively, specify the number of elements of the geometric instance in the following way. Run

./equilateral-triangles-persistency -i <n>

where <n> should be replaced by a natural number greater or equal to 3. Here, <n> is a design parameter and leads to a geometric instance with a total of N= 9n - 9 elements, i.e. by default <n>=6.

Partition Instances

Joint Application

The default is to apply all our persistency conditions jointly to the partition instances with 48 nodes.

./predefined-partition-persistency -a

or

./predefined-partition-persistency --all

To specify the size of the instance run

./predefined-partition-persistency -a <n>

where <n> is a natural number and leads to an instance of the partition dataset with N = 8 <n> elements.

Separate Application

The default is to apply all our persistency conditions separately to the partition instances with 48 nodes.

./predefined-partition-persistency -i

or

./predefined-partition-persistency --individual

To specify the size of the instance run

./predefined-partition-persistency -i <n>

where <n> is a natural number and leads to an instance of the partition dataset with N = 8 <n> elements.

Other Configurations

If you want to try different configurations, you can change the parameters in the files in

  • ./src/equilateral-triangles/persistency.cxx
  • ./src/predefined-partition/persistency.cxx

Output

Joint Application

The output of the joint application of our partial optimality criteria is a directory named

  • partition_<numNodes>nodes_30seeds for the partition instances
  • equilateral_<numNodes>nodes_30seeds_30distanceOfCostZero_4sigma for the geometric instances

These contain the number of eliminated nodes/variables after each step of the joint application of our criteria.

Separate Application

The output of the separate application of our partial optimality criteria is a directory named

  • partition_individual_<numNodes>nodes_30seeds for the partition instances
  • equilateral_individual_<numNodes>nodes_30seeds_30distanceOfCostZero_4sigma for the geometric instances

These contain, for each partial optimality criterion, a .csv file containing the number eliminated nodes/variables.

partial-optimality-in-cubic-correlation-clustering's People

Contributors

dsteindd avatar

Watchers

 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.