We are interested in finding natural communities in largescale linked networks. Our ultimate goal is to track changes over time in such communities. For such temporal tracking, we...
John E. Hopcroft, Omar Khan, Brian Kulis, Bart Sel...
Our previous work introduced a 3D particle visualization framework that viewed each data point as being a particle affected by gravitational forces. We showed the use of this tool ...
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
Eugene Levner, David Pinto, Paolo Rosso, David Alc...
Clusters of workstations are one of the most suitable resources to assist e-scientists in the execution of largescale experiments that demand processing power. The utilization rat...