Volume 3, Issue 1, January – 2018
ISSN No:-2456 –2165
Survey on Hospital Queue Management using A
Parallel Patient Treatment Time Prediction Algorithm
Ankita Turuk1, Himanshu Bhardwaj1, Vikas Kumar1, Mrigakshi Devikar1, Sarika Kadam2
1
BE, Student, DIT , Pimpri, Pune, Maharashtra, India
2
Assistant Professor, DIT , Pimpri, Pune, Maharashtra, India
Abstract —A cross-sectional descriptive survey was
done. Questionnaires were administered to patients
United Nations agency attended the final patient
department. Observations were conjointly created on the
queuing model and therefore the service discipline at the
clinic. Queries were meant to get demographic
characteristics and therefore the time spent on the queue
by patients before being seen by a doctor, time spent
with the doctor, and helpful suggestions on a way to scale
back the time spent on the queue. Inessential and
annoying waits for long periods cause substantial human
resource and time wastage and increase the frustration
endured by patients. For each patient among the queue,
the whole treatment time of all the patients before him is
that the time that he need to wait. Queuing theory is that
the mathematical approach to the analysis of waiting
lines in any setting wherever arrival rate of subjects is
quicker than the system will handle. It's applicable to
health care settings wherever the systems have excess
capability to accommodate random variations.
Therefore, we've a bent to propose a Patient Treatment
Time Prediction (PTTP) algorithmic to predict the
waiting time for every treatment task for a patient.
We’ve got associate degree inclination to use realistic
patient information from varied hospitals to induce a
patient treatment time model for each task. Supported
this large-scale, realistic data-set, the treatment time for
every patient among this queue of each task is
anticipated. Supported the expected waiting time, a
Hospital Queuing Recommendation (HQR) system is
developed. HQR calculates Associate in Nursing predicts
a cheap and convenient treatment recognized taught for
the patient. As results of the large-scale, realistic data-set
and put together the demand for measure response, the
PTTP algorithmic and HQR system mandate potency
and low-latency response. Our planned model to counsel
associate degree economical treatment established for
patients to scale back their wait times in hospitals.
Keywords:- Computer System Organization, Embedded and
Cyber Secure System, Real Time System, HQR (Hospital
Queue Recommendation), PTTP (Patient Treatment Time
Prediction)
IJISRT18JA211 www.ijisrt.com
International Journal of Innovative Science and Research Technology
I. INTRODUCTION
Today when we go to any hospitals unit overcrowded and
lack effective patient queue management. Patient queue
management and wait time prediction group A troublesome
and sophisticated job as a results of each patient may have
utterly totally different phases, sort of a medical
examination, varied tests, e.g., a sugar level or diagnostic
test, X-rays or a CT scan, minor surgeries, throughout
treatment. We tend to tend to call each of these operations as
treatment tasks or tasks throughout this paper. Queuing
theory may be applied to the analysis of waiting lines in
health care settings. Most of health care systems have excess
capability to accommodate random variations, thus queuing
analysis may be used as short term measures, or for facilities
and resource designing. Each treatment task can have varied
time requirements for each patient that produces time
prediction and recommendation very refined. A patient is
usually required to endure examinations, inspections or tests
(refereed as tasks) in line together with his condition. In
such a case, over one task may be required for each patient.
Variety of the tasks are freelance, whereas others would
possibly have to be compelled to attend for the completion
of dependent tasks. Most patients ought to stay awaken for
unpredictable but long periods in queues, wanting forward
to their inter-communicate accomplish each treatment task.
During this paper, we tend to tend to focus on serving to
patients complete their treatment tasks during a} very
inevitable time and serving to hospitals schedule each
treatment task queue and avoid overcrowded and ineffective
queues. Walk-in patient clinic, hospital room arrivals, phone
calls from medical practitioner workplace to health
management organization, patient clinics and patient
surgeries, medical practitioner offices, pharmacy, internal
control. Health care resource and infrastructure designing
for disaster management and public health. We tend to use
vast realistic info from varied hospitals to develop a patient
treatment time consumption model. The realistic patient data
unit analyzed painstakingly and strictly supported necessary
parameters, like patient treatment begin time, end time,
patient age, and detail treatment content for each utterly
totally different task. we've an inclination to see and
calculate entirely totally different waiting times for varied
patients supported their conditions and operations performed
throughout treatment. The aim of this report is to check the
queuing system at the final patient clinic in relevance time
518
Volume 3, Issue 1, January – 2018
spent by patients on the queue and patient satisfaction. The
finding ought to be useful in rising services at the clinic.
II. LITERATURE SURVEY
According to literature survey after studying various IEEE
paper, collected some related papers and documents some of
the point describe here:
A. Self-Adaptive Induction of Regression Trees
Author:Rau´ l Fidalgo-Merino and Marlon Nu´n˜ez A new
algorithmic rule for progressive construction of binary
regression trees is bestowed. This algorithmic program,
known as SAIRT, adapts the iatrogenic model once facing
information streams involving unknown dynamics, like
gradual and abrupt perform drift, changes in sure regions of
the perform, noise, and virtual drift. It additionally handles
each symbolic and numeric attributes. The projected
formula will mechanically adapt its internal parameters and
model structure to get new patterns, counting on this
dynamics of the DataStream. SAIRT will monitor the utility
of nodes and may forget examples from chosen regions,
storing the remaining ones in native windows associated to
the leaves of the tree. On these conditions, current
regression ways want a careful configuration counting on
the dynamics of the matter. Experimentation suggests that
the projected formula obtains higher results than current
algorithms once handling knowledge streams that involve
changes with completely different speeds, noise levels,
sampling distribution of examples, and partial or complete
changes of the underlying perform.
B. Parallel Boosted Regression Trees for Web Search
Ranking
Authors: Stephen Tyree, Kilian Q. Weinberger, Kunal
Agrawal Gradient Boosted Regression Trees (GBRT) area
unit this progressive learning paradigm for machine learned
web search ranking — a site infamous for terribly giant
knowledge sets. During this paper, we tend to propose a
unique technique for parallelizing the coaching of GBRT.
Our technique parallelizes the development of the individual
regression trees and operates victimization the master-
worker paradigm as follows. The information square
measure divided among the staff. At every iteration, the
employee summarizes its data-partition victimization
histograms. The master processor uses these to create one
layer of a regression tree, and so send this layer to the
employees, permitting the staff to make histograms for
subsequent layer. Our formula rigorously orchestrates
overlap between communication and computation to realize
smart performance.Gradient Boosted Regression Trees,
Parallel CART algorithm are use to implement the system.
Since this approach relies on knowledge partitioning, and
needs atiny low quantity of communication, it generalizes to
distributed and shared memory machines, in addition as
clouds. We tend to gift experimental results on each shared
memory machines and clusters for 2 giant scale internet
search ranking information sets.
IJISRT18JA211 www.ijisrt.com
International Journal of Innovative Science and Research Technology
ISSN No:-2456 –2165
C. Correlation Based Splitting Criterion In Multi Branch
Decision Tree
Authors: Nima Salehi Moghaddami, Hadi Sadoghi Yazdi,
Hanieh Poostchi One of the foremost unremarkably used
prophetical models in classification is that the call tree (DT).
The task of a DT is to map observations to focus on values.
In the DT, every branch represents a rule. A rule’s resulting
is that the leaf of the branch and its antecedent is that the
conjunction of the options. Most applied algorithms during
this field use the conception of data Entropy and Gini Index
because the rending criterion once building a tree. during
this paper, a replacement rending criterion to create delirium
tremens is projected. A rending criterion specifies the tree’s
best rending variables well because the variable’s threshold
for additional rending. victimisation the concept from
classical Forward choice methodology and its increased
versions, the variable having the biggest absolute correlation
with the target price is chosen because the best rending
variable at every node. Then, the concept of increasing the
margin between categories during a support vector machine
(SVM) is employed to search out the simplest classification
threshold on the chosen variable. This procedure can
execute recursively at every node, till reaching the leaf
nodes. the ultimate call tree contains a shorter height than
previous strategies, that effectively reduces useless variables
and also the time required for classification of future
information. Unclassified regions also are generated
underneath the projected methodology, which might be
taken as a plus or disadvantage. The simulation results
demonstrate associate degree improvement within the
generated call tree compared to previous strategies.
D. A New Framework for Distributed Boosting Algorithm
Author:Nguyen Thi Van Uyen, Tae Choong Chung To
propose a replacement framework for building boosting
classifier on distributed databases. The most plan of our
methodology is to utilize the similarity of distributed
databases. At every spherical of the rule, every web site
processes its own information regionally, and calculates all
required data. a middle web site can collect data from all
sites and build the worldwide classifier, that is then a
classifier within the ensemble. This international classifier is
additionally employed by every distributed web site to
calculate needed data for successive spherical. By
continuation this method, we'll have associate degree
ensemble of classifier from distributed info that's virtually
just like the one engineered on the full information. The
experiment results show that the accuracy of our planned
methodology is nearly adequate to the accuracy once
applying boosting rule to the full dataset.
E. Fast Action Detection via Discriminative Random
Forest Voting and Top-K Subvolume Search
Author:Gang Yu, Norberto A. Goussies, Junsong Yuanand
Zicheng Liu Multiclass action detection in complicated
scenes may be a difficult drawback attributable to littered
backgrounds and also the giant intra-class variations in
every style of actions. to attain efficient and strong action
519
Volume 3, Issue 1, January – 2018
detection, we tend to characterize a video as a set of spatio-
temporal interest points, and find actions via finding spatio-
temporal video subvolumes of the best mutual data score
towards every action category .Arandom forest is built to
with efficiency generate discriminative votes from
individual interest points, and a quick top-K subvolume
search algorithmic program is developed to seek out all
action instances during a single spherical of search.Without
considerably degrading the performance, such a top-K
search are often performed on down-sampled score volumes
for a lot of economical localization.Experiments on a
difficult MSR Action Dataset II validate the effectiveness of
our projected multiclass action detection technique. The
detection speed is many orders of magnitude quicker than
existing strategies.
IV. SYSTEM DESIGN
Fig. 1 System Design
V. ADVANTAGES
• Decrease the patients waiting time.
• In this method, we tend to concentrate on serving to
patients complete their treatment tasks during a certain
time and serving to hospitals schedule every treatment
task queue and avoid overcrowded and ineffective
queues.
• To improve the accuracy of the information analysis
with continuous options, numerous improvement ways
of classification and regression algorithms square
measure planned.
IJISRT18JA211 www.ijisrt.com
International Journal of Innovative Science and Research Technology
ISSN No:-2456 –2165
III. PROPOSED SYSTEM
We Propose, A Patient Treatment Time Prediction (PTTP)
model is trained supported hospitals' historical information.
The previous system used PTTP algorithm for
implementation, And we are using advance PTTP algorithm
which include emergency technique. The waiting time of
every treatment task is foretold by PTTP, that is that the add
of all patients' waiting times within the current queue. Then,
per every patient's requested treatment tasks, a Hospital
Queuing-Recommendation (HQR) system recommends
associate degree economical and convenient treatment set up
with the smallest amount waiting time for the patient. As
well as in advance PTTP, if any emergency obtained then
quickly added in the current queue and notify to upcoming
patients.
VI. CONCLUSION
In this system, a PTTP algorithmic rule based mostly PTTP
model is projected. A Patient Treatment time Prediction
(PTTP) algorithmic rule is performed. The queue waiting
time of every treatment task is expected supported the
trained PTTP model. A parallel HQR system is developed
associated an economical and convenient treatment set up is
suggested for every patient. Intensive experiments and
application results show that our PTTP algorithmic rule and
HQR system deliver the goods high exactitude and
performance.
520
Volume 3, Issue 1, January – 2018 International Journal of Innovative Science and Research Technology
ISSN No:-2456 –2165

REFRENCES

[1]. K. Singh, S. C. Guntuku, A. Thakur, and C. Hota, ``Big

data analytics framework for peer-to-peer botnet
detection using random forests,'' Inf. Sci., vol. 278, pp.
488497, Sep. 2014.
[2]. S. Meng, W. Dou, X. Zhang, and J. Chen, ``KASR: A
keyword-aware service recommendation method on
Map Reduce for big data applications,’‘IEEE Trans.
Parallel Distrib. Syst., vol. 25, no. 12, pp. 32213231,
Dec. 2014.
[3]. S. Tyree, K. Q. Weinberger, K. Agrawal, and J. Paykin,
``Parallel boosted regression trees for Web search
ranking,'' in Proc. 20th Int. Conf. World Wide Web
(WWW), 2012, pp. 387396.
[4]. R. Fidalgo-Merino and M. Nunez, ``Self-adaptive
induction of regression trees,'' IEEE Trans. Pattern
Anal. Mach. Intell., vol. 33, no. 8, pp. 16591672, Aug.
2011.
[5]. G. Yu, N. A. Goussies, J. Yuan, and Z. Liu, ``Fast
action detection via discriminative random forest voting
and top-K sub volume search,'' IEEE Trans.
Multimedia, vol. 13, no. 3, pp. 507517, Jun. 2011.
[6]. 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.
[7]. G. Chrysos, P. Dagritzikos, I. Papaefstathiou, and A.
Dollas, ``HC-CART: A parallel system implementation
of data mining classi_cation and regression tree
(CART) algorithm on a multi-FPGA system,'' ACM
Trans.Archit. Code Optim., vol. 9, no. 4, pp.
47:1_47:25, Jan. 2013.
[8]. 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, no. 9, pp.
1862_1874, Sep. 2015.
[9]. N. T. Van Uyen and T. C. Chung, ``A new framework
for distributed boosting algorithm,'' in Proc. Future
Generat. Commun.Netw.(FGCN), Dec. 2007, pp.
420_423.
[10]. Y. Ben-Haim and E. Tom-Tov, ``A streaming
parallel decision tree algorithm,'' J. Mach. Learn. Res.,
vol. 11, no. 1, pp. 849_872, Oct. 2010.
[11]. L. Breiman, ``Random forests,'' Mach. Learn., vol.
45, no. 1, pp. 5_32, Oct. 2001.
[12]. A Parallel Random Forest Algorithm for Big Data
in a Spark Cloud Computing Environment Jianguo
Chen, Kenli Li, Senior Member, IEEE, Zhuo Tang,
Member, IEEE, Kashif Bilal, Shui Yu, Member, IEEE,
Chuliang Weng, Member, IEEE, and Keqin Li, Fellow,
IEEE, 1045-9219 (c) 2016 IEEE.

IJISRT18JA211 www.ijisrt.com 521