We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
Denis Helic, Christoph Trattner, Markus Strohmaier...
Most application provenance systems are hard coded for a particular type of system or data, while current provenance file systems maintain in-memory provenance graphs and reside i...
Richard P. Spillane, Russell Sears, Chaitanya Yala...
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...