Sciweavers

521 search results - page 13 / 105
» Coring method for clustering a graph
Sort
View
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
15 years 5 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
EMNLP
2010
15 years 1 months ago
Word Sense Induction Disambiguation Using Hierarchical Random Graphs
Graph-based methods have gained attention in many areas of Natural Language Processing (NLP) including Word Sense Disambiguation (WSD), text summarization, keyword extraction and ...
Ioannis P. Klapaftis, Suresh Manandhar
199
Voted
EDBT
2011
ACM
197views Database» more  EDBT 2011»
14 years 7 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
146
Voted
WWW
2009
ACM
16 years 4 months ago
Query clustering using click-through graph
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 ...
Jeonghee Yi, Farzin Maghoul
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 10 months ago
Clustering with Multiple Graphs
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
Wei Tang, Zhengdong Lu, Inderjit S. Dhillon