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.
103 related articles for article (PubMed ID: 34061746)
1. Rationalizing Architectural Surfaces Based on Clustering of Joints. Xiong W; Cheung CM; Sander PV; Joneja A IEEE Trans Vis Comput Graph; 2022 Dec; 28(12):4274-4288. PubMed ID: 34061746 [TBL] [Abstract][Full Text] [Related]
2. Low-Resolution Remeshing Using the Localized Restricted Voronoi Diagram. Yan DM; Bao G; Zhang X; Wonka P IEEE Trans Vis Comput Graph; 2014 Oct; 20(10):1418-27. PubMed ID: 26357388 [TBL] [Abstract][Full Text] [Related]
3. Metric for measuring the effectiveness of clustering of DNA microarray expression. Loganantharaj R; Cheepala S; Clifford J BMC Bioinformatics; 2006 Sep; 7 Suppl 2(Suppl 2):S5. PubMed ID: 17118148 [TBL] [Abstract][Full Text] [Related]
4. Volume-Enhanced Compatible Remeshing of 3D Models. Yang Y; Fu XM; Chai S; Xiao SW; Liu L IEEE Trans Vis Comput Graph; 2019 Oct; 25(10):2999-3010. PubMed ID: 30080150 [TBL] [Abstract][Full Text] [Related]
5. Dr. KID: Direct Remeshing and K-Set Isometric Decomposition for Scalable Physicalization of Organic Shapes. Khan D; Bohak C; Viola I IEEE Trans Vis Comput Graph; 2024 Jan; 30(1):705-715. PubMed ID: 37871062 [TBL] [Abstract][Full Text] [Related]
6. Clustering algorithm with strength of connectedness for m-polar fuzzy network models. Akram M; Siddique S; Alharbi MG Math Biosci Eng; 2022 Jan; 19(1):420-455. PubMed ID: 34902998 [TBL] [Abstract][Full Text] [Related]
7. L1-Norm Distance Minimization-Based Fast Robust Twin Support Vector $k$ -Plane Clustering. Ye Q; Zhao H; Li Z; Yang X; Gao S; Yin T; Ye N IEEE Trans Neural Netw Learn Syst; 2018 Sep; 29(9):4494-4503. PubMed ID: 28981431 [TBL] [Abstract][Full Text] [Related]
8. Kernel-Based Distance Metric Learning for Supervised k -Means Clustering. Nguyen B; De Baets B IEEE Trans Neural Netw Learn Syst; 2019 Oct; 30(10):3084-3095. PubMed ID: 30668483 [TBL] [Abstract][Full Text] [Related]
9. Iterative mesh transformation for 3D segmentation of livers with cancers in CT images. Lu D; Wu Y; Harris G; Cai W Comput Med Imaging Graph; 2015 Jul; 43():1-14. PubMed ID: 25728595 [TBL] [Abstract][Full Text] [Related]
10. A multi-resolution scheme for distortion-minimizing mapping between human subcortical structures based on geodesic construction on Riemannian manifolds. Cho Y; Seong JK; Shin SY; Jeong Y; Kim JH; Qiu A; Im K; Lee JM; Na DL Neuroimage; 2011 Aug; 57(4):1376-92. PubMed ID: 21658456 [TBL] [Abstract][Full Text] [Related]
12. Towards Robust Discriminative Projections Learning via Non-Greedy l Nie F; Wang Z; Wang R; Wang Z; Li X IEEE Trans Pattern Anal Mach Intell; 2021 Jun; 43(6):2086-2100. PubMed ID: 31880539 [TBL] [Abstract][Full Text] [Related]
13. Learning on 3D Meshes With Laplacian Encoding and Pooling. Qiao YL; Gao L; Yang J; Rosin PL; Lai YK; Chen X IEEE Trans Vis Comput Graph; 2022 Feb; 28(2):1317-1327. PubMed ID: 32755863 [TBL] [Abstract][Full Text] [Related]
14. Correntropy-Based Multiview Subspace Clustering. Xing L; Chen B; Du S; Gu Y; Zheng N IEEE Trans Cybern; 2021 Jun; 51(6):3298-3311. PubMed ID: 31794416 [TBL] [Abstract][Full Text] [Related]
15. Capped L Yuan C; Yang L Neural Netw; 2021 Oct; 142():457-478. PubMed ID: 34273616 [TBL] [Abstract][Full Text] [Related]
16. Three-dimensional surface mesh segmentation using curvedness-based region growing approach. Jagannathan A; Miller EL IEEE Trans Pattern Anal Mach Intell; 2007 Dec; 29(12):2195-204. PubMed ID: 17934228 [TBL] [Abstract][Full Text] [Related]
17. A fast clustering algorithm for data with a few labeled instances. Yang J; Xiao Y; Wang J; Ma Q; Shen Y Comput Intell Neurosci; 2015; 2015():196098. PubMed ID: 25861252 [TBL] [Abstract][Full Text] [Related]
18. Analysis of sparse representation and blind source separation. Li Y; Cichocki A; Amari S Neural Comput; 2004 Jun; 16(6):1193-234. PubMed ID: 15130247 [TBL] [Abstract][Full Text] [Related]
19. A graph-based clustering method for a large set of sequences using a graph partitioning algorithm. Kawaji H; Yamaguchi Y; Matsuda H; Hashimoto A Genome Inform; 2001; 12():93-102. PubMed ID: 11791228 [TBL] [Abstract][Full Text] [Related]
20. A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences. Russell DJ; Way SF; Benson AK; Sayood K BMC Bioinformatics; 2010 Dec; 11():601. PubMed ID: 21167044 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]