abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
In previous work, we have proposed a novel approach to data clustering based on the explicit optimization of a partitioning with respect to two complementary clustering objectives ...
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
Document understanding techniques such as document clustering and multi-document summarization have been receiving much attention in recent years. Current document clustering meth...
Dingding Wang, Shenghuo Zhu, Tao Li, Yun Chi, Yiho...
Person name queries often bring up web pages that correspond to individuals sharing the same name. The Web People Search (WePS) task consists of organizing search results for ambi...