Automated recognition of individual performers from de-identified video sequences

Chen, Zizui; Czarnuch, Stephen; Dove, Erica; Astell, Arlene

doi:10.1016/j.mlwa.2023.100450

Cited by 1 publication

(1 citation statement)

References 63 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is commonly used due to its ability to model linear and non-linear estimative structures [27]. MLPs are also widely employed in classification tasks, capable of arbitrarily approximating complex functions to obtain results [28]. The two most frequently used activation functions in learning models are Sigmoid and ReLu [29].…”

Section: Concerning Mlp-kmeansmentioning

confidence: 99%

A Clustering and PL/SQL-Based Method for Assessing MLP-Kmeans Modeling

Silva-Blancas,

Jiménez-Hernández,

Herrera-Navarro

et al. 2024

Computers

View full text Add to dashboard Cite

With new high-performance server technology in data centers and bunkers, optimizing search engines to process time and resource consumption efficiently is necessary. The database query system, upheld by the standard SQL language, has maintained the same functional design since the advent of PL/SQL. This situation is caused by recent research focused on computer resource management, encryption, and security rather than improving data mining based on AI tools, machine learning (ML), and artificial neural networks (ANNs). This work presents a projected methodology integrating a multilayer perceptron (MLP) with Kmeans. This methodology is compared with traditional PL/SQL tools and aims to improve the database response time while outlining future advantages for ML and Kmeans in data processing. We propose a new corollary: hk→H=SSE(C),wherek>0and∃X, executed on application software querying data collections with more than 306 thousand records. This study produced a comparative table between PL/SQL and MLP-Kmeans based on three hypotheses: line query, group query, and total query. The results show that line query increased to 9 ms, group query increased from 88 to 2460 ms, and total query from 13 to 279 ms. Testing one methodology against the other not only shows the incremental fatigue and time consumption that training brings to database query but also that the complexity of the use of a neural network is capable of producing more precision results than the simple use of PL/SQL instructions, and this will be more important in the future for domain-specific problems.

show abstract

Section: Concerning Mlp-kmeansmentioning

confidence: 99%