These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
139 related articles for article (PubMed ID: 28692989)
1. An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs. Yang X; Qiao H; Liu ZY IEEE Trans Neural Netw Learn Syst; 2018 Jul; 29(7):3295-3300. PubMed ID: 28692989 [TBL] [Abstract][Full Text] [Related]
2. GNCCP-Graduated NonConvexityand Concavity Procedure. Zhi-Yong Liu ; Hong Qiao IEEE Trans Pattern Anal Mach Intell; 2014 Jun; 36(6):1258-67. PubMed ID: 26353285 [TBL] [Abstract][Full Text] [Related]
3. MISAGA: An Algorithm for Mining Interesting Subgraphs in Attributed Graphs. He T; Chan KCC IEEE Trans Cybern; 2018 May; 48(5):1369-1382. PubMed ID: 28459699 [TBL] [Abstract][Full Text] [Related]
4. A path following algorithm for the graph matching problem. Zaslavskiy M; Bach F; Vert JP IEEE Trans Pattern Anal Mach Intell; 2009 Dec; 31(12):2227-42. PubMed ID: 19834143 [TBL] [Abstract][Full Text] [Related]
5. Generalized Sparse Learning of Linear Models Over the Complete Subgraph Feature Set. Takigawa I; Mamitsuka H IEEE Trans Pattern Anal Mach Intell; 2017 Mar; 39(3):617-624. PubMed ID: 27187949 [TBL] [Abstract][Full Text] [Related]
6. A New Augmentation Based Algorithm for Extracting Maximal Chordal Subgraphs. Bhowmick S; Chen TY; Halappanavar M J Parallel Distrib Comput; 2015 Feb; 76():132-144. PubMed ID: 25767331 [TBL] [Abstract][Full Text] [Related]
7. Adaptive Graph Matching. Yang X; Liu ZY IEEE Trans Cybern; 2018 May; 48(5):1432-1445. PubMed ID: 28500016 [TBL] [Abstract][Full Text] [Related]
8. A Continuation Method for Graph Matching Based Feature Correspondence. Yang X; Liu ZY; Qiao H IEEE Trans Pattern Anal Mach Intell; 2020 Aug; 42(8):1809-1822. PubMed ID: 30843819 [TBL] [Abstract][Full Text] [Related]
9. Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics. Aparo A; Bonnici V; Micale G; Ferro A; Shasha D; Pulvirenti A; Giugno R Interdiscip Sci; 2019 Mar; 11(1):21-32. PubMed ID: 30790228 [TBL] [Abstract][Full Text] [Related]
10. Joint Transformation Learning via the L Yu YF; Xu G; Jiang M; Zhu H; Dai DQ; Yan H IEEE Trans Cybern; 2021 Feb; 51(2):521-533. PubMed ID: 31059466 [TBL] [Abstract][Full Text] [Related]
11. Boosting for multi-graph classification. Wu J; Pan S; Zhu X; Cai Z IEEE Trans Cybern; 2015 Mar; 45(3):430-43. PubMed ID: 25014984 [TBL] [Abstract][Full Text] [Related]
12. Discriminative Feature Selection for Uncertain Graph Classification. Kong X; Yu PS; Wang X; Ragin AB Proc SIAM Int Conf Data Min; 2013; 2013():82-93. PubMed ID: 25949925 [TBL] [Abstract][Full Text] [Related]
13. Dense Subgraph Partition of Positive Hypergraphs. Liu H; Latecki LJ; Yan S IEEE Trans Pattern Anal Mach Intell; 2015 Mar; 37(3):541-54. PubMed ID: 26353260 [TBL] [Abstract][Full Text] [Related]
15. Unsupervised Learning of Graph Matching With Mixture of Modes via Discrepancy Minimization. Wang R; Yan J; Yang X IEEE Trans Pattern Anal Mach Intell; 2023 Aug; 45(8):10500-10518. PubMed ID: 37030721 [TBL] [Abstract][Full Text] [Related]
16. A Two-Phase Algorithm for Differentially Private Frequent Subgraph Mining. Cheng X; Su S; Xu S; Xiong L; Xiao K; Zhao M IEEE Trans Knowl Data Eng; 2018 Aug; 30(8):1411-1425. PubMed ID: 33223776 [TBL] [Abstract][Full Text] [Related]
20. A linear delay algorithm for enumerating all connected induced subgraphs. Alokshiya M; Salem S; Abed F BMC Bioinformatics; 2019 Jun; 20(Suppl 12):319. PubMed ID: 31216984 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]