143 related articles for article (PubMed ID: 27571416)
1. A Novel Clustering Methodology Based on Modularity Optimisation for Detecting Authorship Affinities in Shakespearean Era Plays.
Naeni LM; Craig H; Berretta R; Moscato P
PLoS One; 2016; 11(8):e0157988. PubMed ID: 27571416
[TBL] [Abstract][Full Text] [Related]
2. An information theoretic clustering approach for unveiling authorship affinities in Shakespearean era plays and poems.
Arefin AS; Vimieiro R; Riveros C; Craig H; Moscato P
PLoS One; 2014; 9(10):e111445. PubMed ID: 25347727
[TBL] [Abstract][Full Text] [Related]
3. Solving text clustering problem using a memetic differential evolution algorithm.
Mustafa HMJ; Ayob M; Albashish D; Abu-Taleb S
PLoS One; 2020; 15(6):e0232816. PubMed ID: 32525869
[TBL] [Abstract][Full Text] [Related]
4. Language Individuation and Marker Words: Shakespeare and His Maxwell's Demon.
Marsden J; Budden D; Craig H; Moscato P
PLoS One; 2013; 8(6):e66813. PubMed ID: 23826143
[TBL] [Abstract][Full Text] [Related]
5. Predicting protein complexes from weighted protein-protein interaction graphs with a novel unsupervised methodology: Evolutionary enhanced Markov clustering.
Theofilatos K; Pavlopoulou N; Papasavvas C; Likothanassis S; Dimitrakopoulos C; Georgopoulos E; Moschopoulos C; Mavroudi S
Artif Intell Med; 2015 Mar; 63(3):181-9. PubMed ID: 25765008
[TBL] [Abstract][Full Text] [Related]
6. Novel symmetry-based gene-gene dissimilarity measures utilizing Gene Ontology: Application in gene clustering.
Acharya S; Saha S; Pradhan P
Gene; 2018 Dec; 679():341-351. PubMed ID: 30184472
[TBL] [Abstract][Full Text] [Related]
7. LEGClust- a clustering algorithm based on layered entropic subgraphs.
Santos JM; Marques de Sa J; Alexandre LA
IEEE Trans Pattern Anal Mach Intell; 2008 Jan; 30(1):62-75. PubMed ID: 18000325
[TBL] [Abstract][Full Text] [Related]
8. Graph clustering with local search optimization: the resolution bias of the objective function matters most.
van Laarhoven T; Marchiori E
Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jan; 87(1):012812. PubMed ID: 23410393
[TBL] [Abstract][Full Text] [Related]
9. A genetic graph-based approach for partitional clustering.
Menéndez HD; Barrero DF; Camacho D
Int J Neural Syst; 2014 May; 24(3):1430008. PubMed ID: 24552507
[TBL] [Abstract][Full Text] [Related]
10. Detecting alternative graph clusterings.
Mandala S; Kumara S; Yao T
Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jul; 86(1 Pt 2):016111. PubMed ID: 23005495
[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. A Comparison Study on Similarity and Dissimilarity Measures in Clustering Continuous Data.
Shirkhorshidi AS; Aghabozorgi S; Wah TY
PLoS One; 2015; 10(12):e0144059. PubMed ID: 26658987
[TBL] [Abstract][Full Text] [Related]
13. Automated segmentation of white matter fiber bundles using diffusion tensor imaging data and a new density based clustering algorithm.
Kamali T; Stashuk D
Artif Intell Med; 2016 Oct; 73():14-22. PubMed ID: 27926378
[TBL] [Abstract][Full Text] [Related]
14. Detecting clusters of different geometrical shapes in microarray gene expression data.
Kim DW; Lee KH; Lee D
Bioinformatics; 2005 May; 21(9):1927-34. PubMed ID: 15647300
[TBL] [Abstract][Full Text] [Related]
15. Localized Ambient Solidity Separation Algorithm Based Computer User Segmentation.
Sun X; Zhang T; Chai Y; Liu Y
Comput Intell Neurosci; 2015; 2015():829201. PubMed ID: 26221133
[TBL] [Abstract][Full Text] [Related]
16. Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale.
Emmons S; Kobourov S; Gallant M; Börner K
PLoS One; 2016; 11(7):e0159161. PubMed ID: 27391786
[TBL] [Abstract][Full Text] [Related]
17. Parallel clustering algorithm for large data sets with applications in bioinformatics.
Olman V; Mao F; Wu H; Xu Y
IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):344-52. PubMed ID: 19407357
[TBL] [Abstract][Full Text] [Related]
18. Colorful orthology clustering in bounded-degree similarity graphs.
Sánchez AL; Lafond M
J Bioinform Comput Biol; 2021 Dec; 19(6):2140010. PubMed ID: 34775924
[TBL] [Abstract][Full Text] [Related]
19. densityCut: an efficient and versatile topological approach for automatic clustering of biological data.
Ding J; Shah S; Condon A
Bioinformatics; 2016 Sep; 32(17):2567-76. PubMed ID: 27153661
[TBL] [Abstract][Full Text] [Related]
20. Adaptive k-means algorithm for overlapped graph clustering.
Bello-Orgaz G; Menéndez HD; Camacho D
Int J Neural Syst; 2012 Oct; 22(5):1250018. PubMed ID: 22916718
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
