Sciweavers

1082 search results - page 32 / 217
» Graph Mining using Graph Pattern Profiles
Sort
View
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
14 years 10 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
ICDM
2010
IEEE
117views Data Mining» more  ICDM 2010»
14 years 7 months ago
Node Similarities from Spreading Activation
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
Kilian Thiel, Michael R. Berthold
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
15 years 1 months ago
Suggesting friends using the implicit social graph
Maayan Roth, Assaf Ben-David, David Deutscher, Guy...
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 1 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
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...
Prasad Raghavendra, David Steurer and Prasad Tetal...
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
15 years 10 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer