| Literature DB >> 35571706 |
T Veeramakali1, A Shobanadevi1, Nihar Ranjan Nayak2, Sumit Kumar3, Sunita Singhal4, Manoharan Subramanian5.
Abstract
A key challenge in clinical recommendation systems is the problem of aberrant patient profiles in social networks. As a result of a person's abnormal profile, numerous vests might be used to make fake remarks about them, cyber bullying, or cyber-attacks. Many clinical researchers have done extensive study on this topic. The most recent studies on this topic are summarized, and an overarching framework is provided. When it comes to the methods and datasets that make up the data collection, the feature presentation and algorithm selection layers provide an overview of the various types of algorithm selections available. The categorization and evaluation of diseases and disorders has been one of the major advantages of machine learning in medical. Because it was harder to predict, it rendered it more controllable. It might range from difficult-to-find cancers in the early stages to certain other illnesses spread through the bloodstream. In healthcare, we may pick methods in machine learning depending on reliable outcomes. To do so, we must run the findings through each method. The major issue arises during information training and validation. Because the dataset is so large, eliminating mistakes might be difficult. The providers, other characteristics, various algorithms, data labelling techniques, and assessment criteria are all presented and contrasted in depth. Detecting anomalous users in medical social networks, on the other hand, is a work in progress. The result evaluation layer provides an explanation of how to evaluate and mark up the results of the various algorithm selection layers. Finally, it looks forward to more study in this area.Entities:
Mesh:
Year: 2022 PMID: 35571706 PMCID: PMC9098267 DOI: 10.1155/2022/4690936
Source DB: PubMed Journal: Comput Intell Neurosci
Types of abnormal users.
| Abnormal user types | Main existence platform |
|---|---|
| Spammer | Twitter, Weibo platform, CNN, Amazon, Yelp |
| Hoaxes | Wikipedia |
| Bot | |
| Sock-puppet | Wikipedia, Twitter, Facebook, CNN |
| Troll | Slashdot zoo, Wikipedia |
| Fake user | Google, Twitter, Amazon |
| Vandal | Twitter, Wikipedia, TCP |
Figure 1Abnormal user architecture of healthcare social networks.
Comparison of detection characteristics.
| Detection feature | Features | The essential | Feature evaluation |
|---|---|---|---|
| Attribute characteristics | Using artificial design methods, it is easy to bypass attackers. The algorithm design is simple; the efficiency is low, the accuracy rate is relatively low, the data level is trim, and it has strict privacy protection. | Breakthrough privacy protection | Uncommonly used |
|
| |||
| Content characteristics | Natural language processing method is adopted, which is easy to be bypassed by attackers. In addition, the algorithm design is complicated, the efficiency is low, the accuracy rate is relatively low, the data level is significant, and the privacy protection is slight. | Design complex algorithms and reasonable language models | Commonly used |
|
| |||
| Network characteristics | Adopting complex network processing methods, not easy to be bypassed by attackers, simple algorithm design, low efficiency, relatively low accuracy rate, significant data level, and no privacy protection. | Master the global structure | Mainstream |
|
| |||
| Activity characteristics | Using behavioural pattern analysis and processing methods, it is not easy to bypass attackers; the algorithm design is simple, the efficiency is high, the accuracy rate is high, the data level is significant, and the privacy protection is slight. | Select the most distinguishable activity information | Mainstream |
|
| |||
| Auxiliary features | Using time-series model analysis, it is not easy to bypass attackers; the algorithm design is complex, the efficiency is high, the accuracy rate is high, the data level is trim, and it has slight privacy protection. | Effective use of time dimension information | Popular |
Classification of detection algorithms.
| Algorithm | Thought | Algorithm key issues | |
|---|---|---|---|
| Supervised algorithm | Single classification algorithm | Classification | Select the key feature with the greatest degree of discrimination |
| Integrated classification algorithm | |||
|
| |||
| Unsupervised algorithm | Decomposition mining from top to bottom | Clustering | Choose a reasonable similarity index |
| Cluster mining from bottom to top | |||
|
| |||
| Graph algorithm | Spectral decomposition | Graph outlier detection | Processing large-scale sparse graph data |
| Random walk | |||
Comparison of detection algorithms.
| Detection algorithm | Advantage | Shortcoming |
|---|---|---|
| Supervised algorithm | (1) High accuracy | (1) Need to include label data |
| (2) Fast detection speed and high efficiency | (2) Need to train in advance | |
| (3) Mature algorithm design and mature deployment technology | (3) Need to select distinguishing features | |
| (4) Good real-time | (4) The selected features are easy to be bypassed by attackers, and the unknown mode detection effect is poor | |
|
| ||
| Unsupervised algorithm | (1) Only need not contain label data | (1) Low accuracy |
| (2) No need to train in advance | (2) The algorithm design is complicated, and the efficiency is low | |
| (3) Effective detection of unknown patterns | (3) Poor real-time performance | |
|
| ||
| Graph algorithm | (1) Only graph data are needed | (1) Low accuracy and poor real-time performance |
| (2) No need to train in advance | (2) The theoretical assumptions are complicated, and the reality is untenable | |
| (3) Effective detection of unknown patterns | (3) The algorithm design is complex, and the efficiency is low | |
| (4) There are different differences in social networks | ||
Method evaluation indicators.
| Methodological review | Formal definition |
|---|---|
| Accuracy |
|
| Precision |
|
| Recall |
|
| F1-score |
|
| MCC |
|
Comparison of graph-based technique and SVM.
| Technique | Accuracy | Precision | Recall | F1-score | ||||
|---|---|---|---|---|---|---|---|---|
| PM | MH | PM | MH | PM | MH | PM | MH | |
| Graph-based technique | 81.56 | 84.24 | 74.12 | 76.52 | 65.64 | 69.84 | 75.52 | 76.24 |
| SVM | 89.32 | 92.14 | 78.28 | 81.86 | 75.52 | 76.52 | 86.61 | 88.34 |
Figure 2Accuracy of SVM and graph-based technique.
Figure 3Precision of SVM and graph-based technique.
Figure 4Recall of SVM and graph-based technique.
Figure 5F1-score of SVM and graph-based technique.