Sciweavers

961 search results - page 29 / 193
» Significance-Driven Graph Clustering
Sort
View
91
Voted
ACCV
2010
Springer
14 years 7 months ago
Earth Mover's Morphing: Topology-Free Shape Morphing Using Cluster-Based EMD Flows
Abstract. This paper describes a method for topology-free shape morphing based on region cluster-based Earth Mover's Distance (EMD) flows, since existing methods for closed cu...
Yasushi Makihara, Yasushi Yagi
152
Voted
JMLR
2010
179views more  JMLR 2010»
14 years 7 months ago
PAC-Bayesian Analysis of Co-clustering and Beyond
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
Yevgeny Seldin, Naftali Tishby
116
Voted
WWW
2009
ACM
16 years 1 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 7 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
SAC
2005
ACM
15 years 6 months ago
Discovering parametric clusters in social small-world graphs
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...
Jonathan McPherson, Kwan-Liu Ma, Michael Ogawa