Complete List » Graph mining

Publications Related to Graph mining

  1. Exploring Optimizations on Shared-memory Platforms for Parallel Triangle Counting Algorithms.

    Ancy Sarah Tom, Narayanan Sundaram, Nesreen K. Ahmed, Shaden Smith, Stijn Eyerman, Midhunchandra Kodiyath, Ibrahim Hur, Fabrizio Petrini, and George Karypis. IEEE High Performance Extreme Computing Conference (HPEC), 2017.

  1. Truss Decomposition on Shared-Memory Parallel Systems.

    Shaden Smith, Xing Liu, Nesreen K. Ahmed, Ancy Sarah Tom, Fabrizio Petrini, and George Karypis. IEEE High Performance Extreme Computing Conference (HPEC), 2017.

  1. Mining Coevolving Induced Relational Motifs in Dynamic Networks.

    Rezwan Ahmed and George Karypis. Workshop on Dynamic Networks (SDM-Networks), SIAM Data mining Conference, 2015.

  1. Algorithms for Mining the Evolution of Conserved Relational States in Dynamic Networks.

    Rezwan Ahmed and George Karypis. ICDM, 2011.

  1. Within-network classification using local structure similarity.

    Christian Desrosiers and George Karypis. ECML-PKDD, pp. 260-275, 2009.

  1. Common Pharmacophore Identification Using Frequent Clique Detection Algorithm.

    Yevgeniy Podolyan and George Karypis. Journal of Chemical Information and Modeling, 2008.

  1. Out-of-Core Coherent Closed Quasi-Clique Mining from Large Dense Graph Databases.

    Zhiping Zeng, Jianyong Wang, Lizhu Zhou, and George Karypis. ACM Transactions on Database Systems, Vol 32, Issue 2, 2007.

  1. A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph.

    Steve Reinhardt and George Karypis. 12th International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS'07), 2007.

  1. Coherent Closed Quasi-Clique Discovery from Large Dense Graph Databases.

    Zhiping Zeng, Jianyong Wang, Lizhu Zhou, and George Karypis. 12th International Conference on Knowledge and Data Discovery (KDD), 2006.

  1. Finding Frequent Patterns in a Large Sparse Graph.

    Michihiro Kuramochi and George Karypis. Data Mining and Knowledge Discovery, 11(3): 243-271, 2005.

  1. GREW: A Scalable Frequent Subgraph Discovery Algorithm.

    Michihiro Kuramochi and George Karypis. 4th IEEE Conference on Data Mining (ICDM), pp. 439-442, 2004.

  1. Finding Frequent Patterns in a Large Sparse Graph.

    Michihiro Kuramochi and George Karypis. SIAM International Conference on Data Mining, 2004.