Finding Reliable Subgraphs from Large Probabilistic Graphs.
Petteri HintsanenHannu ToivonenPublished in: ECML/PKDD (1) (2008)
Keyphrases
- maximum clique
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- labeled graphs
- graph structures
- graph data
- probabilistic model
- maximum common subgraph
- reachability queries
- graph matching
- subgraph matching
- probabilistic logic
- connected subgraphs
- subgraph mining
- generative model
- data structure
- uncertain data
- frequent subgraphs
- cost effective
- pattern mining
- dense subgraphs
- probability distribution
- query graph
- belief networks
- association graph
- conditional probabilities
- graph patterns
- graph representation