{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:10:47Z","timestamp":1781107847604,"version":"3.54.1"},"reference-count":11,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<p>High dimensions have a devastating effect on the FCM algorithm and similar algorithms. One effect is that the prototypes run into the centre of gravity of the entire data set. The objective function must have a local minimum in the centre of gravity that causes FCM\u2019s behaviour. In this paper, examine this problem. This paper answers the following questions: How many dimensions are necessary to cause an ill behaviour of FCM? How does the number of prototypes influence the behaviour? Why has the objective function a local minimum in the centre of gravity? How must FCM be initialised to avoid the local minima in the centre of gravity? To understand the behaviour of the FCM algorithm and answer the above questions, the authors examine the values of the objective function and develop three test environments that consist of artificially generated data sets to provide a controlled environment. The paper concludes that FCM can only be applied successfully in high dimensions if the prototypes are initialized very close to the cluster centres.<\/p>","DOI":"10.4018\/ijfsa.2011010101","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:21:14Z","timestamp":1319026874000},"page":"1-16","source":"Crossref","is-referenced-by-count":67,"title":["Fuzzy C-Means in High Dimensional Spaces"],"prefix":"10.4018","volume":"1","author":[{"given":"Roland","family":"Winkler","sequence":"first","affiliation":[{"name":"German Aerospace Center, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Klawonn","sequence":"additional","affiliation":[{"name":"Ostfalia University, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rudolf","family":"Kruse","sequence":"additional","affiliation":[{"name":"Otto-von-Guericke University, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijfsa.2011010101-0","doi-asserted-by":"crossref","unstructured":"Aggarwal, C. C., & Yu, P. S. (2001). Outlier detection for high dimensional data. In Proceedings of the 2001 ACM SIGMOD international conference on Management of data (pp. 37-46).","DOI":"10.1145\/376284.375668"},{"key":"ijfsa.2011010101-1","doi-asserted-by":"crossref","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999). When is nearest neighbor meaningful? In ICDT '99: Proceedings of the 7th International Conference on Database Theory (LNCS 1540, pp. 217-235).","DOI":"10.1007\/3-540-49257-7_15"},{"key":"ijfsa.2011010101-2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-0450-1","author":"J. C.Bezdek","year":"1981","journal-title":"Pattern Recognition with Fuzzy Objective Function Algorithms"},{"key":"ijfsa.2011010101-3","unstructured":"Donoho, D. (2000, August). High-dimensional Data Analysis: the Curses and Blessings of Dimensionality. Paper presented at the conference \u201cMath Challenges of the 21st Century\u201d of the American Mathematics Society, Los Angeles."},{"key":"ijfsa.2011010101-4","doi-asserted-by":"publisher","DOI":"10.1080\/01969727308546046"},{"key":"ijfsa.2011010101-5","doi-asserted-by":"crossref","unstructured":"Gionis, A., Hinneburg, A., Papadimitriou, S., & Tsaparas, P. (2005). Dimension induced clustering. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining (pp. 51-60).","DOI":"10.1145\/1081870.1081880"},{"key":"ijfsa.2011010101-6","unstructured":"Hinneburg, A., & Keim, D. A. (1999). Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In Proceedings of 25th International Conference on Very Large Data Bases (pp. 506-517)."},{"key":"ijfsa.2011010101-7","author":"F.H\u00f6ppner","year":"1999","journal-title":"Fuzzy Cluster Analysis"},{"key":"ijfsa.2011010101-8","first-page":"3","article-title":"Advances in fuzzy clustering and its applications","author":"R.Kruse","year":"2007","journal-title":"Fundamentals of Fuzzy Clustering"},{"key":"ijfsa.2011010101-9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-662-08968-2_16","article-title":"The challenges of clustering high dimensional data","author":"M.Steinbach","year":"2004","journal-title":"New Directions in Statistical Physics: Econophysics, Bioinformatics, and Pattern Recognition"},{"key":"ijfsa.2011010101-10","first-page":"141","article-title":"Learning high-dimensional data","author":"M.Verleysen","year":"2003","journal-title":"Limitations and future trends in neural computation"}],"container-title":["International Journal of Fuzzy System Applications"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=52051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:50:55Z","timestamp":1654120255000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijfsa.2011010101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijfsa.2011010101","relation":{},"ISSN":["2156-177X","2156-1761"],"issn-type":[{"value":"2156-177X","type":"print"},{"value":"2156-1761","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}