145 search results - page 5 / 29 » Mining closed relational graphs with connectivity constraint... |
163
click to vote
MLG
2007
Springer
16 years 5 days ago
2007
Springer
Abstract. There are many connections between graph mining and inductive logic programming (ILP), or more generally relational learning. Up till now these connections have mostly be...
119
click to vote
DM
1999
15 years 5 months ago
1999
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
167
click to vote
IUI
2009
ACM
16 years 25 days ago
2009
ACM
Intelligent desktop assistants could provide more help for users if they could learn models of the users’ workflows. However, discovering desktop workflows is difficult becau...
202
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
187
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...