Shortest Path Calculation: A Comparative Study for Location-Based Recommender System

The majority of the patient conclusion rotates around in distinguishing variations from the norm in their particular restorative pictures. These pictures are of different kinds, likely Ultrasound, CT Scan, MRI and infinitesimal pictures like bio-synthetic slides, smaller scale organic slides and neurotic slides. Barely any irregularities are cracks, awful cells in blood, tumors, contagious recognizable proof and so on. Finding the unusual segments, abnormalities in these pictures needs aptitude by the doctor; this adept recognizable proof advances and ensures sound drug by the doctor or specialist to persistent. In medicinal infinitesimal pictures ordinary bits and strange segments are combined. None of the irregular segments are identified with strange and typical parts of picture for example deviations are dissipated among ordinary bits of picture. These deviations are absent in certain bits for explicit region in the pictures. None of these deviations are covered nor can be gathered into a solitary segment physically in the picture. Deviations can be segregated alongside typical segments of pictures. Recognizing such deviations incompletely goes under bunching. This venture recognizes deviations in Medical Microscopic pictures. These deviations can be distinguished outwardly which uncovers about the nearness of deviation however to know the level of deviation in an example picture is basic. So as to accomplish this all deviations must be associated. This task interfaces all deviations utilizing Shortest Path calculation and bunches utilizing Hierarchical Clustering calculations.

Download Full-text

A Comparative Study of Graph Kernels and Clustering Algorithms

International Journal of Multimedia Data Engineering and Management ◽

10.4018/ijmdem.2021010103 ◽

2021 ◽

Vol 12 (1) ◽

pp. 33-48

Author(s):

Riju Bhattacharya ◽

Naresh Kumar Nagwani ◽

Sarsij Tripathi

Keyword(s):

Random Walk ◽

Comparative Study ◽

Shortest Path ◽

Kernel Method ◽

Graph Clustering ◽

Self Organizing Map ◽

Clustering Methods ◽

Clustering Techniques ◽

Graph Kernels ◽

Silhouette Index

Graph kernels have evolved as a promising and popular method for graph clustering over the last decade. In this work, comparative study on the five standard graph kernel techniques for graph clustering has been performed. The graph kernels, namely vertex histogram kernel, shortest path kernel, graphlet kernel, k-step random walk kernel, and Weisfeiler-Lehman kernel have been compared for graph clustering. The clustering methods considered for the kernel comparison are hierarchical, k-means, model-based, fuzzy-based, and self-organizing map clustering techniques. The comparative study of kernel methods over the clustering techniques is performed on MUTAG benchmark dataset. Clustering performance is assessed with internal validation performance parameters such as connectivity, Dunn, and the silhouette index. Finally, the comparative analysis is done to facilitate researchers for selecting the appropriate kernel method for effective graph clustering. The proposed methodology elicits k-step random walk and shortest path kernel have performed best among all graph clustering approaches.

Download Full-text

Comparative study of recommender system approaches and movie recommendation using collaborative filtering

International Journal of Systems Assurance Engineering and Management ◽

10.1007/s13198-021-01087-x ◽

2021 ◽

Author(s):

Taushif Anwar ◽

V. Uma

Keyword(s):

Comparative Study ◽

Collaborative Filtering ◽

Recommender System ◽

Movie Recommendation ◽

System Approaches

Download Full-text

Comparative Study of AMPL, Pyomo and JuMP Optimization Modeling Languages on a Network Linear Programming Problem Example

Pomiary Automatyka Robotyka ◽

10.14313/par_241/23 ◽

2021 ◽

Vol 25 (3) ◽

pp. 23-30

Author(s):

Andrzej Karbowski ◽

Krzysztof Wyskiel

Keyword(s):

Linear Programming ◽

Comparative Study ◽

Programming Problem ◽

Data Structures ◽

Shortest Path ◽

Linear Programming Problem ◽

Modeling Languages ◽

Specific Data ◽

Optimization Modeling ◽

Network Problems

The purpose of this work is a comparative study of three languages (environments) of optimization modeling: AMPL, Pyomo and JuMP. The comparison will be based on three implementations of the shortest path problem formulated as a linear programming problem. The codes for individual models and differences between them will be presented and discussed. Various aspects will be taken into account, such as: simplicity and intuitiveness of implementation, availability of specific data structures for a LP network problems, etc.

Download Full-text

PENENTUAN ARAH LOKASI TUJUAN PENGUNJUNG DI RSUD ARIFIN ACHMAD

Jurnal IPTEKS Terapan ◽

10.22216/jit.2019.v13i2.3162 ◽

2019 ◽

Vol 13 (2) ◽

pp. 81

Author(s):

Widdya Rahmalina

Keyword(s):

Programming Languages ◽

General Hospital ◽

Shortest Path ◽

Search Algorithms ◽

Hospital Personnel ◽

Font Size ◽

Shortest Distance ◽

Starting Point ◽

Location Point ◽

Path Calculation

<div>AbstractHospital has several location point that are often visited by some people such as hospital personnel, patients, or visitors from outside. Each point of the location is interconnected by a path. To facilitate the visitors and residents of the hospital to finding the location point then used the shortest path, in addition to the shortest distance can also save time, especially in an emergency. In this research, Floyd-Warshall method is used to perform the shortest path calculation in Regional General Hospital Arifin Achmad and PHP programming languages as well as MySQL as data management into information. Floyd-Warshall is one of the search algorithms that can be used in calculating the shortest path, and is able to compare all possible paths in the graph for each side of all existing nodes. The data obtained shows that the RSUD consists of 40 points and 50 sides connecting each point. In the research will produce the shortest trajectory that will be passed based on from the starting point to the point of destination, the point that passed in the form of the name of the building and the distance that passed by visitors Arifin Achmad Hospital.Keywords: Location, Graph, Floyd-Warshall, PHP, MySql AbstrakRumah Sakit (RS) memiliki beberapa titik lokasi yang kerap dikunjungi oleh sebagian orang seperti petugas RS, pasien, maupun pengunjung dari luar. Setiap titik lokasi tersebut saling terhubung oleh suatu lintasan. Untuk memudahkan pengunjung dan penghuni RS dalam mencari titik lokasi maka digunakan lintasan terpendek, selain dapat menempuh jarak terpendek juga dapat menghemat waktu terutama dalam keadaan darurat. Pada penelitian ini digunakan metode Floyd-Warshall untuk melakukan perhitungan lintasan terpendek di Rumah Sakit Umum Daerah (RSUD) Arifin Achmad dan bahasa Pemograman PHP serta MySql sebagai pengelolaan data menjadi informasi. Floyd-Warshall merupakan salah satu algoritma pencarian yang dapat digunakan dalam menghitung lintasan terpendek, dan mampu membandingkan semua kemungkinan lintasan pada graf untuk setiap sisi dari semua simpul yang ada. Data yang diperoleh menunjukkan bahwa RSUD terdiri dari 40 titik dan 50 sisi yang menghubungkan setiap titik. Dalam penelitian ini menghasilkan pencarian lintasan terpendek yang akan di lewati berdasarkan dari titik awal ke titik tujuan, titik yang di lewati berupa nama gedung dan jarak yang dilewati pengunjungRSUD Arifin Achmad. Kata kunci : Lokasi, Graf, Floyd Warshall, PHP, MySql</div>

Download Full-text