Sciweavers

1976 search results - page 31 / 396
» Predictive Graph Mining
Sort
View
JCP
2008
171views more  JCP 2008»
13 years 7 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Jia Wu, Ling Chen
WCRE
2006
IEEE
14 years 1 months ago
Mining Control Flow Graphs for Crosscutting Concerns
Aspect mining tries to identify crosscutting concerns in existing systems and thus supports the adaption to an aspect-oriented design. This paper describes an automatic static asp...
Jens Krinke
KDD
2010
ACM
224views Data Mining» more  KDD 2010»
13 years 11 months ago
Suggesting friends using the implicit social graph
Maayan Roth, Assaf Ben-David, David Deutscher, Guy...
ICDM
2008
IEEE
106views Data Mining» more  ICDM 2008»
14 years 2 months ago
Metropolis Algorithms for Representative Subgraph Sampling
While data mining in chemoinformatics studied graph data with dozens of nodes, systems biology and the Internet are now generating graph data with thousands and millions of nodes....
Christian Hübler, Hans-Peter Kriegel, Karsten...
IDEAL
2004
Springer
14 years 27 days ago
Prediction of Implicit Protein-Protein Interaction by Optimal Associative Feature Mining
Proteins are known to perform a biological function by interacting with other proteins or compounds. Since protein–protein interaction is intrinsic to most cellular processes, pr...
Jae-Hong Eom, Jeong Ho Chang, Byoung-Tak Zhang