Goto

Collaborating Authors

 hypergraph


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. We prove that inhomogeneous partitioning produces a quadratic approximation to the optimal solution if the inhomogeneous costs satisfy submodularity constraints. Moreover, we demonstrate that inhomogenous partitioning offers significant performance improvements in applications such as structure learning of rankings, subspace segmentation and motif clustering.



41bacf567aefc61b3076c74d8925128f-Paper.pdf

Neural Information Processing Systems

Hypergraphs are important objects to model ternary or higher-order relations of objects, and haveanumber ofapplications inanalysing manycomplexdatasets occurring in practice.


Assembly Fuzzy Representation on Hypergraph for Open-Set 3D Object Retrieval Y ang Xu

Neural Information Processing Systems

The lack of object-level labels presents a significant challenge for 3D object retrieval in the open-set environment. However, part-level shapes of objects often share commonalities across categories but remain underexploited in existing retrieval methods. In this paper, we introduce the Hypergraph-Based Assembly Fuzzy Representation (HAFR) framework, which navigates the intricacies of open-set 3D object retrieval through a bottom-up lens of Part Assembly .