Collaborating Authors

Consistency of Spectral Partitioning of Uniform Hypergraphs under Planted Partition Model

Neural Information Processing Systems

Spectral graph partitioning methods have received significant attention from both practitioners and theorists in computer science. Some notable studies have been carried out regarding the behavior of these methods for infinitely large sample size (von Luxburg et al., 2008; Rohe et al., 2011), which provide sufficient confidence to practitioners about the effectiveness of these methods. On the other hand, recent developments in computer vision have led to a plethora of applications, where the model deals with multi-way affinity relations and can be posed as uniform hyper-graphs. In this paper, we view these models as random m-uniform hypergraphs and establish the consistency of spectral algorithm in this general setting. We develop a planted partition model or stochastic blockmodel for such problems using higher order tensors, present a spectral technique suited for the purpose and study its large sample behavior.

Inhomogeneous Hypergraph Clustering with Applications

Neural Information Processing Systems

Hypergraph partitioning is an important problem in machine learning, computer vision and network analytics. A widely used method for hypergraph partitioning relies on minimizing a normalized sum of the costs of partitioning hyperedges across clusters. Algorithmic solutions based on this approach assume that different partitions of a hyperedge incur the same cost. However, this assumption fails to leverage the fact that different subsets of vertices within the same hyperedge may have different structural importance. We hence propose a new hypergraph clustering technique, termed inhomogeneous hypergraph partitioning, which assigns different costs to different hyperedge cuts.

Consistency of Spectral Hypergraph Partitioning under Planted Partition Model Machine Learning

Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of hypergraphs. However, theoretical aspects of such methods have seldom received attention in the literature as compared to the extensive studies on the guarantees of graph partitioning. For instance, consistency results of spectral graph partitioning under the stochastic block model are well known. In this paper, we present a planted partition model for sparse random non-uniform hypergraphs that generalizes the stochastic block model. We derive an error bound for a spectral hypergraph partitioning algorithm under this model using matrix concentration inequalities. To the best of our knowledge, this is the first consistency result related to partitioning non-uniform hypergraphs.


AAAI Conferences

We motivate and address the task of automatically solving shaded area geometry problems. Our approach consists of identifying atomic regions in a coordinate-based geometry figure, building an analysis hypergraph representing all facts that can be derived of the figure (using saturation based reasoning), and then finding a path in the hypergraph from the given facts to the goal. On a corpus of 102 problems taken from popular high-school geometry textbooks, our tool GeoShader successfully solved and characterized all problems in an average time of 13.4 seconds.

Generating Diagnoses from Conflict Sets

AAAI Conferences

Many techniques of finding possible diagnoses of faulty technical systems involve two sequential steps. First compute the collection of all minimal conflict sets, then transform the conflict sets into diagnoses. This paper addresses the second step of this procedure. We assume that the conflict sets are known and we present an efficient method of transforming conflict sets into diagnoses. The method is developed in a more general framework for the corresponding problem of computing hypergraph inversions.