Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

74

Voted

ICDM
2008
IEEE

86views Data Mining» more ICDM 2008»

Mining Large Networks with Subgraph Counting

15 years 10 months ago

Mining Large Networks with Subgraph Counting

Download www.research.yahoo.com

Ilaria Bordino, Debora Donato, Aristides Gionis, S

Real-time Traffic

Data Mining | ICDM 2008 |

claim paper

Related Content

» Counting Stars and Other Small Subgraphs in Sublinear Time

» Finding Frequent Patterns in a Large Sparse Graph

» Online Algorithms for Mining Interstream Associations from Large Sensor Networks

» Mining Attributestructure Correlated Patterns in Large Attributed Graphs

» DESSIN Mining Dense Subgraph Patterns in a Single Graph

» Fast discovery of connection subgraphs

» Towards proximity pattern mining in large graphs

» Topk subgraph matching query in a large graph

» Measuring and extracting proximity in networks

Post Info
More Details (n/a)

Added	30 May 2010
Updated	30 May 2010
Type	Conference
Year	2008
Where	ICDM
Authors	Ilaria Bordino, Debora Donato, Aristides Gionis, Stefano Leonardi

Comments (0)