Clustering is a technique that use to finding similar information within the cluster. The data has same things in the dataset cluster use to together base on the most and the minimum of the data. Clustering is procedures in which matter that clustered and divided group are together, based the rule to maximize the in the group resemblance and minimizing the inter-group resemblance. In other words, it is a combination of links, associations and whole patterns contained in massive databases however hidden or unknown. So as to perform the analysis, we'd like software system and tools. Set of tool, that are permit to user analyze information for various perspectives and angles, in order to find meaningful relationships. Cluster if similar information in the information set is the data is separate in the file. Clustering if similar data in the dataset is the data is separate in the file. In this paper, we study and compare the varying algorithms and technique used the group analysis that is used for RAPIDMINER. The best working on datasets for these type of cluster. Different clustering algorithms have been developed different results. In the paper we analysis two type of clustering for Algorithm: x-Mean &k-Mean cluster algorithm that compute the work in two type of cluster algorithm that work on correct classes. In the test of one field of Mall Customers data set working on RAPID MINER tools to find correct cluster.
| Published in | International Journal of Wireless Communications and Mobile Computing (Volume 8, Issue 2) |
| DOI | 10.11648/j.wcmc.20200802.13 |
| Page(s) | 39-47 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2024. Published by Science Publishing Group |
Clustering, Mall Customers, Rapid Miner, Cluster Technique, Mall Customers, K-mean Clustering
| [1] | G. Chakra borty and D. D. S Garla, (2011) SAS Institute INC., USA “Compare the probability and k-mean,” SAS world Forum, Management. |
| [2] | Jeffrey R Russell& Robert F Engle. Predicting changing foreign exchange price quoted by time-series model of specific situations. J. Empirical Finance, 4: 187-2212, 1997. |
| [3] | Principles of Data Mining Max Bramer Third Edition. |
| [4] | S. Vivek (2018) Clustering algorithms for customer segmentation, vol 1. |
| [5] | Chen G, Tanaka T, Banerjee N, Zhang M and Kom (2018): Statistics Sinica “comparison clustering algorithms analysis to express data”, vol 12. |
| [6] | Osama Abbas (2008) IAJIT “Compare b/w data clustering Algorithms”, Vol. 5. |
| [7] | Andrew: “Hierarchical and K-means Clustering - Tutorial”. |
| [8] | R. Kaur and A. Joshi (2013) CSSE “Review: Comparison of clustering in data mining”. |
| [9] | S. Ben and R. Zadeh (2018) Stanford.edu “Theorem for Clustering”. |
| [10] | “Albert Einstein” one must, above all, be a sheep oneself. |
| [11] | “Levon Helm” crowd is just as important. |
| [12] | DATA MINING AND KNOWLEDGE DISCOVERY HANDBOOK. |
| [13] | D. S (2010) 19th international conference on World wide web Web-scale k-means clustering Proceedings of the, pp. 1177-1178. |
| [14] | C. F, A. E. R (2002) Journal of the American statistical Association Model-based clustering, discriminant analysis, and density estimation, pp. 611-631. |
| [15] | A. K. Jain, (2009) 19 International Conference in Pattern Recognition “Data clustering: 50 years beyond K-means”. |
APA Style
Muhammad Umer Ijaz. (2021). Analysis of Clustering Algorithms for Mall. International Journal of Wireless Communications and Mobile Computing, 8(2), 39-47. https://doi.org/10.11648/j.wcmc.20200802.13
ACS Style
Muhammad Umer Ijaz. Analysis of Clustering Algorithms for Mall. Int. J. Wirel. Commun. Mobile Comput. 2021, 8(2), 39-47. doi: 10.11648/j.wcmc.20200802.13
AMA Style
Muhammad Umer Ijaz. Analysis of Clustering Algorithms for Mall. Int J Wirel Commun Mobile Comput. 2021;8(2):39-47. doi: 10.11648/j.wcmc.20200802.13
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.wcmc.20200802.13,
author = {Muhammad Umer Ijaz},
title = {Analysis of Clustering Algorithms for Mall},
journal = {International Journal of Wireless Communications and Mobile Computing},
volume = {8},
number = {2},
pages = {39-47},
doi = {10.11648/j.wcmc.20200802.13},
url = {https://doi.org/10.11648/j.wcmc.20200802.13},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.wcmc.20200802.13},
abstract = {Clustering is a technique that use to finding similar information within the cluster. The data has same things in the dataset cluster use to together base on the most and the minimum of the data. Clustering is procedures in which matter that clustered and divided group are together, based the rule to maximize the in the group resemblance and minimizing the inter-group resemblance. In other words, it is a combination of links, associations and whole patterns contained in massive databases however hidden or unknown. So as to perform the analysis, we'd like software system and tools. Set of tool, that are permit to user analyze information for various perspectives and angles, in order to find meaningful relationships. Cluster if similar information in the information set is the data is separate in the file. Clustering if similar data in the dataset is the data is separate in the file. In this paper, we study and compare the varying algorithms and technique used the group analysis that is used for RAPIDMINER. The best working on datasets for these type of cluster. Different clustering algorithms have been developed different results. In the paper we analysis two type of clustering for Algorithm: x-Mean &k-Mean cluster algorithm that compute the work in two type of cluster algorithm that work on correct classes. In the test of one field of Mall Customers data set working on RAPID MINER tools to find correct cluster.},
year = {2021}
}
TY - JOUR T1 - Analysis of Clustering Algorithms for Mall AU - Muhammad Umer Ijaz Y1 - 2021/08/04 PY - 2021 N1 - https://doi.org/10.11648/j.wcmc.20200802.13 DO - 10.11648/j.wcmc.20200802.13 T2 - International Journal of Wireless Communications and Mobile Computing JF - International Journal of Wireless Communications and Mobile Computing JO - International Journal of Wireless Communications and Mobile Computing SP - 39 EP - 47 PB - Science Publishing Group SN - 2330-1015 UR - https://doi.org/10.11648/j.wcmc.20200802.13 AB - Clustering is a technique that use to finding similar information within the cluster. The data has same things in the dataset cluster use to together base on the most and the minimum of the data. Clustering is procedures in which matter that clustered and divided group are together, based the rule to maximize the in the group resemblance and minimizing the inter-group resemblance. In other words, it is a combination of links, associations and whole patterns contained in massive databases however hidden or unknown. So as to perform the analysis, we'd like software system and tools. Set of tool, that are permit to user analyze information for various perspectives and angles, in order to find meaningful relationships. Cluster if similar information in the information set is the data is separate in the file. Clustering if similar data in the dataset is the data is separate in the file. In this paper, we study and compare the varying algorithms and technique used the group analysis that is used for RAPIDMINER. The best working on datasets for these type of cluster. Different clustering algorithms have been developed different results. In the paper we analysis two type of clustering for Algorithm: x-Mean &k-Mean cluster algorithm that compute the work in two type of cluster algorithm that work on correct classes. In the test of one field of Mall Customers data set working on RAPID MINER tools to find correct cluster. VL - 8 IS - 2 ER -
Information
Email: