1232 search results - page 231 / 247 » Digraphs: theory, algorithms and applications |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
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...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Addressed in this paper is the issue of `email data cleaning' for text mining. Many text mining applications need take emails as input. Email data is usually noisy and thus i...