The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Bag Constrained Structure Pattern Mining for Multi-Graph Classification
Abstract
This paper formulates a multi-graph learning task. In our problem setting, a bag contains a number of graphs and a class label. A bag is labeled positive if at least one graph in the bag is positive, and negative otherwise. In addition, the genuine label of each graph in a positive bag is unknown, and all graphs in a negative bag are negative. The aim of multi-graph learning is to build a learning model from a number of labeled training bags to predict previously unseen test bags with maximum accuracy. This problem setting is essentially different from existing multi-instance learning (MIL), where instances in MIL share well-defined feature values, but no features are available to represent graphs in a multi-graph bag. To solve the problem, we propose a Multi-Graph Feature based Learning (gMGFL) algorithm that explores and selects a set of discriminative subgraphs as features to transfer each bag into a single instance, with the bag label being propagated to the transferred instance. As a result, the multi-graph bags form a labeled training instance set, so generic learning algorithms, such as decision trees, can be used to derive learning models for multi-graph classification. Experiments and comparisons on real-world multi-graph tasks demonstrate the algorithm performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
ArnetMiner: extraction and mining of academic social networks
Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., & Su, Z. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1402008 · Cited by 2,231
Cited by
A Comprehensive Survey on Graph Anomaly Detection With Deep Learning
Ma, X., Wu, J., Xue, S., Yang, J., Zhou, C., Sheng, Q. Z., Xiong, H., & Akoglu, L. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3118815 · Cited by 835
Self-citationMultiple instance learning: A survey of problem characteristics and applications
Carbonneau, M.-A., Cheplygina, V., Granger, E., & Gagnon, G. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.10.009 · Cited by 740
A literature survey on smart cities
Yin, C., Xiong, Z., Chen, H., Wang, J., Cooper, D., & David, B. (2015) · Science China Information Sciences · doi:10.1007/s11432-015-5397-4 · Cited by 734
Training deep neural networks on imbalanced data sets
Wang, S., Liu, W., Wu, J., Cao, L., Meng, Q., & Kennedy, P. J. (2016) · 2016 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2016.7727770 · Cited by 491
Self-citationParallel spatio-temporal attention-based TCN for multivariate time series prediction
Fan, J., Zhang, K., Huang, Y., Zhu, Y., & Chen, B. (2023) · Neural Computing and Applications · doi:10.1007/s00521-021-05958-z · Cited by 440
Metadata
- Authors
- Wu, J., Zhu, X., Zhang, C., & Yu, P. S.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2014-10
- Volume
- 26
- Issue
- 10
- Pages
- 2382-2396
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W1971039378
- Cited by
- 168
- References
- 1
- FWCI
- 67.49
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bag Constrained Structure Pattern Mining for Multi-Graph Classification. https://app.cochat.ai/papers/10.1109/tkde.2013.2297923
- The paper
- Wu, J., Zhu, X., Zhang, C., & Yu, P. S. (2014). Bag Constrained Structure Pattern Mining for Multi-Graph Classification. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2013.2297923
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.