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.
346 related articles for article (PubMed ID: 21118772)
1. Graph characterization via Ihara coefficients. Ren P; Wilson RC; Hancock ER IEEE Trans Neural Netw; 2011 Feb; 22(2):233-45. PubMed ID: 21118772 [TBL] [Abstract][Full Text] [Related]
2. Convolutional networks can learn to generate affinity graphs for image segmentation. Turaga SC; Murray JF; Jain V; Roth F; Helmstaedter M; Briggman K; Denk W; Seung HS Neural Comput; 2010 Feb; 22(2):511-38. PubMed ID: 19922289 [TBL] [Abstract][Full Text] [Related]
3. Pattern vectors from algebraic graph theory. Wilson RC; Hancock ER; Luo B IEEE Trans Pattern Anal Mach Intell; 2005 Jul; 27(7):1112-24. PubMed ID: 16013758 [TBL] [Abstract][Full Text] [Related]
4. Backtrackless walks on a graph. Aziz F; Wilson RC; Hancock ER IEEE Trans Neural Netw Learn Syst; 2013 Jun; 24(6):977-89. PubMed ID: 24808478 [TBL] [Abstract][Full Text] [Related]
5. A binary linear programming formulation of the graph edit distance. Justice D; Hero A IEEE Trans Pattern Anal Mach Intell; 2006 Aug; 28(8):1200-14. PubMed ID: 16886857 [TBL] [Abstract][Full Text] [Related]
6. Structural information content of networks: graph entropy based on local vertex functionals. Dehmer M; Emmert-Streib F Comput Biol Chem; 2008 Apr; 32(2):131-8. PubMed ID: 18243802 [TBL] [Abstract][Full Text] [Related]
7. A clustering-based graph Laplacian framework for value function approximation in reinforcement learning. Xu X; Huang Z; Graves D; Pedrycz W IEEE Trans Cybern; 2014 Dec; 44(12):2613-25. PubMed ID: 24802018 [TBL] [Abstract][Full Text] [Related]
8. Comments on "the 1993 DIMACS graph coloring challenge" and "energy function-based approaches to graph coloring". Liu J; Zhong W; Jiao L IEEE Trans Neural Netw; 2006 Mar; 17(2):533. PubMed ID: 16566482 [TBL] [Abstract][Full Text] [Related]
11. Weighted graph cuts without eigenvectors a multilevel approach. Dhillon IS; Guan Y; Kulis B IEEE Trans Pattern Anal Mach Intell; 2007 Nov; 29(11):1944-57. PubMed ID: 17848776 [TBL] [Abstract][Full Text] [Related]
12. Graph cuts via l1 norm minimization. Bhusnurmath A; Taylor CJ IEEE Trans Pattern Anal Mach Intell; 2008 Oct; 30(10):1866-71. PubMed ID: 18703837 [TBL] [Abstract][Full Text] [Related]
13. Graph Matching: Relax at Your Own Risk. Lyzinski V; Fishkind DE; Fiori M; Vogelstein JT; Priebe CE; Sapiro G IEEE Trans Pattern Anal Mach Intell; 2016 Jan; 38(1):60-73. PubMed ID: 26656578 [TBL] [Abstract][Full Text] [Related]
14. Augmented cell-graphs for automated cancer diagnosis. Demir C; Gultekin SH; Yener B Bioinformatics; 2005 Sep; 21 Suppl 2():ii7-12. PubMed ID: 16204128 [TBL] [Abstract][Full Text] [Related]
15. Toward the optimization of normalized graph Laplacian. Xie B; Wang M; Tao D IEEE Trans Neural Netw; 2011 Apr; 22(4):660-6. PubMed ID: 21356614 [TBL] [Abstract][Full Text] [Related]
16. Logistic regression by means of evolutionary radial basis function neural networks. Gutierrez PA; Hervas-Martinez C; Martinez-Estudillo FJ IEEE Trans Neural Netw; 2011 Feb; 22(2):246-63. PubMed ID: 21138802 [TBL] [Abstract][Full Text] [Related]
17. Learning graph matching. Caetano TS; McAuley JJ; Cheng L; Le QV; Smola AJ IEEE Trans Pattern Anal Mach Intell; 2009 Jun; 31(6):1048-58. PubMed ID: 19372609 [TBL] [Abstract][Full Text] [Related]
18. Learning locality preserving graph from data. Zhang YM; Huang K; Hou X; Liu CL IEEE Trans Cybern; 2014 Nov; 44(11):2088-98. PubMed ID: 25020223 [TBL] [Abstract][Full Text] [Related]
19. The graph neural network model. Scarselli F; Gori M; Tsoi AC; Hagenbuchner M; Monfardini G IEEE Trans Neural Netw; 2009 Jan; 20(1):61-80. PubMed ID: 19068426 [TBL] [Abstract][Full Text] [Related]
20. Topology-based hierarchical clustering of self-organizing maps. Taşdemir K; Milenov P; Tapsall B IEEE Trans Neural Netw; 2011 Mar; 22(3):474-85. PubMed ID: 21356611 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]