satisfactory patient queuing system to limit patient waits and patient congestion is a specific problem confronted by most of the hospitals. Unavoidable and irritating waits for prolonged intervals result in generous human efforts, misuse of time and also raise the dissatisfaction persisted by patients. For each individual in the line, the absolute treatment time of overall patients leading him endures the time that fellow should stay. It could be helpful and ideal if patients could have the knowledge about the treatment design and learn the foreseen time for holding up. Thus, a Patient Treatment Time Prediction (PTTP) method is used to estimate the delay time of treatment activities for an individual. We make use of patient factual records of different clinical centers to get a person’s treatment time consumption procedure for each treatment duty. Over the vast extent, and practical data set, the treatment time for an individual in the line of each operation is anticipated. Build upon the forecast delay time, a Queuing Recommendation (QR) process is produced. Queuing Recommendation framework computes and predicts the proficiency and helpful treatment schedule prescribed for the patient. To accomplish this, patient records are collected from different clinical centers and stored in the Hadoop environment. Enhanced Random Forest (RF) technique is used to educate the treatment time consumption. Thus, every individual in line can be suggested completing their treatment activities in the easiest way and with the appropriate time.

Waiting time, PTTP, Queuing Recommendation, Random Forest, Hadoop

[1] Jianguo Chen, Kenli Li, Zuho Tang, Kashif Bilal and Keqin Li, “A Parallel Patient Treatment Time Prediction Algorithm and Its Applications in Hospital Queuing Recommendation in a Big Data Environment”, Journal of IEEE Access, Vol.4, pp.1767-1783, 2016.
[2] S. Tyree, K. Q. Weinberger, K. Agarwal and J. Paykin, “Parallel Boosted Regression Trees for Web Search Ranking ”, In the Proceedings of the 20th International Conference World Wide Web ( WWW), pp.587-396, 2012.
[3] G. Yu, N. A. Goussies, J. Yuan, and Z. Liu, “Fast Action Detection via Discriminative Random Forest Voting and Top-K Subvolume Search”, IEEE Trans. Multimedia, Vol.13, No.3, pp.507-517, 2011.
[4] C. Lindner, P. A. Bromiley, M. C. Ionita, and T. F. Cootes, “Robust and Accurate Shape Model Matching using Random Forest Regression-voting”, IEEE Trans. Pattern Anal. Mach. Intell., Vol.37, Issue.9, pp.1862-1874, 2015.
[5] G. Adomavicius and A. Tuzhilin, “Towards Next Generation of Recommender Systems: A Survey of the State-of-the-art and Possible Extensions”, IEEE Trans. Knowl. Data Eng., Vol.17, Issue.6, pp.734-749, 2005.
[6] Tanuja A, Swetha Ramana D, "Processing and Analyzing Big data using Hadoop", International Journal of Computer Sciences and Engineering, Vol.4, Issue.4, pp.91-94, 2016. Apache (Jan. 2015). Hadoop. [Online]. Available: http//hadoop.apache.org
[7] N. Salehi-Moghaddami, H. S. Yazdi, and H. Poostchi, “Correlation Based Splitting Criterion in Multi Branch Decision Tree,” Central Eur. J. Comput. Sci., vol. 1, no. 2, pp. 205-220, Jun. 2011.
[8] R. Fidalgo-Merino and M. Nunez, “Self-adaptive of regression trees,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 8,pp. 1659-1672, Aug. 2011
[9] G. Biau, “Analysis of a Random Forests Model,” J. Mach. Learn. Res., vol. 13, no. 1, pp. 1063–1095, Apr. 2012.
[10] E. LaxmiLydia, M. Ben Swarup ‘‘Analysis of Big Data through Hadoop Ecosystem Components like Flume, MapReduce, Pig, and Hive,’’ International Journal of Computer Sciences and Engineering, vol. 5, no. 1, pp. 21–29, Jan. 2016.