We introduce a learning framework towards the approximation of the maximum clique enumeration problem. We make use of node classification to eliminate the least likely nodes to be in a maximum clique and reduce the input ...