Mixed Integer Programming for Searching Maximum Quasi-Bicliques

  title={Mixed Integer Programming for Searching Maximum Quasi-Bicliques},
  author={D. Ignatov and Polina Ivanova and Albina Zamaletdinova},
This paper is related to the problem of finding the maximal quasi-bicliques in a bipartite graph (bigraph). A quasi-biclique in the bigraph is its “almost” complete subgraph. The relaxation of completeness can be understood variously; here, we assume that the subgraph is a \(\gamma \)-quasi-biclique if it lacks a certain number of edges to form a biclique such that its density is at least \(\gamma \in (0,1]\). For a bigraph and fixed \(\gamma \), the problem of searching for the maximal quasi… 

Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach

The results show that the algorithm is up to four orders of magnitude faster than all baselines and finding MaxBPs works better than finding all MBPs for a fraud detection application and the NP-hardness of the problem is formally proved.

Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions

A thorough review of existing works of cohesive subgraph search over HINs is conducted, and the models and solutions in these works are analyzed and compared.

Large-scale Fake Click Detection for E-commerce Recommendation Systems

This work carried out pioneering work in analyzing and summarizing the characteristics of the false click information produced by attackers on the target products in the "Ride Item's Coattails" attack and designed a set of attack detection techniques suitable for e-commerce recommendation systems.

Efficient Algorithms for Maximal k-Biplex Enumeration

This paper adopts a reverse search framework called bTraversal, which corresponds to a depth-first search (DFS) procedure on an implicit solution graph on top of all maximal k-biplexes, and develops a series of techniques for improving and implementing this framework.



Fully dynamic quasi-biclique edge covers via Boolean matrix factorizations

The proposed algorithm for bi-adjacency matrix factorization is extended with the capability of working in fully dynamic setting (with both additions and deletions) and with capability of adjusting its rank dynamically, as well.

Near optimal solutions for maximum quasi-bicliques

A polynomial time approximation scheme is designed to give a quasi-biclique (Xa, Ya) for Xa ⊆ X and Ya⊆ Y with any vertex x ∈ Xa is incident to at least (1 - δ - e)|Ya| vertices in Ya and any vertex y ∈ Ya is incident for any e > 0, where Xopt and Yopt form the optimal solution.

On the maximum quasi-clique problem

Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs

New mixed integer programming (MIP) formulations for solving the maximumγ-quasi-clique problem are proposed and the corresponding linear programming (LP) relaxations are analyzed and shown to be tighter than the LP relaxations of the MIP models available in the literature on sparse graphs.

Searching maximum quasi-bicliques from protein-protein interaction network

A new and efficient method, Searching Quasi-Bicliques (SQB) algorithm, to detect maximum quasi-biclique from protein-protein interaction network is proposed and successfully applied on the Saccharomyces cerevisiae dataset.

Quasi-bicliques: Complexity and Binding Pairs

A heuristic algorithm is proposed which uses the greedy method to find the quasi-bicliques from PPI networks and has a better performance than a benchmark algorithm for identifying highly matched BLOCKS and PRINTS motifs.

Triadic Formal Concept Analysis and triclustering: searching for optimal patterns

This paper presents several definitions of “optimal patterns” in triadic data and results of experimental comparison of five triclustering algorithms on real-world and synthetic datasets and leads to a clear strategy for choosing a solution at a given dataset guided by the principle of Pareto-optimality.

Mining Maximal Quasi-Bicliques to Co-Cluster Stocks and Financial Ratios for Value Investment

An unsupervised process to co-cluster groups of stocks and financial ratios, so that investors can gain more insight on how they are correlated and develop a new algorithm that can efficiently enumerate maximal quasi-bicliques from an undirected graph.

Concept-Based Biclustering for Internet Advertisement

The paper contains experimental results on applying the proposed algorithm to contextual Internet advertisement data in comparison with some FCA algorithms and additional results on so-called morphological metarules for term recommendation task on the same data.

Massive Quasi-Clique Detection

We describe techniques that are useful for the detection of dense subgraphs (quasi-cliques) in massive sparse graphs whose vertex set, but not the edge set, fits in RAM. The algorithms rely on