{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:48:44Z","timestamp":1781110124998,"version":"3.54.1"},"reference-count":32,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:p>This article describes how recently, because of the curse of dimensionality in high dimensional data, a significant amount of research has been conducted on subspace clustering aiming at discovering clusters embedded in any possible attributes combination. The main goal of subspace clustering algorithms is to find all clusters in all subspaces. Previous studies have mostly been generating redundant subspace clusters, leading to clustering accuracy loss and also increasing the running time of the algorithms. A bottom-up density-based approach is suggested in this article, in which the cluster structure serves as a similarity measure to generate the optimal subspaces which result in raising the accuracy of the subspace clustering. Based on this idea, the algorithm discovers similar subspaces by considering similarity in their cluster structure, then combines them and the data in the new subspaces would be clustered again. Finally, the algorithm determines all the subspaces and also finds all clusters within them. Experiments on various synthetic and real datasets show that the results of the proposed approach are significantly better in quality and runtime than the state-of-the-art on clustering high-dimensional data.<\/jats:p>","DOI":"10.4018\/ijiit.2018070103","type":"journal-article","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T05:13:34Z","timestamp":1524546814000},"page":"38-55","source":"Crossref","is-referenced-by-count":2,"title":["Subspace Clustering for High-Dimensional Data Using Cluster Structure Similarity"],"prefix":"10.4018","volume":"14","author":[{"given":"Kavan","family":"Fatehi","sequence":"first","affiliation":[{"name":"Yazd University, Department of Computer Engineering, Yazd, Islamic Republic of Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohsen","family":"Rezvani","sequence":"additional","affiliation":[{"name":"Shahrood University of Technology, Department of Computer Engineering, Shahrood, Islamic Republic of Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mansoor","family":"Fateh","sequence":"additional","affiliation":[{"name":"Shahrood University of Technology, Department of Computer Engineering, Shahrood, Islamic Republic of Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad-Reza","family":"Pajoohan","sequence":"additional","affiliation":[{"name":"Yazd University, Department of Computer Engineering, Yazd, Islamic Republic of Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJIIT.2018070103-0","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71703-4_15"},{"key":"IJIIT.2018070103-1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304188"},{"key":"IJIIT.2018070103-2","unstructured":"Agrawal, R., Gehrke, J. E., Gunopulos, D., & Raghavan, P. (1999). U.S. Patent No. 6,003,029. Washington, DC: U.S. Patent and Trademark Office."},{"key":"IJIIT.2018070103-3","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1062"},{"key":"IJIIT.2018070103-4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.49"},{"key":"IJIIT.2018070103-5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2004.10087"},{"key":"IJIIT.2018070103-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2012.12.008"},{"key":"IJIIT.2018070103-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.06.004"},{"key":"IJIIT.2018070103-8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.224"},{"key":"IJIIT.2018070103-9","unstructured":"Dongen, S. (2000). Performance criteria for graph clustering and Markov cluster experiments."},{"key":"IJIIT.2018070103-10","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-013-9400-4"},{"key":"IJIIT.2018070103-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.11.003"},{"key":"IJIIT.2018070103-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2015.05.016"},{"key":"IJIIT.2018070103-13","first-page":"443","article-title":"MAFIA: Efficient and scalable subspace clustering for very large data sets.","author":"S.Goil","year":"1999","journal-title":"Proceedings of the 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"IJIIT.2018070103-14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.68"},{"key":"IJIIT.2018070103-15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.23"},{"key":"IJIIT.2018070103-16","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.5"},{"key":"IJIIT.2018070103-17","doi-asserted-by":"publisher","DOI":"10.1145\/1497577.1497578"},{"key":"IJIIT.2018070103-18","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1057"},{"key":"IJIIT.2018070103-19","first-page":"1214","article-title":"Using diversity in cluster ensembles.","author":"L. I.Kuncheva","year":"2004","journal-title":"Proceedings of the IEEE International Conference on Systems, man and cybernetics"},{"key":"IJIIT.2018070103-20","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-013-0317-y"},{"key":"IJIIT.2018070103-21","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623726"},{"key":"IJIIT.2018070103-22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.85"},{"key":"IJIIT.2018070103-23","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007731"},{"key":"IJIIT.2018070103-24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.106"},{"key":"IJIIT.2018070103-25","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564739"},{"key":"IJIIT.2018070103-26","article-title":"Deep learning for steganalysis via convolutional neural networks.","volume":"9409","author":"Y.Qian","year":"2015","journal-title":"Media Watermarking, Security, and Forensics"},{"key":"IJIIT.2018070103-27","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0258-x"},{"key":"IJIIT.2018070103-28","first-page":"583","article-title":"Cluster ensembles- a knowledge reuse framework for combining multiple partitions.","volume":"3","author":"A.Strehl","year":"2002","journal-title":"Journal of Machine Learning Research"},{"key":"IJIIT.2018070103-29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09259-1_11"},{"key":"IJIIT.2018070103-30","article-title":"Facial feature point detection: A comprehensive survey.","author":"N.Wang","year":"2017","journal-title":"Neurocomputing"},{"key":"IJIIT.2018070103-31","unstructured":"Zimek, A. (2013). Clustering High-Dimensional Data."}],"container-title":["International Journal of Intelligent Information Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=204952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,5]],"date-time":"2022-05-05T15:53:06Z","timestamp":1651765986000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJIIT.2018070103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":32,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.4018\/ijiit.2018070103","relation":{},"ISSN":["1548-3657","1548-3665"],"issn-type":[{"value":"1548-3657","type":"print"},{"value":"1548-3665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}