Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2024
DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting
WSDM '24: Proceedings of the 17th ACM International Conference on Web Search and Data MiningPages 218–227https://doi.org/10.1145/3616855.3635788Subgraph counting is the problem of counting the occurrences of a given query graph in a large target graph. Large-scale subgraph counting is useful in various domains, such as motif analysis for social network and loop counting for money laundering ...
- research-articleJune 2022
DIMMining: pruning-efficient and parallel graph mining on near-memory-computing
ISCA '22: Proceedings of the 49th Annual International Symposium on Computer ArchitecturePages 130–145https://doi.org/10.1145/3470496.3527388Graph mining, which finds specific patterns in the graph, is becoming increasingly important in various domains. We point out that accelerating graph mining suffers from the following challenges: (1) Heavy comparison for pruning: Pruning technique is ...