The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Clustering is a central unsupervised learning task with a wide variety of applications. Not surprisingly, there exist many clustering algorithms. However, unlike classification ta...
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...