Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
75
click to vote
SIGKDD
2010
75
views
more
SIGKDD 2010
»
Mining interesting subgraphs by output space sampling
15 years 1 months ago
Download
www.cs.rpi.edu
Mohammad Al Hasan
Real-time Traffic
SIGKDD 2010
|
claim paper
Related Content
»
MARGIN Maximal Frequent Subgraph Mining
»
Discriminative frequent subgraph mining with optimality guarantees
»
Finding interesting things
»
CLAN An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
»
Frequent subgraph mining in outerplanar graphs
»
GraphSig A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
»
High Performance Subgraph Mining in Molecular Compounds
»
CSV visualizing and mining cohesive subgraphs
»
On Point Sampling Versus Space Sampling for Dimensionality Reduction
more »
Post Info
More Details (n/a)
Added
30 Jan 2011
Updated
30 Jan 2011
Type
Journal
Year
2010
Where
SIGKDD
Authors
Mohammad Al Hasan
Comments
(0)
Researcher Info
SIGKDD 2000 Study Group
Computer Vision