2 citations · 6 across the 4 of their papers we have counts for
5 papers
A Learning based Branch and Bound for Maximum Common Subgraph Problems
Yan-li Liu, Chu-min Li, Hua Jiang +1
Branch-and-bound (BnB) algorithms are widely used to solve combinatorial problems, and the performance crucially depends on its branching heuristic.In this work, we consider a typi…
A New Anchor Word Selection Method for the Separable Topic Discovery
Kun He, Wu Wang, Xiaosen Wang +1
Separable Non-negative Matrix Factorization (SNMF) is an important method for topic modeling, where "separable" assumes every topic contains at least one anchor word, defined as a…
The Local Dimension of Deep Manifold
Mengxiao Zhang, Wangquan Wu, Yanren Zhang +4
Based on our observation that there exists a dramatic drop for the singular values of the fully connected layers or a single feature map of the convolutional layer, and that the di…
Hidden Community Detection in Social Networks
Kun He, Yingru Li, Sucheta Soundarajan +1
We introduce a new paradigm that is important for community detection in the realm of network analysis. Networks contain a set of strong, dominant communities, which interfere with…
A Powerful Generative Model Using Random Weights for the Deep Image Representation
Kun He, Yan Wang, John Hopcroft
To what extent is the success of deep visualization due to the training? Could we do deep visualization using untrained, random weight networks? To address this issue, we explore n…