Sciweavers

1163 search results - page 66 / 233
» Embedding into Bipartite Graphs
Sort
View
CSE
2009
IEEE
13 years 12 months ago
Equilibria and Efficiency Loss in Games on Networks
Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...
Joshua R. Davis, Zachary Goldman, Jacob Hilty, Eli...
WWW
2009
ACM
14 years 8 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
ICML
2009
IEEE
14 years 8 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis
ICDM
2008
IEEE
122views Data Mining» more  ICDM 2008»
14 years 2 months ago
Nonnegative Matrix Factorization for Combinatorial Optimization: Spectral Clustering, Graph Matching, and Clique Finding
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
Chris H. Q. Ding, Tao Li, Michael I. Jordan
DM
2008
80views more  DM 2008»
13 years 8 months ago
Restrained bondage in graphs
Let G = (V, E) be a graph. A set S V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V - S. The restrained domination numb...
Johannes H. Hattingh, Andrew R. Plummer