Open Access   Article Go Back

A Relative Computable Study of Modern Big Data Clustering Procedures for Fair Division

N.Baby Kala1 , S. Ramya2

  1. Department of Computer Science, KNG Arts College (W) Autonomous, Thanjavur, India.
  2. Department of Computer Science, KNG Arts College (W) Autonomous, Thanjavur, India.

Section:Review Paper, Product Type: Journal Paper
Volume-6 , Issue-4 , Page no. 415-423, Apr-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6i4.415423

Online published on Apr 30, 2018

Copyright © N.Baby Kala, S. Ramya . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: N.Baby Kala, S. Ramya, “A Relative Computable Study of Modern Big Data Clustering Procedures for Fair Division,” International Journal of Computer Sciences and Engineering, Vol.6, Issue.4, pp.415-423, 2018.

MLA Style Citation: N.Baby Kala, S. Ramya "A Relative Computable Study of Modern Big Data Clustering Procedures for Fair Division." International Journal of Computer Sciences and Engineering 6.4 (2018): 415-423.

APA Style Citation: N.Baby Kala, S. Ramya, (2018). A Relative Computable Study of Modern Big Data Clustering Procedures for Fair Division. International Journal of Computer Sciences and Engineering, 6(4), 415-423.

BibTex Style Citation:
@article{Kala_2018,
author = {N.Baby Kala, S. Ramya},
title = {A Relative Computable Study of Modern Big Data Clustering Procedures for Fair Division},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {4 2018},
volume = {6},
Issue = {4},
month = {4},
year = {2018},
issn = {2347-2693},
pages = {415-423},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1912},
doi = {https://doi.org/10.26438/ijcse/v6i4.415423}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i4.415423}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1912
TI - A Relative Computable Study of Modern Big Data Clustering Procedures for Fair Division
T2 - International Journal of Computer Sciences and Engineering
AU - N.Baby Kala, S. Ramya
PY - 2018
DA - 2018/04/30
PB - IJCSE, Indore, INDIA
SP - 415-423
IS - 4
VL - 6
SN - 2347-2693
ER -

VIEWS PDF XML
608 367 downloads 309 downloads
  
  
           

Abstract

The cordiality business is one of the data-rich enterprises that gets tremendous Volumes of data gushing at high Velocity with extensively Variety, Veracity, and Variability. These properties make the data examination in the cordiality business a big data issue. Meeting the clients` desires is a key factor in the neighborliness business to get a handle on the clients` dependability. To accomplish this objective, advertising experts in this industry effectively search for approaches to use their data in the most ideal way and propel their data scientific arrangements, for example, distinguishing an extraordinary market division clustering and building up a proposal framework. In this paper, we introduce an exhaustive writing audit of existing big data clustering calculations and their favorable circumstances and disservices for different utilize cases. We execute the current big data clustering calculations and give a quantitative correlation of the execution of various clustering calculations for various situations. We additionally display our experiences and proposals with respect to the appropriateness of various big data clustering calculations for various utilize cases. These suggestions will be useful for hoteliers in choosing the proper market division clustering calculation for various clustering datasets to enhance the client encounter and boost the lodging income.

Key-Words / Index Term

Hospitality, Market Segmentation, Density based Clustering, Neighborhood, Embedded Cluster, Nested Adjacent Cluster

References

[1] Jorge Luis Cavalcanti Ramos, Ricardo Euller Dantas e Silva, Joao Carlos Sedraz Silva, Rodrigo Lins Rodrigues, Alex Sandro Gomes, “A Comparative Study between Clustering Methods in Educational Data Mining”, Vol. 14, No. 8, PP. 3755 – 3761, 2016.
[2] Pranjal Dubey, Anand Rajavat, “Comparative Study Between Density Based Clustering-Dbscan and Optics”, International Journal of Advanced Computational Engineering and Networking, Vol. 4, No.12, Dec.2016.
[3] C. Pizzuti, D. Talia, “P-AutoClass: scalable parallel clustering for mining large data sets”, IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 3, PP. 629 – 641, 2003.
[4] Massimo Brescia, Stefano Cavuoti, Maurizio Paolillo, Giuseppe Longo, Thomas Puzia, “The detection of globular clusters in galaxies as a data mining problem”, Monthly Notices of the Royal Astronomical Society, Vol. 421, No. 2, PP. 1155 – 1165, 2012.
[5] R. J. Dodd, “Data mining in the young open cluster IC 2391”, Monthly Notices of the Royal Astronomical Society, Vol. 355, No. 3, PP. 959 – 972, 2004.
[6] Jian Hou, Huijun Gao, Xuelong Li, “DSets-DBSCAN: A Parameter-Free Clustering Algorithm”, IEEE Transactions on Image Processing, Vol. 25, No. 7, PP. 3182 – 3193, July 2016.
[7] Wenbin Wu, Mugen Peng, “A Data Mining Approach Combining K -Means Clustering With Bagging Neural Network for Short-Term Wind Power Forecasting”, IEEE Internet of Things Journal, Vol. 4, No. 4, PP. 979 – 986, 2017.
[8] Yaling Xun, Jifu Zhang, Xiao Qin, Xujun Zhao, “FiDoop-DP: Data Partitioning in Frequent Itemset Mining on Hadoop Clusters”, IEEE Transactions on Parallel and Distributed Systems, Vol. 28, No. 1, PP. 101 – 114, 2017.
[9] Foued Saâdaoui, Pierre R. Bertrand, Gil Boudet, Karine Rouffiac, Frédéric Dutheil, Alain Chamoux, “A Dimensionally Reduced Clustering Methodology for Heterogeneous Occupational Medicine Data Mining”, IEEE Transactions on NanoBioscience, Vol. 14, No. 7, PP. 707 – 715, 2015.
[10] Daniele Casagrande, Mario Sassano, Alessandro Astolfi, “Hamiltonian-Based Clustering: Algorithms for Static and Dynamic Clustering in Data Mining and Image Processing”, IEEE Control Systems, Vol. 32, No. 4, PP. 74 – 91, 2012.
[11] Nagaraju S, Manish Kashyap, Mahua Bhattacharya, “A variant of DBSCAN algorithm to find embedded and nested adjacent clusters”, Signal Processing and Integrated Networks (SPIN), Feb. 2016.
[12] Sanjay Kumar Shukla, Manoj Kumar Tiwari, “GA Guided Cluster Based Fuzzy Decision Tree for Reactive Ion Etching Modeling: A Data Mining Approach” IEEE Transactions on Semiconductor Manufacturing, Vol. 25, No. 1, PP. 45 – 56, 2012.
[13] Melanie Po-Leen Ooi, Eric Kwang Joo Joo, Ye Chow Kuang, Serge Demidenko, Lindsay Kleeman, Chris Wei Keong Chan, “Getting More From the Semiconductor Test: Data Mining With Defect-Cluster Extraction”, IEEE Transactions on Instrumentation and Measurement, Vol. 60, No. 10, PP. 3300 – 3317, 2011.
[14] Dilhan Perera, Judy Kay, Irena Koprinska, Kalina Yacef, Osmar R. Zaïane, “Clustering and Sequential Pattern Mining of Online Collaborative Learning Data”, IEEE Transactions on Knowledge and Data Engineering, Vol. 21, No. 6, PP. 759 – 772, 2009.
[15] Chun-Hao Chen, Vincent S. Tseng, Tzung-Pei Hong, “Cluster-Based Evaluation in Fuzzy-Genetic Data Mining”, IEEE Transactions on Fuzzy Systems, Vol. 16, No. 1, PP. 249 – 262, 2008.
[16] V.Maniraj, S.Malarvizhi, “A Real Time fraud Rank Identification using Semantic Relation Analysis on Mobile Web Application”, International Journal of Computer Sciences and Engineering, Vol.4, Issue.4, pp.372-378, 2016.
[17] Xiangyang Li, Nong Ye, “A supervised clustering and classification algorithm for mining data with mixed variables”, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, Vol. 36, No. 2, PP. 396 – 406, 2006,
[18] V. S. Tseng, Ching-Pin Kao, “Efficiently mining gene expression data via a novel parameterless clustering method”, IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 2, No. 4, PP. 355 – 365, 2005.