Sciweavers

439 search results - page 11 / 88
» Engineering Comparators for Graph Clusterings
Sort
View
ICTAI
2006
IEEE
14 years 1 months ago
Preserving Patterns in Bipartite Graph Partitioning
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
Tianming Hu, Chao Qu, Chew Lim Tan, Sam Yuan Sung,...
WWW
2006
ACM
14 years 8 months ago
CWS: a comparative web search system
In this paper, we define and study a novel search problem: Comparative Web Search (CWS). The task of CWS is to seek relevant and comparative information from the Web to help users...
Jian-Tao Sun, Xuanhui Wang, Dou Shen, Hua-Jun Zeng...
FSTTCS
2001
Springer
14 years 7 days ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
HT
2009
ACM
14 years 2 months ago
Comparing the performance of us college football teams in the web and on the field
In previous research it has been shown that link-based web page metrics can be used to predict experts’ assessment of quality. We are interested in a related question: do expert...
Martin Klein, Olena Hunsicker, Michael L. Nelson
WEA
2010
Springer
316views Algorithms» more  WEA 2010»
14 years 26 days ago
Modularity-Driven Clustering of Dynamic Graphs
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
Robert Görke, Pascal Maillard, Christian Stau...