scholarly journals An Empowered AdaBoost Algorithm Implementation: A COVID-19 Dataset Study

2022 ◽  
pp. 107912
Author(s):  
Ender Sevinç
Keyword(s):  
Adaboost Algorithm ◽  
Algorithm Implementation

SVM-based global vision system of sports competition and action recognition

2020 ◽  
pp. 1-12
Author(s):  
Changxin Sun ◽  
Di Ma
Keyword(s):  
Target Recognition ◽  
Vision System ◽  
Task Assignment ◽  
Recognition Algorithm ◽  
Control Factor ◽  
Training Time ◽  
Adaboost Algorithm ◽  
Advantages And Disadvantages ◽  
Time Control ◽  
Correlation Degree

In the research of intelligent sports vision systems, the stability and accuracy of vision system target recognition, the reasonable effectiveness of task assignment, and the advantages and disadvantages of path planning are the key factors for the vision system to successfully perform tasks. Aiming at the problem of target recognition errors caused by uneven brightness and mutations in sports competition, a dynamic template mechanism is proposed. In the target recognition algorithm, the correlation degree of data feature changes is fully considered, and the time control factor is introduced when using SVM for classification,At the same time, this study uses an unsupervised clustering method to design a classification strategy to achieve rapid target discrimination when the environmental brightness changes, which improves the accuracy of recognition. In addition, the Adaboost algorithm is selected as the machine learning method, and the algorithm is optimized from the aspects of fast feature selection and double threshold decision, which effectively improves the training time of the classifier. Finally, for complex human poses and partially occluded human targets, this paper proposes to express the entire human body through multiple parts. The experimental results show that this method can be used to detect sports players with multiple poses and partial occlusions in complex backgrounds and provides an effective technical means for detecting sports competition action characteristics in complex backgrounds.

Automatic construction of academic profile: A case of information science domain

2021 ◽  
pp. 016555152199804
Author(s):  
Qian Geng ◽  
Ziang Chuai ◽  
Jian Jin
Keyword(s):  
Information Science ◽  
Binary Classification ◽  
Learning To Rank ◽  
Semantic Distance ◽  
Background Information ◽  
Training Dataset ◽  
Initial Vector ◽  
Specific Domain ◽  
Adaboost Algorithm ◽  
Domain Specific

To provide junior researchers with domain-specific concepts efficiently, an automatic approach for academic profiling is needed. First, to obtain personal records of a given scholar, typical supervised approaches often utilise structured data like infobox in Wikipedia as training dataset, but it may lead to a severe mis-labelling problem when they are utilised to train a model directly. To address this problem, a new relation embedding method is proposed for fine-grained entity typing, in which the initial vector of entities and a new penalty scheme are considered, based on the semantic distance of entities and relations. Also, to highlight critical concepts relevant to renowned scholars, scholars’ selective bibliographies which contain massive academic terms are analysed by a newly proposed extraction method based on logistic regression, AdaBoost algorithm and learning-to-rank techniques. It bridges the gap that conventional supervised methods only return binary classification results and fail to help researchers understand the relative importance of selected concepts. Categories of experiments on academic profiling and corresponding benchmark datasets demonstrate that proposed approaches outperform existing methods notably. The proposed techniques provide an automatic way for junior researchers to obtain organised knowledge in a specific domain, including scholars’ background information and domain-specific concepts.

Measurement of Soil Bulk Density and Water Content with Time Domain Reflectometry: Algorithm Implementation and Method Analysis

2021 ◽  
pp. 126389
Author(s):  
Marco Bittelli ◽  
Fausto Tomei ◽  
Anbazhagan P. ◽  
Raghuveer Rao Pallapati ◽  
Puskar Mahajan ◽  
...  
Keyword(s):  
Water Content ◽  
Bulk Density ◽  
Time Domain ◽  
Soil Bulk Density ◽  
Time Domain Reflectometry ◽  
Algorithm Implementation ◽  
Method Analysis

scholarly journals Application of portrait recognition system for emergency evacuation in mass emergencies

2021 ◽  
Vol 30 (1) ◽  
pp. 893-902
Author(s):  
Ke Xu
Keyword(s):  
Detection Rate ◽  
Characteristic Curve ◽  
Recognition Rate ◽  
Recognition System ◽  
Emergency Evacuation ◽  
Shopping Mall ◽  
Single Shot ◽  
Data Set ◽  
Linear Discriminant ◽  
Adaboost Algorithm

Abstract A portrait recognition system can play an important role in emergency evacuation in mass emergencies. This paper designed a portrait recognition system, analyzed the overall structure of the system and the method of image preprocessing, and used the Single Shot MultiBox Detector (SSD) algorithm for portrait detection. It also designed an improved algorithm combining principal component analysis (PCA) with linear discriminant analysis (LDA) for portrait recognition and tested the system by applying it in a shopping mall to collect and monitor the portrait and establish a data set. The results showed that the missing detection rate and false detection rate of the SSD algorithm were 0.78 and 2.89%, respectively, which were lower than those of the AdaBoost algorithm. Comparisons with PCA, LDA, and PCA + LDA algorithms demonstrated that the recognition rate of the improved PCA + LDA algorithm was the highest, which was 95.8%, the area under the receiver operating characteristic curve was the largest, and the recognition time was the shortest, which was 465 ms. The experimental results show that the improved PCA + LDA algorithm is reliable in portrait recognition and can be used for emergency evacuation in mass emergencies.

Improving the Appropriateness of Advanced Life Support Teams’ Dispatch: A Before-After Study

2021 ◽  
pp. 1-7
Author(s):  
Lorenzo Gamberini ◽  
Cosimo Picoco ◽  
Donatella Del Giudice ◽  
Corrado Zenesini ◽  
Marco Tartaglione ◽  
...  
Keyword(s):  
Sensitivity And Specificity ◽  
Life Support ◽  
Advanced Life Support ◽  
Emergency Operation ◽  
Support Teams ◽  
Global Sensitivity ◽  
Emergency Logistics ◽  
Prehospital Emergency ◽  
Task Time ◽  
Algorithm Implementation

Abstract Background and Importance: The dispatch of Advanced Life Support (ALS) teams in Emergency Medical Services (EMS) is still a hardly studied aspect of prehospital emergency logistics. In 2015, the dispatch algorithm of Emilia Est Emergency Operation Centre (EE-EOC) was implemented and the dispatch of ALS teams was changed from primary to secondary based on triage of dispatched vehicles for high-priority interventions when teams with Immediate Life Support (ILS) skills were dispatched. Objectives: This study aimed to evaluate the effects on the appropriateness of ALS teams’ intervention and their employment time, and to compare sensitivity and specificity of the algorithm implementation. Design: This was a retrospective before-after observational study. Settings and Participants: Primary dispatches managed by EE-EOC involving ambulances and/or ALS teams were included. Two groups were created on the basis of the years of intervention (2013-2014 versus 2017-2018). Intervention: A switch from primary to secondary dispatch of ALS teams in case of high-priority dispatches managed by ILS teams was implemented. Outcomes: Appropriateness of ALS team intervention, total task time of ALS vehicles, and sensitivity and specificity of the algorithm were reviewed. Results: The study included 242,501 emergency calls that generated 56,567 red code dispatches. The new algorithm significantly increased global sensitivity and specificity of the system in terms of recognition of potential need of ALS intervention and the specificity of primary ALS dispatch. The appropriateness of ALS intervention was significantly increased; total tasking time per day for ALS and the number of critical dispatches without ALS available were reduced. Conclusion: The revision of the dispatch criteria and the extension of the two-tiered dispatch for ALS teams significantly increased the appropriateness of ALS intervention and reduced both the global tasking time and the number of high-priority dispatches without ALS teams available.

scholarly journals Entropy-Based Approach in Selection Exact String-Matching Algorithms

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 31
Author(s):  
Ivan Markić ◽  
Maja Štula ◽  
Marija Zorić ◽  
Darko Stipaničev
Keyword(s):  
String Matching ◽  
Quantitative Measure ◽  
Search Pattern ◽  
Maximum Efficiency ◽  
Resource Usage ◽  
Specific Domain ◽  
Matching Problems ◽  
Algorithm Efficiency ◽  
Testing Algorithm ◽  
Algorithm Implementation

The string-matching paradigm is applied in every computer science and science branch in general. The existence of a plethora of string-matching algorithms makes it hard to choose the best one for any particular case. Expressing, measuring, and testing algorithm efficiency is a challenging task with many potential pitfalls. Algorithm efficiency can be measured based on the usage of different resources. In software engineering, algorithmic productivity is a property of an algorithm execution identified with the computational resources the algorithm consumes. Resource usage in algorithm execution could be determined, and for maximum efficiency, the goal is to minimize resource usage. Guided by the fact that standard measures of algorithm efficiency, such as execution time, directly depend on the number of executed actions. Without touching the problematics of computer power consumption or memory, which also depends on the algorithm type and the techniques used in algorithm development, we have developed a methodology which enables the researchers to choose an efficient algorithm for a specific domain. String searching algorithms efficiency is usually observed independently from the domain texts being searched. This research paper aims to present the idea that algorithm efficiency depends on the properties of searched string and properties of the texts being searched, accompanied by the theoretical analysis of the proposed approach. In the proposed methodology, algorithm efficiency is expressed through character comparison count metrics. The character comparison count metrics is a formal quantitative measure independent of algorithm implementation subtleties and computer platform differences. The model is developed for a particular problem domain by using appropriate domain data (patterns and texts) and provides for a specific domain the ranking of algorithms according to the patterns’ entropy. The proposed approach is limited to on-line exact string-matching problems based on information entropy for a search pattern. Meticulous empirical testing depicts the methodology implementation and purports soundness of the methodology.

Sign in / Sign up

Export Citation Format

Share Document