{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T04:11:50Z","timestamp":1747455110009,"version":"3.40.5"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319148021"},{"type":"electronic","value":"9783319148038"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14803-8_29","type":"book-chapter","created":{"date-parts":[[2015,1,10]],"date-time":"2015-01-10T01:03:21Z","timestamp":1420851801000},"page":"373-386","source":"Crossref","is-referenced-by-count":1,"title":["The MST-kNN with Paracliques"],"prefix":"10.1007","author":[{"given":"Ahmed Shamsul","family":"Arefin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Riveros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Regina","family":"Berretta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Moscato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Anders, K.-H.: A hierarchical graph-clustering approach to find groups of objects. In: Proceedings 5th Workshop on Progress in Automated Map Generalization, pp. 1\u20138 (2003)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-24669-2_36","volume-title":"Algorithms and Architectures for Parallel Processing","author":"A.S. Arefin","year":"2011","unstructured":"Arefin, A.S., Inostroza-Ponta, M., Mathieson, L., Berretta, R., Moscato, P.: Clustering nodes in large-scale biological networks using external memory algorithms. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds.) ICA3PP 2011, Part II. LNCS, vol.\u00a07017, pp. 375\u2013386. Springer, Heidelberg (2011)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Arefin, A.S., Mathieson, L., Johnstone, D., Berretta, R., Moscato, P.: Unveiling clusters of RNA transcript pairs associated with markers of Alzheimers disease progression. PloS One\u00a07(9), e45535 (2012)","DOI":"10.1371\/journal.pone.0045535"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Arefin, A.S., Riveros, C., Berretta, R., Moscato, P.: kNN-MST-Agglomerative: A fast and scalable graph-based data clustering approach on GPU. In: 2012 7th International Conference on Computer Science & Education (ICCSE), pp. 585\u2013590. IEEE (2012)","DOI":"10.1109\/ICCSE.2012.6295143"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Arefin, A.S., Vimieiro, R., Riveros, C., Craig, H., Moscato, P.: An Information Theoretic clustering approach for unveiling authorship affnities in Shakespearean era plays and poems. PLoS ONE\u00a09(10), e111445 (2014)","DOI":"10.1371\/journal.pone.0111445"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-31125-3_6","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2012","author":"A.S. Arefin","year":"2012","unstructured":"Arefin, A.S., Riveros, C., Berretta, R., Moscato, P.: kNN-bor\u016fvka-GPU: A fast and scalable MST construction from kNN graphs on GPU. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part I. LNCS, vol.\u00a07333, pp. 71\u201386. Springer, Heidelberg (2012)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Berkhin, P.: A survey of clustering data mining techniques. In: Grouping multidimensional data, pp. 25\u201371. Springer (2006)","DOI":"10.1007\/3-540-28349-8_2"},{"key":"29_CR8","unstructured":"Bryant, D., Filimon, F., Gray, R.D.: Untangling our past: languages, trees, splits and networks. In: The Evolution of Cultural Diversity: Pylogenetic Approaches, pp. 67\u201384 (2005)"},{"issue":"3","key":"29_CR9","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.radonc.2008.09.019","volume":"90","author":"A. Capp","year":"2009","unstructured":"Capp, A., Inostroza-Ponta, M., Bill, D., Moscato, P., Lai, C., Christie, D., Lamb, D., Turner, S., Joseph, D., Matthews, J.: Is there more than one proctitis syndrome? a revisitation using data from the TROG 96.01 trial. Radiotherapy and Oncology\u00a090(3), 400\u2013407 (2009)","journal-title":"Radiotherapy and Oncology"},{"key":"29_CR10","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-48540-7_13","volume-title":"Systems Biology and Regulatory Genomics","author":"E.. Chesler","year":"2007","unstructured":"Chesler, E., Langston, M.: Combinatorial genetic regulatory network analysis tools for high throughput transcriptomic data. In: Eskin, E., Ideker, T., Raphael, B., Workman, C. (eds.) RECOMB 2005. LNCS (LNBI), vol.\u00a04023, pp. 150\u2013165. Springer, Heidelberg (2007)"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1093\/llc\/fqp033","volume":"25","author":"H. Craig","year":"2010","unstructured":"Craig, H., Whipp, R.: Old spellings, new methods: automated procedures for indeterminate linguistic data. Literary and Linguistic Computing\u00a025(1), 37\u201352 (2010)","journal-title":"Literary and Linguistic Computing"},{"key":"29_CR12","unstructured":"Csardi, G., Nepusz, T.: The igraph software package for complex network research. Inter Journal, Complex Systems\u00a01695(5) (2006)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Dyen, I., Kruskal, J.B., Black, P.: An Indoeuropean classification: a lexicostatistical experiment. Transactions of the American Philosophical Society, iii\u2013132 (1992)","DOI":"10.2307\/1006517"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Feige, U., Goldwasser, S., Lovsz, L., Safra, S., Szegedy, M.: Approximating clique is almost NP-complete. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 2\u201312. IEEE Comput. Soc. Press (1991)","DOI":"10.1109\/SFCS.1991.185341"},{"issue":"1","key":"29_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0167-7152(02)00421-2","volume":"62","author":"J.M. Gonzlez-Barrios","year":"2003","unstructured":"Gonzlez-Barrios, J.M., Quiroz, A.J.: A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree. Statistics & Probability Letters\u00a062(1), 23\u201334 (2003)","journal-title":"Statistics & Probability Letters"},{"key":"29_CR16","unstructured":"Hollander, M., Wolfe, D.A., Chicken, E.: Nonparametric statistical methods, vol.\u00a0751. John Wiley & Sons (2013)"},{"issue":"10","key":"29_CR17","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1081\/STA-100106060","volume":"30","author":"M.H. Huh","year":"2001","unstructured":"Huh, M.H., Jhun, M.: Random permutation testing in multiple linear regression. Communications in Statistics-Theory and Methods\u00a030(10), 2023\u20132032 (2001)","journal-title":"Communications in Statistics-Theory and Methods"},{"key":"29_CR18","unstructured":"Inostroza-Ponta, M.: An integrated and scalable approach based on combinatorial optimization techniques for the analysis of microarray data. NOVA | The University of Newcastle\u2019s Digital Repository (2008)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Inostroza-Ponta, M., Berretta, R., Mendes, A., Moscato, P.: An automatic graph layout procedure to visualize correlated data. In: Bramer, M. (ed.) Artificial Intelligence in Theory and Practice. IFIP, vol.\u00a0217, pp. 179\u2013188. Springer, Heidelberg (2006)","DOI":"10.1007\/978-0-387-34747-9_19"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Inostroza-Ponta, M., Berretta, R., Moscato, P.: QAPgrid: A two level QAP-based approach for large-scale data analysis and visualization. PloS One\u00a06(1), e14468 (2011)","DOI":"10.1371\/journal.pone.0014468"},{"key":"29_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-76931-6_14","volume-title":"Progress in Artificial Life","author":"M. Inostroza-Ponta","year":"2007","unstructured":"Inostroza-Ponta, M., Mendes, A., Berretta, R., Moscato, P.: An integrated QAP-based approach to visualize patterns of gene expression similarity. In: Randall, M., Abbass, H.A., Wiles, J. (eds.) ACAL 2007. LNCS (LNAI), vol.\u00a04828, pp. 156\u2013167. Springer, Heidelberg (2007)"},{"issue":"3","key":"29_CR22","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys (CSUR)\u00a031(3), 264\u2013323 (1999)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"29_CR23","series-title":"Seminumerical algorithms","first-page":"229","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1969","unstructured":"Knuth, D.E.: The Art of Computer Programming. Seminumerical algorithms, vol.\u00a02, pp. 229\u2013279. Addison-Wesley, Reading (1969)"},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11732242_7","volume-title":"Applications of Evolutionary Computing","author":"P. Mahata","year":"2006","unstructured":"Mahata, P., Costa, W., Cotta, C., Moscato, P.: Hierarchical clustering, languages and cancer. In: Rothlauf, F. (ed.) EvoWorkshops 2006. LNCS, vol.\u00a03907, pp. 67\u201378. Springer, Heidelberg (2006)"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Marsden, J., Budden, D., Craig, H., Moscato, P.: Language individuation and marker words: Shakespeare and his Maxwell\u2019s demon. PloS One\u00a08(6), e66813 (2013)","DOI":"10.1371\/journal.pone.0066813"},{"issue":"2","key":"29_CR26","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0016-0032(96)00063-4","volume":"334","author":"M. Menndez","year":"1997","unstructured":"Menndez, M., Pardo, J., Pardo, L., Pardo, M.: The Jensen-Shannon divergence. Journal of the Franklin Institute\u00a0334(2), 307\u2013318 (1997)","journal-title":"Journal of the Franklin Institute"},{"key":"29_CR27","first-page":"10","volume":"1","author":"A.-C.N. Ngomo","year":"2006","unstructured":"Ngomo, A.-C.N.: Clique-based clustering. Evaluation\u00a01, 10 (2006)","journal-title":"Evaluation"},{"issue":"6","key":"29_CR28","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1016\/j.physa.2008.11.018","volume":"388","author":"O.A. Rosso","year":"2009","unstructured":"Rosso, O.A., Craig, H., Moscato, P.: Shakespeare and other english renaissance authors as characterized by information theory complexity quantifiers. Physica A: Statistical Mechanics and its Applications\u00a0388(6), 916\u2013926 (2009)","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"4","key":"29_CR29","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jpdc.2009.01.003","volume":"69","author":"M.C. Schmidt","year":"2009","unstructured":"Schmidt, M.C., Samatova, N.F., Thomas, K., Park, B.-H.: A scalable, parallel algorithm for maximal clique enumeration. J. Parallel Distrib. Comput.\u00a069(4), 417\u2013428 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"14","key":"29_CR30","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1093\/bioinformatics\/btg232","volume":"19","author":"R. Sharan","year":"2003","unstructured":"Sharan, R., Maron-Katz, A., Shamir, R.: CLICK and EXPANDER: A system for clustering and visualizing gene expression data. Bioinformatics\u00a019(14), 1787\u20131799 (2003)","journal-title":"Bioinformatics"},{"key":"29_CR31","unstructured":"Zemel, R.S., Carreira-Perpin, M.A.: Proximity graphs for clustering and manifold learning, pp. 225\u2013232. MIT Press (2005)"}],"container-title":["Lecture Notes in Computer Science","Artificial Life and Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14803-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T16:57:43Z","timestamp":1747414663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14803-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319148021","9783319148038"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14803-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}