You are on page 1of 6

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056

Volume: 05 Issue: 05 | May-2018 p-ISSN: 2395-0072


Radha R1, Dr. Ravi kumar V2
1M.Tech student, Dept. of Computer Science and Engineering, Vidyavardhaka College of Engineering,
Mysore, Karnataka, India,
2Professor & HOD, Dept. of Computer Science and Engineering, Vidyavardhaka College of Engineering,

Mysore, Karnataka, India.

Abstract – Successful patient queue administration to limit a few minutes expectation and proposal exceedingly
quiet hold up deferrals and patient congestion is one of the convoluted. A patient is typically required to experience
significant difficulties looked by healing centers. Pointless and examinations, investigations or tests (refereed as errands) as
irritating sits tight for long stretches result in generous human indicated by his condition. In such a case, more than one are
asset and time wastage and increment the dissatisfaction not dependent, while others may need to wait for the
persisted by patients. For each patient in the line, the fulfillment of dependent tasks. Most patients must sit tight for
aggregate treatment time of the considerable number of unpredictable yet long time in queue, waiting for their swing
patients before him is the time that he should wait. It would be to achieve every treatment undertaking.
helpful and best if the patients could get the most efficient
treatment and know the anticipated holding up time through In this paper, we center around helping patients finish
a versatile application that updates progressively. Hence, we their treatment assignments in an anticipated time and
propose a Patient Treatment Time Prediction (PTTP) making health organization to accomplish efficient treatment
calculation to foresee the sitting tight time for every treatment time plan, avoid congestion and insufficient queues. We
undertaking for a patient. We utilize reasonable patient utilize enormous reasonable information from different
information from different healing facilities to acquire a healing centers to build up a patient treatment time
patient treatment time display for each task. In light of utilization demonstrate. The reasonable patient information
expansive scale, reasonable dataset, the treatment time for are broke down precisely and thoroughly in light of
every patient in the present line of each task is estimated. In imperative parameters, such as patient treatment begin time,
view of the anticipated holding up time, a Hospital Queuing end time, patient age, and detail treatment content for each
Recommendation (HQR) framework is produced. HQR unique task. We recognize and estimate waiting time for
computes and predicts an efficient and advantageous different patients based on their conditions and activities
treatment design suggested for the patient. As a result of the performed amid treatment. The workflow of the patient
huge scale, reasonable data set and the necessity for constant treatment and wait structure is depicted in Fig.1.
reaction, the PTTP calculation and HQR framework command
efficiency and low dormancy reaction. We utilize netbeans, a
integrated development environment for java and mongodb as
database to accomplish the previously mentioned objectives.
Broad experimentation and re-enactment comes about show
the viability and materialness of our proposed model to
suggest a powerful treatment anticipate patients to limit their
hold up times in hospitals.

Key Words: Apache spark, big data, cloud computing,

hospital queuing recommendation, patient treatment
time prediction,RF algorithm.


Presently, most health organizations are overfull and need

viable persistent queue administration. Patient queue
administration and hold up time expectation make a testing
and confounded work on the grounds that every patient may
require distinctive stages/ tasks, for example, a checkup, Fig.1. Workflow of patient treatment and wait
different tests, e.g., a sugar level or blood test, X-beams or a model.
CT check, minor surgeries, amid treatment. We call every one
of these stages/activities as treatment tasks or tasks or Fig. 1 represents three patients (Patient1, Patient2, and
errand in this paper. Every treatment errand can have Patient 3) and an arrangement of treatment undertakings
shifting time prerequisites for every patient, which sets aside required for each tolerant. A few errands can be reliant on a
past one, e.g., surgery is impossible before X-rays. Tasks {A,
© 2018, IRJET | Impact Factor value: 6.171 | ISO 9001:2008 Certified Journal | Page 1522
International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 05 Issue: 05 | May-2018 p-ISSN: 2395-0072

B, D} are required for Patient1, though undertaking D must relationship part basis. Other enhanced classification and
sit tight for the finishing of B. Tasks {E, B, C, A} are required regression tree strategies were proposed in [4][6].
for Patient 2, and Tasks {D, E, C} are required for Patient 3.
Additionally, there are diverse quantities of patients holding The random forest algorithm [7] is an outfit classification
up in the line of each errand, for instance, 7 patients in the algorithm in view of a decision tree, which is a reasonable
line of Task A and 5 patients in the line of assignment B. information digging calculation for huge information. The
irregular woodland calculation is broadly utilized as a part of
In this paper, a Patient Treatment Time Prediction (PTTP) numerous fields, for example, quick activity location by
model is prepared in light of healing facilities' chronicled means of discriminative random forest voting and Top-K sub
information. The holding up time of every treatment volume look [8], vigorous and exact shape show
undertaking is anticipated by PTTP, which is the entirety of coordinating utilizing random forest regression voting [9],
all patients' holding up times in the current line. At that and a huge information scientific system for shared botnet
point, as indicated by every patient's asked for treatment discovery utilizing random forest[10]. The test brings about
tasks, a Hospital Queuing-Recommendation (HQR) these papers exhibit the viability and appropriateness of the
framework suggests an efficient and helpful treatment random forest algorithm. Bernard [11] proposed a dynamic
design with the least deferrals for the patient. preparing technique to enhance the exactness of the random
forest algorithm. In [12], random forest algorithm technique
The patient treatment time utilization of every patient in in view of weighted trees was proposed to group high-
the holding up line is evaluated by the prepared PTTP dimensional uproarious information. Nonetheless, the first
demonstrate. The entire holding up time of each undertaking arbitrary backwoods calculation utilizes a customary direct
at the present time can be anticipated, for example, {T A = voting technique in the voting procedure. In such a case, the
35(min); TB =30(min); TC = 70(min); TD = 24(min); TE = random forest containing boisterous decision trees would
87(min)}. At long last, the undertakings of every patient are likely prompt an erroneous anticipate an incentive for the
arranged in a ascending order as indicated by the holding up testing dataset [13].
time, except from the dependent tasks. A lining suggestion is
performed for every patient, for example, the suggested Different proposal calculations have been introduced
lining { B,D,A} for Patient1, {B, A, C, E} for Patient2, and {D,C, furthermore, connected in related fields. Meng et al. [14]
E} for Patient3. proposed a keyword mindful administration suggestion
technique on MapReduce for huge information applications.
To finish the greater part of the required treatment tasks A movement recommendation calculation that mines
in the most limited holding up time, the holding up time of individuals' properties and travel-aggregate composes was
each tasks is anticipated continuously. Since the waiting time proposed in [15]. Yang et. al. [16] presented a Bayesian-
of line for each errand refreshes, the lining suggestion is inference based suggestion framework for online informal
recomputed in continuous. In this manner, every patient can communities, in which a client proliferates a substance
be encouraged to finish his treatment activities in the most rating question along the informal community to his
helpful path and with the most limited waiting time. immediate and aberrant companions. Adomavicius and
Kwon [17] presented new recommendation methods for
Health organization’s information is stored in the multi-criteria rating frameworks. Adomavicius and Tuzhilin
MongoDB and a parallel arrangement is utilized with the [18] presented an outline of the current generation of
MapReduce and Resilient Appropriated Datasets (RDD) recommendation strategy, for example, content-based,
Method using java programming model. The rest of the collaborative, and hybrid-recommendation suggestion
paper is sorted out as takes after. Segment 2 reviews related approaches. In any case, there is no predictive calculation for
work. Segment 3 describes problem definition, existing understanding treatment time utilization in the current
system, proposed system that is it describes a PTTP examinations.
calculation and a HQR framework, Section 4 describes
results of the PTTP system. At last, Section 5 concludes the The speed of data mining and investigation for huge
paper with future work and directions. information is an essential factor [19]. Distributed
computing, disseminated figuring, and supercomputers offer
2. RELATED WORK rapid registering control. Both the Apache Hadoop [20] and
Spark [21] are acclaimed cloud stages that are generally
To enhance the exactness of the information examination utilized as a part of parallel processing and information
with consistent highlights, different streamlining strategies investigation. Various parallel information mining
for classification and regression algorithms are proposed. A calculations have been executed in view of the MapReduce
self-versatile induction algorithm for incremental [22] and RDD [23] models. In [24]-[27], different
construction of binary regression trees was presented [1]. information mining calculations were proposed in view of
Tyree et al. [2] presented a parallel regression tree algorithm the MapReduce programming model. Apache Spark is an
calculation for web seeks positioning. In [3], a multi-branch efficient cloud stage that is reasonable for information
decision tree calculation was proposed in light of a mining and machine learning. In the Spark, information are
stored in memory, what's more, cycles for similar

© 2018, IRJET | Impact Factor value: 6.171 | ISO 9001:2008 Certified Journal | Page 1523
International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 05 Issue: 05 | May-2018 p-ISSN: 2395-0072

information come specifically from memory. Zaharia et al. In present scenario below mentioned systems are utilizing
[28] exhibited a quick and intuitive investigation over for queuing system.
Hadoop information with Spark.
Queue card system, the people in the queue are
To anticipate the deferral time for every treatment errand, assigned by numbers according to the arrival order.
we utilize the random forest calculation to prepare the
patient treatment time utilization in light of both patient and Smart queue system, The smart queue system
time attributes and after that fabricates the PTTP model. provides automatic queue numbers along with automatic
Since patient treatment time utilization is a constant voice calling and LED display panels on a progressive basis.
variable, a Classification and Regression Tree (CART) This service only eliminates the need to stand in an
demonstrate is utilized as a meta-classier in the RF organized line, but does not address a more productive
algorithm. Since of the inadequacies of the first RF algorithm method for time utilization.
and the attributes of the patient information, in this paper,
the RF calculation is enhanced in 4 angles to get a successful A PTTP model is proposed in view of a improved random
result from huge scale, high dimensional, consistent, and Forest (RF) calculation. The anticipated waiting time of
loud patient information. Contrasted and the first RF every treatment errand is gotten by the PTTP model, which
calculation, our PTTP calculation in light of an enhanced RF is the sum of all patients' plausible treatment times in the
calculation has significant preferences regarding accuracy present queue.
and performance. Besides, there is no current research on
healing facility lining administration and proposals. A HQR framework is proposed in light of the anticipated
Consequently, we propose a HQR framework in view of the waiting time. A treatment suggestion with an efficient and
PTTP model. To the best of our insight, this paper is the first advantageous treatment design and the minimum deferral
endeavor to illuminate the issue of patient waiting time for time is prescribed for every patient.
healing facility lining administration figuring. A treatment
queue proposal with an efficient and helpful treatment The PTTP calculation and HQR framework are parallelized
design and the minimum waiting time is prescribed for every on the Apache Spark cloud stage at the National
patient. Supercomputing Center in Changsha (NSCC) to accomplish
the previously mentioned objectives.
PTTP Model based on the improved RF Algorithm.
Prediction in light of examination and handling of
enormous noisy patient information from different hospitals To anticipate the waiting time for every patient
is a challenging task. A portion of the real difficulties areas treatment undertaking, the patient treatment time utilization
follows: in light of various quiet qualities and time attributes must
first be figured. The time utilization of every treatment
(1) Most of the information in doctor's facilities are errand won't not lie in same range, which differs as per the
enormous, unstructured, what's more, high substance of undertakings and different conditions, diverse
dimensional. Doctor's facilities deliver a colossal sum of periods, what's more, unique states of patients. In this way,
business information consistently that contain an we utilize the RF calculation to prepare understanding
extraordinary arrangement of data, for example, treatment time utilization in view of both patient and time
tolerant data, medicinal movement data, time, attributes and after that assemble the PTTP display.
treatment division, and definite data of the treatment
undertaking. Also, in light of the fact that of the manual
task and different sudden occasions amid medications,
a lot of inadequate or conflicting information shows up,
for example, an absence of patient sexual orientation
and age information, time irregularities caused when
zone settings of restorative machines from various
producers, and treatment records with just a begin time
yet no end time.

(2) The time utilization of the treatment assignments in

each office won't not lie in a similar range, which can Fig.2. PTTP model based on RF algorithm.
shift as per the substance of errands and different
conditions, diverse periods, and distinctive states of For some training data S, construct the training subsets
patients. For case, on account of a CT examine Strain, at the same time unselected data in each sampling are
undertaking, the time required for an old man is by and composed as an SOOB. Split the data into forks that should
large longer than that required for a youthful man. denote right data subsets and left data subsets. Based on this

© 2018, IRJET | Impact Factor value: 6.171 | ISO 9001:2008 Certified Journal | Page 1524
International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 05 Issue: 05 | May-2018 p-ISSN: 2395-0072

subsets construct the multi branch Classification and TABLE.II Data for different treatment tasks.
Regression Tree (CART).Then calculate mean value of leaf
nodes after removal of noisy data, calculate the accuracy of Treatme Format of the data(Feature Name)
each tree that is the weighted regression result H(X) of RF nt task
model for the data X is the average value of k trees, where wi {Patient card number, patient name, gender,
is the weight of tree hi. age, phone number, address, task name,
operation time}
Below mentioned Table .I shows examples of treatment {Patient card number, patient name, gender,
records, Table. II shows formats of the data for different Check up age, task name, department, doctor name,
treatment tasks. Table. III is example of features of treatment doctor position, start time, end time, context}
data for the PTTP algorithm. {Patient card number, patient name, task
name, amount, operation time}
TABLE.I Examples of treatment records. {Patient card number, patient name, task
name, dispensary, time of compounding, time
Pati Gen Ag Task Dept. Docto Start End of issue}
ent e Nam Name r Time Tim {Patient card number, patient name, gender,
No. e Name e CT Scan age, task name, department, doctor ,body
000 Male 16 Chec Surge Dr.Ch 2015 201 region scan, start time, end time, context}
1 k up ry en -10- 5- {Patient card number, patient name, gender,
10 10- age, task name, department, doctor ,start
08:3 10 time, end time, drug name, drug number,
0:03 08:4 remark}
2:25 {Patient card number, patient name, gender,
000 Male 16 Pay Cashi Null 2015 null age, task name, department, doctor , time of
1 ment er-6 -10- blood test, time of report}
10 … …
0:05 TABLE.III Features of treatment data for the PTTP
000 Male 16 CT- CT-5 Dr.Li 2015 201 algorithm.
1 scan -10- 5-
10 10- Feature Value range of each feature
09:2 10 Name subspace
0:00 09:2 Patient
7:00 P1 “Male”, ”Female”
000 Male 16 MR MR-8 Dr.Pa 2015 201 Patient
P2 The age of the patient
1 Scan n -10- 5- Age
10 10- Departmen
10:0 10 P3 All departments in hospital
5:06 10:1 Doctor
5:35 P4 All doctor in the hospital
000 Male 16 Take TCM- Null 2015 201 Each treatment task in all treatment
1 medi Phar -10- 5- P5 Task Name
process in the hospital
cine macy 10 10- P6 Start Time The start time of treatment task
10:4 10 P7 End Time The End time of treatment task
2:03 10:4 The day of week for the treatment
5:29 P8 Week time. The value is from Monday to
… … … … … … … … Sunday.
Time The time range of treatment time in
Range a day. The value is from 0 to 23.
(1)End time-Start time, such as a CT
scan, MR scan (2) Time interval
P10 Consumpti
between one patient and next in the
same treatment, such as payment.

© 2018, IRJET | Impact Factor value: 6.171 | ISO 9001:2008 Certified Journal | Page 1525
International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 05 Issue: 05 | May-2018 p-ISSN: 2395-0072

Hospital Queuing Recommendation System Based

on PTTP Model.

After training the PTTP model for every treatment errand

utilizing chronicled healing center treatment information, a
PTTP-based hospital queue recommendation framework is
created. An efficient and helpful treatment design is made
and prescribed to every patient to accomplish brilliant
triage. Expect that there are different treatment assignments
for every patient as indicated by the patient's condition, for
example, examinations and reviews. Let
Tasks={Task1,Task2,… ,Taskn} be an arrangement of
treatment assignments that the present patient must finish,
and let Ui = {Ui1, Ui2,…,Uim} be an arrangement of patients
in sitting tight the line for Taski. The procedure of the HQR Fig 5. Treatment tasks for patient to take appointment
framework in light of the PTTP display is appeared in Fig. 3.

Fig 6. Patient appointment list

Admin monitors the whole process. In home page,

Patient chooses patient option, where Patient register/login
to web page to take appointment and access his account.
Fig.3. Process of HQR system based on PTTP model. Patient takes appointment by choosing test to which he has
to undergone, date and doctor and related screenshot is
Predict the waiting time of all of the treatment tasks for shown as in the Fig 5. After taking appointment, patient will
the current patient, sort all of the treatment tasks of the get a confirmation mail to his respective registered email-id.
current patient in ascending order by waiting time then In home page, doctor chooses doctor option, where doctor
provide a hospital queuing recommendation for the current register/login to web page to start his duty. After login, he
patient. navigates to doctor’s page .It consists of functionalities such
as: view appointments as in Fig 6, view queries and reply,
4. RESULT AND DISCUSSION generate report .After taking treatment, doctor generates
report and send patient’s registered email-id.
The final result is a web application where it has three
modules are admin, doctor and patient, these modules have
different functionalities.
In this paper, a PTTP calculation in view of huge
information and the Apache Spark cloud condition is
proposed. An arbitrary Random Forest is performed for the
PTTP display. The line holding up time of every treatment
assignment is anticipated in view of the prepared PTTP
demonstrate. A parallel HQR framework is produced, and an
efficient and helpful treatment design is prescribed for every
patient. Broad investigations and application comes about
demonstrate that our PTTP calculation and HQR framework
accomplish high exactness and execution. Clinics'
information volumes are expanding each day. The workload
of preparing the authentic information in each arrangement

© 2018, IRJET | Impact Factor value: 6.171 | ISO 9001:2008 Certified Journal | Page 1526
International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056
Volume: 05 Issue: 05 | May-2018 p-ISSN: 2395-0072

of healing center guide suggestions is relied upon to be dimensional noisy data,'' in Proc. IEEE 7th Int. Conf. e-
exceptionally high, yet it require not be. Thus, an Business Eng. (ICEBE), Nov. 2010, pp. 160_163.
incremental PTTP calculation in light of spilling information
and a more advantageous suggestion with limited way [13] G. Biau, ``Analysis of a random forests model,'' J. Mach.
mindfulness are recommended for future work. Learn. Res., vol. 13, no. 1, pp. 1063_1095, Apr. 2012.

REFERENCES [14] S. Meng, W. Dou, X. Zhang, and J. Chen, ``KASR: A

keyword-aware service recommendation method on
[1] R. Fidalgo-Merino and M. Nunez, ``Self-adaptive induction MapReduce for big data applications,''IEEE Trans. Parallel
of regression trees,'' IEEE Trans. Pattern Anal. Mach. Intell., Distrib. Syst., vol. 25, no. 12, pp. 3221_3231, Dec. 2014.
vol. 33, no. 8,pp. 1659_1672, Aug. 2011.
[15] Y.-Y. Chen, A.-J. Cheng, and W. H. Hsu, ``Travel
[2] S. Tyree, K. Q. Weinberger, K. Agrawal, and J. Paykin, recommendation by mining people attributes and travel
``Parallel boosted regression trees for Web search ranking,'' group types from community-contributed photos,'' IEEE
in Proc. 20th Int. Conf. World Wide Web (WWW), 2012, pp. Trans. Multimedia, vol. 15, no. 6, pp. 1283_1295, Oct. 2013.
[16] X. Yang, Y. Guo, and Y. Liu, ``Bayesian-inference-based
[3] N. Salehi-Moghaddami, H. S. Yazdi, and H. Poostchi, recommendation in online social networks,'' IEEE Trans.
``Correlation based splitting criterion in multi branch Parallel Distrib. Syst., vol. 24, no. 4, pp. 642_651, Apr. 2013.
decision tree,'' Central Eur. J. Comput.Sci., vol. 1, no. 2, pp.
[17] G. Adomavicius and Y. Kwon, ``New recommendation
205_220, Jun. 2011.
techniques for multicriteria rating systems,'' IEEE Intell.
[4] G. Chrysos, P. Dagritzikos, I. Papaefstathiou, and A. Dollas, Syst., vol. 22, no. 3, pp. 48_55, May/Jun. 2007.
``HC-CART:A parallel system implementation of data mining
[18] G. Adomavicius and A. Tuzhilin, ``Toward the next
classification and regression tree (CART) algorithm on a
generation of recommender systems: A survey of the state-
multi-FPGA system,'' ACM Trans.Archit. Code Optim., vol. 9,
of-the-art and possible extensions,'' IEEE Trans. Knowl. Data
no. 4, pp. 47:1_47:25, Jan. 2013.
Eng., vol. 17, no. 6, pp. 734_749, Jun. 2005.
[5] N. T. Van Uyen and T. C. Chung, ``A new framework for
[19] X. Wu, X. Zhu, G.-Q. Wu, and W. Ding, ``Data mining with
distributed boosting algorithm,'' in Proc. Future Generat.
big data,'' IEEE Trans. Knowl. Data Eng., vol. 26, no. 1, pp.
Commun. Netw. (FGCN), Dec. 2007, pp. 420_423.
97_107, Jan. 2014.
[6] Y. Ben-Haim and E. Tom-Tov, ``A streaming parallel
[20] Apache. (Jan. 2015). Hadoop. [Online]. Available:
decision tree algorithm,'' J. Mach. Learn. Res., vol. 11, no. 1,
pp. 849_872, Oct. 2010.
[21] Apache. (Jan. 2015). Spark. [Online]. Available:
[7] L. Breiman, ``Random forests,'' Mach. Learn., vol. 45, no.
1, pp. 5_32, Oct. 2001.
[22] J. Dean and S. Ghemawat, ``MapReduce: Simpli_ed data
[8] G. Yu, N. A. Goussies, J. Yuan, and Z. Liu, ``Fast action
processing on large clusters,'' Commun. ACM, vol. 51, no. 1,
detection via discriminative random forest voting and top-K
pp. 107_113, Jan. 2008.
subvolume search,'' IEEE Trans. Multimedia, vol. 13, no. 3,
pp. 507_517, Jun. 2011. [23] M. Zaharia et al., ``Resilient distributed datasets: A fault-
tolerant abstraction for in-memory cluster computing,'' in
[9] C. Lindner, P. A. Bromiley, M. C. Ionita, and T. F. Cootes,
Proc. USENIX NSDI, 2012, pp. 1_14.
``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.

[10] 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. 488_497, Sep. 2014.

[11] S. Bernard, S. Adam, and L. Heutte, ``Dynamic random

forests,'' Pattern Recognit. Lett., vol. 33, no. 12, pp.
1580_1586, Sep. 2012.

[12] H. B. Li, W. Wang, H. W. Ding, and J. Dong, ``Trees

weighting random forest method for classifying high-

© 2018, IRJET | Impact Factor value: 6.171 | ISO 9001:2008 Certified Journal | Page 1527