97 related articles for article (PubMed ID: 28796628)
1. A Random Walk Approach to Query Informative Constraints for Clustering.
Abin AA
IEEE Trans Cybern; 2018 Aug; 48(8):2272-2283. PubMed ID: 28796628
[TBL] [Abstract][Full Text] [Related]
2. Clustering and embedding using commute times.
Qiu HJ; Hancock ER
IEEE Trans Pattern Anal Mach Intell; 2007 Nov; 29(11):1873-90. PubMed ID: 17848771
[TBL] [Abstract][Full Text] [Related]
3. SimNet: Similarity-based network embeddings with mean commute time.
Khajehnejad M
PLoS One; 2019; 14(8):e0221172. PubMed ID: 31415635
[TBL] [Abstract][Full Text] [Related]
4. Spectral clustering with epidemic diffusion.
Smith LM; Lerman K; Garcia-Cardona C; Percus AG; Ghosh R
Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Oct; 88(4):042813. PubMed ID: 24229231
[TBL] [Abstract][Full Text] [Related]
5. Interactive segmentation of clustered cells via geodesic commute distance and constrained density weighted Nyström method.
Du CJ; Marcello M; Spiller DG; White MR; Bretschneider T
Cytometry A; 2010 Dec; 77(12):1137-47. PubMed ID: 21069796
[TBL] [Abstract][Full Text] [Related]
6. Fast Inbound Top-K Query for Random Walk with Restart.
Zhang C; Jiang S; Chen Y; Sun Y; Han J
Mach Learn Knowl Discov Databases; 2015 Sep; 9285():608-624. PubMed ID: 26709392
[TBL] [Abstract][Full Text] [Related]
7. An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification.
Fouss F; Francoisse K; Yen L; Pirotte A; Saerens M
Neural Netw; 2012 Jul; 31():53-72. PubMed ID: 22497802
[TBL] [Abstract][Full Text] [Related]
8. Random-Walk Laplacian for Frequency Analysis in Periodic Graphs.
Boukrab R; Pagès-Zamora A
Sensors (Basel); 2021 Feb; 21(4):. PubMed ID: 33670095
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. SpectralNET--an application for spectral graph analysis and visualization.
Forman JJ; Clemons PA; Schreiber SL; Haggarty SJ
BMC Bioinformatics; 2005 Oct; 6():260. PubMed ID: 16236170
[TBL] [Abstract][Full Text] [Related]
11. On a two-truths phenomenon in spectral graph clustering.
Priebe CE; Park Y; Vogelstein JT; Conroy JM; Lyzinski V; Tang M; Athreya A; Cape J; Bridgeford E
Proc Natl Acad Sci U S A; 2019 Mar; 116(13):5995-6000. PubMed ID: 30850525
[TBL] [Abstract][Full Text] [Related]
12. Maximal-entropy random walk unifies centrality measures.
Ochab JK
Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Dec; 86(6 Pt 2):066109. PubMed ID: 23368006
[TBL] [Abstract][Full Text] [Related]
13. Fault Diagnosis by Multisensor Data: A Data-Driven Approach Based on Spectral Clustering and Pairwise Constraints.
Pacella M; Papadia G
Sensors (Basel); 2020 Dec; 20(24):. PubMed ID: 33321733
[TBL] [Abstract][Full Text] [Related]
14. An efficient supply management in water flow network using graph spectral techniques.
Gopalsamy T; Thankappan V; Chandramohan S
Environ Sci Pollut Res Int; 2023 Jan; 30(2):2530-2543. PubMed ID: 35932342
[TBL] [Abstract][Full Text] [Related]
15. Local quality functions for graph clustering with non-negative matrix factorization.
van Laarhoven T; Marchiori E
Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Dec; 90(6):062813. PubMed ID: 25615154
[TBL] [Abstract][Full Text] [Related]
16. Querying Beneficial Constraints Before Clustering Using Facility Location Analysis.
Abin AA
IEEE Trans Cybern; 2018 Jan; 48(1):312-323. PubMed ID: 27959838
[TBL] [Abstract][Full Text] [Related]
17. Walk-Steered Convolution for Graph Classification.
Jiang J; Xu C; Cui Z; Zhang T; Zheng W; Yang J
IEEE Trans Neural Netw Learn Syst; 2020 Nov; 31(11):4553-4566. PubMed ID: 31899441
[TBL] [Abstract][Full Text] [Related]
18. A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering.
Cheng D; Nie F; Sun J; Gong Y
Neural Comput; 2017 Jul; 29(7):1902-1918. PubMed ID: 28562218
[TBL] [Abstract][Full Text] [Related]
19. Graph Matching Based on Stochastic Perturbation.
Leng C; Xu W; Cheng I; Basu A
IEEE Trans Image Process; 2015 Dec; 24(12):4862-75. PubMed ID: 26292343
[TBL] [Abstract][Full Text] [Related]
20. Efficient and Exact Local Search for Random Walk Based Top-K Proximity Query in Large Graphs.
Wu Y; Jin R; Zhang X
IEEE Trans Knowl Data Eng; 2016 May; 28(5):1160-1174. PubMed ID: 30867621
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
