Amanote Research

Amanote Research

    RegisterSign In

Finding Frequent Patterns in a Large Sparse Graph

doi 10.1137/1.9781611972740.32
Full Text
Open PDF
Abstract

Available in full text

Date

April 22, 2004

Authors
Michihiro KuramochiGeorge Karypis
Publisher

Society for Industrial and Applied Mathematics


Related search

Finding Frequent Patterns in Biological Networks

International Journal of Engineering and Technology(UAE)
ArchitectureHardwareEngineeringChemical EngineeringBiotechnologyEnvironmental EngineeringComputer Science
2018English

Flexible Support Measures and Search Schemes for Mining Frequent Patterns in a Large Single Graph

2017English

Finding Approximate Frequent Patterns in Streaming Medical Data

2010English

Mining Frequent Graph Sequence Patterns Induced by Vertices

2010English

FRISSMiner: Mining Frequent Graph Sequence Patterns Induced by Vertices

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2012English

Finding the Distance to Instability of a Large Sparse Matrix

2006English

Fluid Collection After Distal Pancreatectomy: A Frequent Finding

HPB
HepatologyGastroenterology
2016English

A Lower Bound on Cycle-Finding in Sparse Digraphs

2020English

Algorithm for Finding Maximal Frequent Sets

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy