Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (3)

Search Parameters:
Keywords = friends-and-neighbors voting

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
25 pages, 3319 KB  
Article
Classification of Virtual Harassment on Social Networks Using Ensemble Learning Techniques
by Nureni Ayofe Azeez and Emad Fadhal
Appl. Sci. 2023, 13(7), 4570; https://doi.org/10.3390/app13074570 - 4 Apr 2023
Cited by 8 | Viewed by 2841
Abstract
Background: Internet social media platforms have become quite popular, enabling a wide range of online users to stay in touch with their friends and relatives wherever they are at any time. This has led to a significant increase in virtual crime from the [...] Read more.
Background: Internet social media platforms have become quite popular, enabling a wide range of online users to stay in touch with their friends and relatives wherever they are at any time. This has led to a significant increase in virtual crime from the inception of these platforms to the present day. Users are harassed online when confidential information about them is stolen, or when another user posts insulting or offensive comments about them. This has posed a significant threat to online social media users, both mentally and psychologically. Methods: This research compares traditional classifiers and ensemble learning in classifying virtual harassment in online social media networks by using both models with four different datasets: seven machine learning algorithms (Nave Bayes NB, Decision Tree DT, K Nearest Neighbor KNN, Logistics Regression LR, Neural Network NN, Quadratic Discriminant Analysis QDA, and Support Vector Machine SVM) and four ensemble learning models (Ada Boosting, Gradient Boosting, Random Forest, and Max Voting). Finally, we compared our results using twelve evaluation metrics, namely: Accuracy, Precision, Recall, F1-measure, Specificity, Matthew’s Correlation Coefficient (MCC), Cohen’s Kappa Coefficient KAPPA, Area Under Curve (AUC), False Discovery Rate (FDR), False Negative Rate (FNR), False Positive Rate (FPR), and Negative Predictive Value (NPV) were used to show the validity of our algorithms. Results: At the end of the experiments, For Dataset 1, Logistics Regression had the highest accuracy of 0.6923 for machine learning algorithms, while Max Voting Ensemble had the highest accuracy of 0.7047. For dataset 2, K-Nearest Neighbor, Support Vector Machine, and Logistics Regression all had the same highest accuracy of 0.8769 in the machine learning algorithm, while Random Forest and Gradient Boosting Ensemble both had the highest accuracy of 0.8779. For dataset 3, the Support Vector Machine had the highest accuracy of 0.9243 for the machine learning algorithms, while the Random Forest ensemble had the highest accuracy of 0.9258. For dataset 4, the Support Vector Machine and Logistics Regression both had 0.8383, while the Max voting ensemble obtained an accuracy of 0.8280. A bar chart was used to represent our results, showing the minimum, maximum, and quartile ranges. Conclusions: Undoubtedly, this technique has assisted in no small measure in comparing the selected machine learning algorithms as well as the ensemble for detecting and exposing various forms of cyber harassment in cyberspace. Finally, the best and weakest algorithms were revealed. Full article
Show Figures

Figure 1

21 pages, 3260 KB  
Article
An IoT-Fog-Cloud Integrated Framework for Real-Time Remote Cardiovascular Disease Diagnosis
by Abhilash Pati, Manoranjan Parhi, Mohammad Alnabhan, Binod Kumar Pattanayak, Ahmad Khader Habboush and Mohammad K. Al Nawayseh
Informatics 2023, 10(1), 21; https://doi.org/10.3390/informatics10010021 - 6 Feb 2023
Cited by 37 | Viewed by 4811
Abstract
Recently, it has proven difficult to make an immediate remote diagnosis of any coronary illness, including heart disease, diabetes, etc. The drawbacks of cloud computing infrastructures, such as excessive latency, bandwidth, energy consumption, security, and privacy concerns, have lately been addressed by Fog [...] Read more.
Recently, it has proven difficult to make an immediate remote diagnosis of any coronary illness, including heart disease, diabetes, etc. The drawbacks of cloud computing infrastructures, such as excessive latency, bandwidth, energy consumption, security, and privacy concerns, have lately been addressed by Fog computing with IoT applications. In this study, an IoT-Fog-Cloud integrated system, called a Fog-empowered framework for real-time analysis in heart patients using ENsemble Deep learning (FRIEND), has been introduced that can instantaneously facilitate remote diagnosis of heart patients. The proposed system was trained on the combined dataset of Long-Beach, Cleveland, Switzerland, and Hungarian heart disease datasets. We first tested the model with eight basic ML approaches, including the decision tree, logistic regression, random forest, naive Bayes, k-nearest neighbors, support vector machine, AdaBoost, and XGBoost approaches, and then applied ensemble methods including bagging classifiers, weighted averaging, and soft and hard voting to achieve enhanced outcomes and a deep neural network, a deep learning approach, with the ensemble methods. These models were validated using 16 performance and 9 network parameters to justify this work. The accuracy, PPV, TPR, TNR, and F1 scores of the experiments reached 94.27%, 97.59%, 96.09%, 75.44%, and 96.83%, respectively, which were comparatively higher when the deep neural network was assembled with bagging and hard-voting classifiers. The user-friendliness and the inclusion of Fog computing principles, instantaneous remote cardiac patient diagnosis, low latency, and low energy consumption, etc., are advantages confirmed according to the achieved experimental results. Full article
Show Figures

Figure 1

10 pages, 247 KB  
Article
Glass Houses and Friends-and-Neighbors Voting: An Exploratory Analysis of the Impact of Political Scandal on Localism
by Franklin G. Mixon
Economies 2018, 6(3), 48; https://doi.org/10.3390/economies6030048 - 3 Sep 2018
Cited by 4 | Viewed by 5110
Abstract
The 2017 U.S. Senate Special Election in Alabama, which was decided on 12 December 2017, was one of the most contentious and scandal-laden political campaigns in recent memory. The Republican candidate, Roy Moore, gained notoriety during the 2017 campaign when a number of [...] Read more.
The 2017 U.S. Senate Special Election in Alabama, which was decided on 12 December 2017, was one of the most contentious and scandal-laden political campaigns in recent memory. The Republican candidate, Roy Moore, gained notoriety during the 2017 campaign when a number of women alleged to national media that as teenagers they were subject to sexual advances by Moore, who was then in his early 30s and serving as a local assistant district attorney. The process and results of this particular election provide the heretofore unexamined impact of political scandal on localism or friends-and-neighbors voting in political contests. Based on data from the 2017 special election in Alabama, econometric results presented here suggest that a candidate who is embroiled in political scandal suffers an erosion in the usual friends-and-neighbors effect on his or her local vote share. In this particular case, the scandal hanging over Moore eroded all of the friends-and-neighbors effect that would have been expected (e.g., about five percentage points) in his home county, as well as about 40% of the advantage Moore had at home over his opponent in terms of constituent political ideology. Full article
(This article belongs to the Special Issue Public Choice)
Back to TopTop