Before revision:  Our hypergraph objective is related to higher-order notions of modularity and normalized cut , and is amenable to approximation algorithms via hypergraph expansion techniques.
After revision:  Our hypergraph objective is related to higher-order notions of modularity and normalized cut , and is amenable to approximation algorithms via hyperedge expansion techniques.