Learning with Small Data: Subgraph Counting Queries
Abstract Deep Learning (DL) has been widely used in many applications, and its success is achieved with large training data. A key issue is how to provide a DL solution when there is no large training data to learn initially. In this paper, we explore a meta-learning approach for a specific problem,...
Main Authors: | Kangfei Zhao, Zongyan He, Jeffrey Xu Yu, Yu Rong |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2023-09-01
|
Series: | Data Science and Engineering |
Subjects: | |
Online Access: | https://doi.org/10.1007/s41019-023-00223-w |
Similar Items
-
On Minimal Unique Induced Subgraph Queries
by: Lincheng Jiang, et al.
Published: (2018-10-01) -
An Optimization of Closed Frequent Subgraph Mining Algorithm
by: Demetrovics J., et al.
Published: (2017-03-01) -
Efficient Algorithms for Subgraph Listing
by: Niklas Zechner, et al.
Published: (2014-05-01) -
An Efficient Subgraph Isomorphism Solver for Large Graphs
by: Zubair Ali Ansari, et al.
Published: (2021-01-01) -
High Performance Frequent Subgraph Mining on Transaction Datasets: A Survey and Performance Comparison
by: Bismita S. Jena, et al.
Published: (2019-09-01)