Fetching the paper…
Reading the bibliography…
Hypergraph partitioning is an important problem in machine learning, computer vision and network analytics.
R. L. Plackett, “The analysis of permutations,” Applied Statistics , pp. 193–202, 1975
1975
Earlier work this paper cites.
J. P. Costeira and T. Kanade, “A multibody factorization method for independently moving objects,” International Journal of Computer Vision (IJCV) , vol. 29, no. 3, pp. 159–179, 1998
1998
Earlier work this paper cites.
A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: a review,” ACM computing surveys (CSUR) , vol. 31, no. 3, pp. 264–323, 1999
1999
Earlier work this paper cites.
H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, and A.-L. Barabási, “The large-scale organization of metabolic networks,” Nature , vol. 407, no. 6804, pp. 651–654, 2000
2000
Earlier work this paper cites.
J. Shi and J. Malik, “Normalized cuts and image segmentation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 22, no. 8, pp. 888–905, 2000
2000
Earlier work this paper cites.
A. Y. Ng, M. I. Jordan, and Y. Weiss, “On spectral clustering: Analysis and an algorithm,” in Advances in Neural Information Processing Systems (NIPS) , 2002, pp. 849–856
2002
Earlier work this paper cites.
N. Bansal, A. Blum, and S. Chawla, “Correlation clustering,” in The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS) , 2002, pp. 238–247
2002
Earlier work this paper cites.
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, “Network motifs: simple building blocks of complex networks,” Science , vol. 298, no. 5594, pp. 824–827, 2002
2002
Earlier work this paper cites.
T. Kamishima, “Nantonac collaborative filtering: recommendation based on order responses,” in ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD) , 2003, pp. 583–588
2003
Earlier work this paper cites.
S. Agarwal, J. Lim, L. Zelnik-Manor, P. Perona, D. Kriegman, and S. Belongie, “Beyond pairwise clustering,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , vol. 2, 2005, pp. 838–845
2005
Earlier work this paper cites.
S. Allesina, A. Bodini, and C. Bondavalli, “Ecological subsystems via graph theory: the role of strongly connected components,” Oikos , vol. 110, no. 1, pp. 164–176, 2005
2005
Earlier work this paper cites.
R. Vidal, Y. Ma, and S. Sastry, “Generalized principal component analysis (gpca),” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 27, no. 12, pp. 1945–1959, 2005
2005
Earlier work this paper cites.
S. Agarwal, K. Branson, and S. Belongie, “Higher order learning with graphs,” in International Conference on Machine Learning (ICML) . ACM, 2006, pp. 17–24
2006
Earlier work this paper cites.
J. Yan and M. Pollefeys, “A general framework for motion segmentation: Independent, articulated, rigid, non-rigid, degenerate and non-degenerate,” in European conference on computer vision (ECCV) , 2006, pp. 94–106
2006
Earlier work this paper cites.
D. Zhou, J. Huang, and B. Schölkopf, “Learning with hypergraphs: Clustering, classification, and embedding,” in Advances in neural information processing systems , 2007, pp. 1601–1608
2007
Earlier work this paper cites.
F. R. Chung, “Four proofs for the cheeger inequality and graph partition algorithms,” in Proceedings of ICCM , vol. 2, 2007, p. 378
2007
Earlier work this paper cites.
I. C. Gormley and T. B. Murphy, “A latent space model for rank data,” in Statistical Network Analysis: Models, Issues, and New Directions . Springer, 2007, pp. 90–102
2007
Earlier work this paper cites.
R. Tron and R. Vidal, “A benchmark for the comparison of 3-d motion segmentation algorithms,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2007, pp. 1–8
2007
Cited alongside, same era.
Y. Ma, H. Derksen, W. Hong, and J. Wright, “Segmentation of multivariate mixed data via lossy data coding and compression,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 29, no. 9, 2007
2007
Cited alongside, same era.
N. Ailon, M. Charikar, and A. Newman, “Aggregating inconsistent information: ranking and clustering,” Journal of the ACM (JACM) , vol. 55, no. 5, p. 23, 2008
2008
Cited alongside, same era.
S. R. Bulò and M. Pelillo, “A game-theoretic approach to hypergraph clustering,” in Advances in Neural Information Processing Systems (NIPS) , 2009, pp. 1571–1579
2009
Cited alongside, same era.
D. Ghoshdastidar and A. Dukkipati, “Consistency of spectral partitioning of uniform hypergraphs under planted partition model,” in Advances in Neural Information Processing Systems (NIPS) , 2014, pp. 397–405
2014
Later among the works it cites.
P. Awasthi, A. Blum, O. Sheffet, and A. Vijayaraghavan, “Learning mixtures of ranking models,” in Advances in Neural Information Processing Systems (NIPS) , 2014, pp. 2609–2617
2014
Later among the works it cites.
C. Meek and M. Meila, “Recursive inversion models for permutations,” in Advances in Neural Information Processing Systems (NIPS) , 2014, pp. 631–639
2014
Later among the works it cites.
A. R. Benson, D. F. Gleich, and J. Leskovec, “Tensor spectral clustering for partitioning higher-order network structures,” in Proceedings of the 2015 SIAM International Conference on Data Mining (ICDM) , 2015, pp. 118–126
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2009
Cited alongside, same era.
E. Elhamifar and R. Vidal, “Sparse subspace clustering,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2009, pp. 2790–2797
2009
Cited alongside, same era.
H. Liu, L. J. Latecki, and S. Yan, “Robust clustering as ensembles of affinity relations,” in Advances in Neural Information Processing Systems (NIPS) , 2010, pp. 1414–1422
2010
Cited alongside, same era.
J. Kunegis, S. Schmidt, A. Lommatzsch, J. Lerner, E. W. De Luca, and S. Albayrak, “Spectral analysis of signed graphs for clustering, prediction and visualization,” in SIAM International Conference on Data Mining (ICDM) , 2010, pp. 559–570
2010
Cited alongside, same era.
S. Kim, S. Nowozin, P. Kohli, and C. D. Yoo, “Higher-order correlation clustering for image segmentation,” in Advances in Neural Information Processing Systems (NIPS) , 2011, pp. 1530–1538
2011
Cited alongside, same era.
R. Vidal, “Subspace clustering,” IEEE Signal Processing Magazine , vol. 28, no. 2, pp. 52–68, 2011
2011
Cited alongside, same era.
M. Leordeanu and C. Sminchisescu, “Efficient hypergraph clustering,” in International Conference on Artificial Intelligence and Statistics (AISTATS) , 2012, pp. 676–684
2012
Cited alongside, same era.
J. Huang, C. Guestrin et al. , “Uncovering the riffled independence structure of ranked data,” Electronic Journal of Statistics , vol. 6, pp. 199–230, 2012
2012
Cited alongside, same era.
A. Louis, “Hypergraph markov operators, eigenvalues and approximation algorithms,” in Proceedings of the forty-seventh annual ACM symposium on Theory of computing (STOC) , 2015, pp. 713–722
2015
Later among the works it cites.
2015
Later among the works it cites.
A. R. Benson, D. F. Gleich, and J. Leskovec, “Higher-order organization of complex networks,” Science , vol. 353, no. 6295, pp. 163–166, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
P. Li, H. Dau, G. Puleo, and O. Milenkovic, “Motif clustering and overlapping clustering for social network analysis,” in IEEE Conference on Computer Communications (INFOCOM) , 2017, pp. 109–117
2017
Closest in time.
H. Yin, A. R. Benson, J. Leskovec, and D. F. Gleich, “Local higher-order graph clustering,” in Proceedings of the 23rd ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD) , 2017, pp. 555–564
2017
Closest in time.
C. Zhang, S. Hu, Z. G. Tang, and T. H. Chan, “Re-revisiting learning on hypergraphs: confidence interval and subgradient method,” in International Conference on Machine Learning (ICML) , 2017, pp. 4026–4034
2017
Closest in time.
2017
Closest in time.
J. Jiao, K. Venkat, Y. Han, and T. Weissman, “Maximum likelihood estimation of functionals of discrete distributions,” IEEE Transactions on Information Theory , vol. 63, no. 10, pp. 6774–6798, 2017
2017
Closest in time.
W. Gao, S. Oh, and P. Viswanath, “Demystifying fixed k-nearest neighbor information estimators,” in IEEE International Symposium on Information Theory (ISIT) , 2017, pp. 1267–1271
2017
Closest in time.