496 search results - page 48 / 100 » C4-saturated bipartite graphs |
CIKM
2008
Springer
13 years 9 months ago
2008
Springer
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
ORL
2007
13 years 7 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
WWW
2009
ACM
14 years 8 months ago
2009
ACM
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 ...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
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...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
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....