Multilevel hypergraph partitioning: application in VLSI domain
DAC '97 Proceedings of the 34th annual Design Automation Conference
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions
The Journal of Machine Learning Research
Semi-supervised graph clustering: a kernel approach
ICML '05 Proceedings of the 22nd international conference on Machine learning
Learning from labeled and unlabeled data on a directed graph
ICML '05 Proceedings of the 22nd international conference on Machine learning
Higher order learning with graphs
ICML '06 Proceedings of the 23rd international conference on Machine learning
The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks
Proceedings of the 24th international conference on Machine learning
A tutorial on spectral clustering
Statistics and Computing
Hypergraph spectral learning for multi-label classification
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Constructing isospectral non-isomorphic digraphs from hypergraphs
Journal of Graph Theory
Graph cut based inference with co-occurrence statistics
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Semi-Supervised Classification of Network Data Using Very Few Labels
ASONAM '10 Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining
An algorithm for finding minimum d-separating sets in belief networks
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Multi-way clustering using super-symmetric non-negative tensor factorization
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part IV
Computing minimum multiway cuts in hypergraphs from hypertree packings
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Understanding and improving relational matrix factorization in recommender systems
Proceedings of the 7th ACM conference on Recommender systems
Proceedings of the 6th International Conference on Security of Information and Networks
| Hi-index | 0.00 |
We propose a new formulation called hyperedge expansion (HE) for hypergraph learning. The HE expansion transforms the hypergraph into a directed graph on the hyperedge level. Compared to the existing works (e.g. star expansion or normalized hypergraph cut), the learning results with HE expansion would be less sensitive to the vertex distribution among clusters, especially in the case that cluster sizes are unbalanced. Because of the special structure of the auxiliary directed graph, the linear eigenvalue problem of the Laplacian can be transformed into a quadratic eigenvalue problem, which has some special properties suitable for semi-supervised learning and clustering problems. We show in the experiments that the new algorithms based on the HE expansion achieves statistically significant gains in classification performance and good scalability for the co-occurrence data.