Login / Signup
As Strong as the Weakest Link: Mining Diverse Cliques in Weighted Graphs.
Petko Bogdanov
Ben Baumer
Prithwish Basu
Amotz Bar-Noy
Ambuj K. Singh
Published in:
ECML/PKDD (1) (2013)
Keyphrases
</>
weighted graph
shortest path
graph structure
text mining
pattern mining
regularization framework
discrete data
data objects
sequential patterns
subgraph isomorphism
edge weights
data mining
frequent patterns
frequent itemsets
spanning tree
itemsets
maximum likelihood
pairwise
high level