{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T09:32:19Z","timestamp":1768815139529,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"10-11","license":[{"start":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T00:00:00Z","timestamp":1620259200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T00:00:00Z","timestamp":1620259200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s10472-021-09749-z","type":"journal-article","created":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T06:03:00Z","timestamp":1620280980000},"page":"1013-1033","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Breaking the curse of dimensionality: hierarchical Bayesian network model for multi-view clustering"],"prefix":"10.1007","volume":"89","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0050-7173","authenticated-orcid":false,"given":"Hasna","family":"Njah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salma","family":"Jamoussi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walid","family":"Mahdi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,6]]},"reference":[{"key":"9749_CR1","unstructured":"Bellman, R.E.: Adaptive control processes: a guided tour. Princeton university press, (2015)"},{"key":"9749_CR2","unstructured":"Demartines, Pierre.: Analyse de donn\u00e9es par r\u00e9seaux de neurones auto-organis\u00e9s. Diss. Grenoble INPG, (1994)"},{"key":"9749_CR3","unstructured":"He, J., Kumar, S., and Chang, S-F.: On the difficulty of nearest neighbor search. arXiv preprint arXiv:1206.6411 (2012)"},{"key":"9749_CR4","doi-asserted-by":"crossref","unstructured":"Toma\u0161ev, N.: Taming the empirical hubness risk in many dimensions. Proceedings of the 2015 SIAM International Conference on Data Mining. Society for Industrial and Applied Mathematics, (2015)","DOI":"10.1137\/1.9781611974010.100"},{"issue":"1","key":"9749_CR5","first-page":"6209","volume":"18","author":"F Angiulli","year":"2017","unstructured":"Angiulli, F.: On the behavior of intrinsically high-dimensional spaces: distances, direct and reverse nearest neighbors, and hubness. J. Mach. Learn. Res. 18(1), 6209\u20136268 (2017)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"9749_CR6","first-page":"1220","volume":"8","author":"R Elankavi","year":"2017","unstructured":"Elankavi, R., Kalaiprasath, R., Udayakumar, D.R.: A fast clustering algorithm for high-dimensional data. Intl J. Civil Eng. Technol. (Ijciet). 8(5), 1220\u20131227 (2017)","journal-title":"Intl J. Civil Eng. Technol. (Ijciet)"},{"issue":"4","key":"9749_CR7","first-page":"340","volume":"2","author":"I Assent","year":"2012","unstructured":"Assent, I.: Clustering high dimensional data. Wiley Interdiscip Rev: Data Mining Knowl Discovery. 2(4), 340\u2013350 (2012)","journal-title":"Wiley Interdiscip Rev: Data Mining Knowl Discovery"},{"key":"9749_CR8","unstructured":"Friedman, N., Goldszmidt, M.: Learning Bayesian Networks from Data. Morgan Kaufmann, (1999)"},{"issue":"1","key":"9749_CR9","first-page":"431","volume":"20","author":"S Wang","year":"2019","unstructured":"Wang, S., Gittens, A., Mahoney, M.W.: Scalable kernel K-means clustering with Nystr\u00f6m approximation: relative-error bounds. J. Mach. Learn. Res. 20(1), 431\u2013479 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"9749_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2934688","volume":"11","author":"J Shao","year":"2016","unstructured":"Shao, J., Yang, Q., Dang, H.-V., Schmidt, B., Kramer, S.: Scalable clustering by iterative partitioning and point attractor representation. ACM Trans. Knowl. Discovery Data (TKDD). 11(1), 1\u201323 (2016)","journal-title":"ACM Trans. Knowl. Discovery Data (TKDD)"},{"key":"9749_CR11","doi-asserted-by":"crossref","unstructured":"Mai, S.T., et al. \"Scalable and interactive graph clustering algorithm on multicore CPUs.\" 2017 IEEE 33rd International Conference on Data Engineering (ICDE). IEEE, (2017)","DOI":"10.1109\/ICDE.2017.94"},{"issue":"2","key":"9749_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/TSUSC.2017.2690378","volume":"2","author":"MD Vishwasrao","year":"2017","unstructured":"Vishwasrao, M.D., Sangaiah, A.K.: ESCAPE: effective scalable clustering approach for parallel execution of continuous position-based queries in position monitoring applications. IEEE Trans. Sustain. Comput. 2(2), 49\u201361 (2017)","journal-title":"IEEE Trans. Sustain. Comput."},{"issue":"3","key":"9749_CR13","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.jesit.2017.06.004","volume":"5","author":"S Chormunge","year":"2018","unstructured":"Chormunge, S., Jena, S.: Correlation based feature selection with clustering for high dimensional data. J. Electric. Syst. Inf. Technol. 5(3), 542\u2013549 (2018)","journal-title":"J. Electric. Syst. Inf. Technol."},{"issue":"6","key":"9749_CR14","doi-asserted-by":"publisher","first-page":"2366","DOI":"10.1214\/16-AOS1423B","volume":"44","author":"B Nadler","year":"2016","unstructured":"Nadler, B.: Discussion of\" influential features PCA for high dimensional clustering\". Ann. Stat. 44(6), 2366\u20132371 (2016)","journal-title":"Ann. Stat."},{"key":"9749_CR15","doi-asserted-by":"crossref","unstructured":"Islam, AKMT, et al. RESTRAC: REference Sequence Based Space TRAnsformation for Clustering. 2017 IEEE International Conference on Data Mining Workshops (ICDMW). IEEE, (2017)","DOI":"10.1109\/ICDMW.2017.66"},{"issue":"3","key":"9749_CR16","first-page":"267","volume":"32","author":"W-C Chang","year":"1983","unstructured":"Chang, W.-C.: On using principal components before separating a mixture of two multivariate normal distributions. J. R. Stat. Soc.: Ser. C: Appl. Stat. 32(3), 267\u2013275 (1983)","journal-title":"J. R. Stat. Soc.: Ser. C: Appl. Stat."},{"key":"9749_CR17","doi-asserted-by":"crossref","unstructured":"Stutz, John, and Peter Cheeseman. \"AutoClass\u2014A Bayesian Approach to Classification.\" Maximum entropy and Bayesian methods. Springer, Dordrecht, 117\u2013126 (1996)","DOI":"10.1007\/978-94-009-0107-0_13"},{"issue":"1","key":"9749_CR18","doi-asserted-by":"publisher","first-page":"2246","DOI":"10.1016\/j.artint.2011.09.003","volume":"176","author":"T Chen","year":"2012","unstructured":"Chen, T., Zhang, N.L., Liu, T., Poon, K.M., Wang, Y.: Model-based multidimensional clustering of categorical data. Artif. Intell. 176(1), 2246\u20132269 (2012)","journal-title":"Artif. Intell."},{"issue":"6","key":"9749_CR19","first-page":"697","volume":"5","author":"NL Zhang","year":"2004","unstructured":"Zhang, N.L.: Hierarchical latent class models for cluster analysis. J. Mach. Learn. Res. 5(6), 697\u2013723 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"9749_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.aap.2012.10.016","volume":"51","author":"D O\u00f1a","year":"2013","unstructured":"O\u00f1a, D., Juan, et al.: Analysis of traffic accidents on rural highways using latent class clustering and Bayesian networks. Accid. Anal. Prev. 51, 1\u201310 (2013)","journal-title":"Accid. Anal. Prev."},{"issue":"6","key":"9749_CR21","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/TPAMI.2010.145","volume":"33","author":"S Harmeling","year":"2010","unstructured":"Harmeling, S., Williams, C.K.I.: Greedy learning of binary latent trees. IEEE Trans. Pattern Anal. Mach. Intell. 33(6), 1087\u20131097 (2010)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9749_CR22","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1613\/jair.3879","volume":"47","author":"R Mourad","year":"2013","unstructured":"Mourad, R., Sinoquet, C., Zhang, N.L., Liu, T., Leray, P.: A survey on latent tree models and applications. J. Artif. Intell. Res. 47, 157\u2013203 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"9749_CR23","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/sim.7196","volume":"37","author":"GB Cybis","year":"2018","unstructured":"Cybis, G.B., Sinsheimer, J.S., Bedford, T., Rambaut, A., Lemey, P., Suchard, M.A.: Bayesian nonparametric clustering in phylogenetics: modeling antigenic evolution in influenza. Stat. Med. 37(2), 195\u2013206 (2018)","journal-title":"Stat. Med."},{"key":"9749_CR24","doi-asserted-by":"crossref","unstructured":"He, C., et al. Structure learning of bayesian network with latent variables by weight-induced refinement. Proceedings of the 5th International Workshop on Web-scale Knowledge Representation Retrieval & Reasoning. 2014","DOI":"10.1145\/2663792.2663798"},{"key":"9749_CR25","doi-asserted-by":"crossref","unstructured":"Spirtes, P. et al. Causation, prediction, and search. MIT press, (2000)","DOI":"10.7551\/mitpress\/1754.001.0001"},{"issue":"6","key":"9749_CR26","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/79.543975","volume":"13","author":"TK Moon","year":"1996","unstructured":"Moon, T.K.: The expectation-maximization algorithm. IEEE Signal Process. Mag. 13(6), 47\u201360 (1996)","journal-title":"IEEE Signal Process. Mag."},{"key":"9749_CR27","doi-asserted-by":"crossref","unstructured":"Njah, H., et al. A new equilibrium criterion for learning the cardinality of latent variables. 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI). IEEE, (2015)","DOI":"10.1109\/ICTAI.2015.138"},{"key":"9749_CR28","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987)","journal-title":"J. Comput. Appl. Math."},{"key":"9749_CR29","unstructured":"Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.: Density-Based Spatial Clustering of Applications with Noise, (1996)"},{"key":"9749_CR30","unstructured":"MacQueen, J. B.: Some methods for classification and analysis of MultiVariate observations. University of California Press, pp. 281-297. (1967)"},{"key":"9749_CR31","unstructured":"Pelleg, D., Moore, A. W. & others. X-means: Extending K-means with Efficient Estimation of the Number of Clusters, (2000)"},{"key":"9749_CR32","doi-asserted-by":"crossref","unstructured":"Santos, J.M., Embrechts, M.: On the Use of the Adjusted Rand Index as a Metric for Evaluating Supervised Classification. International conference on artificial neural networks. Springer, Berlin, Heidelberg, 2009","DOI":"10.1007\/978-3-642-04277-5_18"},{"key":"9749_CR33","doi-asserted-by":"crossref","unstructured":"Yao, Y. Y.: Information-theoretic measures for knowledge discovery and data mining. Entropy measures, maximum entropy principle and emerging applications. Springer, Berlin, Heidelberg. 115\u2013136 (2003)","DOI":"10.1007\/978-3-540-36212-8_6"},{"issue":"4","key":"9749_CR34","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/BF02293801","volume":"46","author":"RD Bock","year":"1981","unstructured":"Bock, R.D., Aitkin, M.: Marginal maximum likelihood estimation of item parameters: application of an EM algorithm. Psychometrika. 46(4), 443\u2013459 (1981)","journal-title":"Psychometrika"},{"key":"9749_CR35","unstructured":"Zuk, O., Margel, S., Domany, E.: On the number of samples needed to learn the correct structure of a Bayesian network. arXiv preprint arXiv:1206.6862 (2012)"},{"key":"9749_CR36","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Elsevier, (2014)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09749-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-021-09749-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09749-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T08:28:34Z","timestamp":1636705714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-021-09749-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,6]]},"references-count":36,"journal-issue":{"issue":"10-11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["9749"],"URL":"https:\/\/doi.org\/10.1007\/s10472-021-09749-z","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,6]]},"assertion":[{"value":"25 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}